Secret Error-Correcting Network Coding against Eavesdropping and Pollution Attacks
In this work we consider the problem of designing a secret error-correcting network coding scheme against an adversary that can re-select the μtapping links in different time slot and inject z erroneous packets into network. We first derive a necessary condition for keeping the transmitted information secret from the adversary, while the network is only subject to the eavesdropping attack. We then design an error-correcting scheme by combining the rank-metric codes with shared secret model, which can decode the transmitted information correctly provided a sufficiently large q. With that, a secret error-correcting network coding is proposed by combining this error-correcting scheme with secret communication. We show that under the requirement of 22z+μ + <k communication can achieve a rate of k-μ-z packets. Moreover, it ensures that the communicated information is reliable and information-theoretic security from the adversary. In particular, the requirement of packet length is not as large as the required in 12. Finally, the security and performance analyses illustrate the characteristics of our scheme.
Network coding eavesdropping attack error correction secret security rank-metric codes decoding
Siguang Chen Meng Wu Weifeng Lu
College of Computer Science, Nanjing University of Posts and Telecommunications, Nanjing, China College of Telecommunications & Information Engineering, Nanjing University of Posts and Telecommuni
国际会议
沈阳
英文
1499-1507
2011-11-22（万方平台首次上网日期，不代表论文的发表时间）