Several Schemes For Secure Network Coding Resistant Pollution And Eavesdropping Attacks

In2000, Ahlswede et al. first proposed the theory of network coding, which adopts a transport protocol significantly different from the traditional store-and-forward mechanism. Because network coding theory allows the intermediate nodes to encode messages transferred through different links before which are forwarded, the transmission of multicast network reaches the maximum capacity upper bounded by the theory of "max flow/min cut". Furthermore, network coding has obvious advantages in energy saving, load balancing and improving the robustness of network.As further research on network coding, the security issues (information eavesdropping and data pollution) have aroused more and more concern. By now, many researchers have proposed plenty of methods and strategies against these two security issues, however some cryptography based solutions are at the expense of system performance, such as higher encoding complexity, low data transmission rate, large information redundancy and the low network throughput. Therefore how to effectively improve network throughput and robustness, with the secure network transmission, is a significant topic in the field of network coding. In this paper, we proposed some schemes against these two security issues.In this paper, we give the definition of network coding and introduce the related works in security problem. Then a network coding scheme against pollution prevention and eavesdropping is proposed. Our scheme employs both private key encryption and list decoding to resist the eavesdropping pollution attack respectively. The numerical analysis shows that the computational cost of both source coding and the decoding of destination are reduced. And the probability of weak safety requirements is met by nearly100%. Furthermore a novel digital signature based coding scheme (SCH NC) is presented. This scheme can not only resist pollution attack, but also efficiently identify the position of attack source. Finally, apart from two aforementioned schemes, we design a pollution-free protocol based on CRC. This protocol employs a fast parallel CRC check code and message timestamp to effectively resist pollution attack and replay attack. Security analysis and efficiency analysis shows that applying network coding, parallel CRC check code and message timestamp together can greatly reduce the computational cost of the node, improve the network throughput.