Secure error-correcting (SEC) network codes

Abstract

We investigate transmission of information in a network in the presence of an adversary that can eavesdrop k channels and inject d errors into the network at the same time. We propose a deterministic construction of a secure error-correcting (SEC) network codes which can transmit information at rate m - 2d - k to all the sink nodes which protecting the information from eavesdropping and contamination by the adversary, where m is the minimum maxflow among all the sink nodes. We also show that this rate is optimal.