Transmission of information in a network is investigated in the presence of a global omniscient eavesdropper, where network errors occur on at most T links. In this case, existing secure error-correcting (SEC) scheme will fail to work. We propose a SEC scheme by combining error-correcting network codes with permutation coding (P-Coding). Comparing with the existing SEC schemes, the proposed scheme with PCoding degrades the security level. However, it can defeat the global eavesdropper with computational security. Moreover, while the existing SEC schemes always suffer a rate loss for security, the proposed scheme could achieve the maximum rate n-2τ without any rate loss, where n is the minimum of maxflow values between the source node and sink nodes.
展开▼
