基于鲁棒网络的抗污染攻击安全网络编码分析-analysis of anti-pollution attack security network coding based on robust network.docx

AbstractNetwork coding is a new information exchange technology combined routing and coding, which allows the network information flow approach the upper bound fixed by the max-flow min-cut theorem. The encoding operation improves the throughput of the network while also makes network coding is very vulnerable to pollution attacks. Any maliciously modified data fused with other data by encoding, which generated pollution data and distributed to all downlinks. If the downstream node receives the pollution data and use it for coding directly without detecting will result in a new round of pollution, eventually cause the entire system to a standstill.In order to solve the problem of pollution attacks in network coding, firstly, we propose to build robust network to enhance the anti-pollution attack capability for network coding. Improve the success rate of information transmission in the face of node failures and pollution attack through proper redundancy design. Based on the robust network models already existing, the robust network judgment method is given and the scheme of robust network for network coding is proposed. Secondly, we study schemes of pollution attacks detecting in network coding, discuss the pollution attacks detecting schemes base on linear space signature and information theory, improve the pollution attacks detection algorithm based on information theory, analysis the computational overhead of two schemes in different file sizes and data block size case, propose a combination scheme against pollution attack.Theory and simulation results show the effectiveness of the robust network. By analyzing the computational overhead of the combination scheme show that the scheme improves the performance to some extent.Keywords: robust network, pollution attack, secure network coding目录摘要................................................................................................................... IAbstract ...................................................