Date Added: Mar 2013
Network coding provides the advantage of maximizing the usage of network resources, and has great application prospects in future network communications. However, the properties of network coding also make the pollution attack more serious. In this paper, the authors give an unconditional secure authentication scheme for network coding based on a linear code C. Safavi-Naini and Wang gave an authentication code for multi-receivers and multiple messages. They notice that the scheme of Safavi-Naini and Wang is essentially constructed with Reed-Solomon codes. And they modify their construction slightly to make it serve for authenticating subspace codes over linear network. Also, they generalize the construction with linear codes.