Analysis And Study On The Security Of Network Coding

Other than traditional multicast routing algorithms, the intermediate nodes of network coding process the received information or data such as encoding and then forward it, not only duplicating and forwarding in multicast communication networks. Since the network information flow can approach the max-flow and the throughput is increased by adopting network coding. Simultaneously, the security of network coding is of importance as the research of network coding increases.At present the mainly security threats of network coding are the contamination and eavesdropping adversaries. The solutions of wiretapping attacks are categorized into two classes: information theoretically secure ones and weakly secure ones. The difference of these two classes is that the former does not allow the leakage of any information about the source while the latter disallows the leakage of any meaningful information. We classify the solutions against contamination adversaries into two classes depending on whether the pollution attacks are filtered by the forwarders or only the sinks.This paper first systematically introduces the basic theory of network coding. Then states a detailed explanation about linear network coding, introduces two construction ways and encoding symbol bounds respectively. Next presents the attack models and solutions of secure network coding, introduces a necessary condition in CSWN. We also propose our own thoughts in random number generating, seeds sending, hash computing on secure network coding against the contamination and eavesdropping adversaries. We introduce a exploratory study on the security of wire-tapping linear network coding. Also encoding matrix encoding strategy and the security function measurement of wire-tapping linear network coding are presented. The problem that choosing encoding vectors should avoid is given. At last we improve the encoding algorithm of paper [49], decrease the encoding complexity and save some memory space.