A Hybrid Scheme against Pollution Attack to Network Coding
Network coding allows intermediate nodes to encode data packets, which increases network throughput and enhances robustness. However, once a node injects corrupted data blocks into a network, the polluted data blocks will propagate quickly with network coding. Based on linear subspace and key predistribution, this paper proposes a HYBRID scheme against pollution attacks to network coding. Some typical properties of HYBRID are: (1) all nodes are able to detect polluted data blocks; (2) it prevents tag pollution attacks; (3) It does not need a very large field to implement and is computationally efficient; (4) It does not need a time synchronization of all nodes in a network and the correctness of each data packet can be verified immediately when it arrives at a node.
Xiaohu Wu Yinlong Xu Liping Xiang Wei Xu
School of Computer Science and Technology, University of Science & Technology of China, Key Laboratory on High Performance Computing, Anhui Province, Hefei, 230026 P.R.China
国际会议
2011 International Symposium on Network Coding(2011网络编码国际会议 NETCOD 2011)
北京
英文
1-4
2011-07-25（万方平台首次上网日期，不代表论文的发表时间）