Research On Secure Network Coding Of Anti - Eavesdropping And Pollution Prevention

Network coding, with its development,is playing a positive role in the field of traditional computer networks, wireless sensor networks and P2P systems. Network coding earns more and more widely attention among many universities and research institutions, especially in the period of the rapid development of global mobile Internet and Internet of things, in which a lot of routing infrastructure are needed. Network coding is a very suitable application in the wireless networks and sensor networks, and it is of great practical application value. But compared with the traditional network, it is more vulnerable to be attacked, and it is more harmful after being attacked.Thus the security of the network coding is the main restriction for applying network coding theory into the practice.Security issues mainly including eavesdropping attack and pollution attack. Eavesdropping attack refers to the attacker who gets some information from the internet in the way of eavesdropping, thus decoding the real information transmitted on the internet. Pollution attack refers to the attacker’s deleting, tampering and injection of some information, so that the receiver would not receive the true information. The text mainly discuss the security issues of pollution attack and eavesdropping attack existed in network coding, and puts forward the relevant security network coding model and application.Firstly, the text gives the definition of network coding, which involves two key definitions, namely, local and global coding vector encoding matrix. Presently, most of the research is aimed at a linear network coding and random network coding, so this text mainly introduces the linear network coding and random network coding. Then, the text gives the definition of the secure network coding as well as the network coding with eavesdropping attacks, with pollution attacks, and with the most serious attack combining both detailedly.Secondly, as for eavesdropping attacks, here we proposes a threshold scheme based on network coding, which can achieve the requirement of the lower security, and it can be of higher security in the case of eavesdropping attacks.Traditional threshold schemes can be achieved with the aid of complicated mathematical algorithm, and the distributor of the key are able to sent all participants the key fragmentation. While for network coding threshold schemes, key fragmentation are made at random by network coding, thus of no knowledge of each fragmentation, and is of some certain application value.Finally, as for the problem involves both attacks, this text puts forward a kind of network coding which can not only prevent eavesdropping attack but prevent the Byzantine attack. In this model, if there is a security channel, eavesdropping security can reach1, and if not, it can also reach a lower security. What’s more, receive nodes can detect the received information to know whether it is attacked by Byzantine attack or not, if it is attacked, it will abandon all the information received.