Study On Secure Network Coding Against Pollution Attacks

We all know,with the rapid development of wireless network communication,the demand of network information security and high-efficient transmission is increasing for more and more researchers.It is the first time that network coding makes coding and routing integrated,built a new network architecture.Hence,network coding theory can make the multicast network to achieve the upper bounds of the transmission capacity.It is shown that network coding technology has obvious advantages on improving networks throughput and network load balance,saving energy consumption of nodes and enhancing robustness of networks.Though network coding potentially improved network throughput,as network code allows intermediate nodes encode packets,thus,malicious intermediate nodes or external adversaries can inject false packets or forge packets in order to pollute the whole network,then,destinations can not decode correctly.This paper aims at the security of network code,we design several security and efficient schemes against pollution attack in network by combining network code with authentication code technique or combining network code with cyclic redundancy check code technique.In this paper,detection nodes(including destination nodes)verify the origin and integrity of packets which may be forged by malicious intermediate nodes or injected deliberately by external adversaries.The main results of this paper involves the following aspects:1.We proposed a secure scheme to address pollution attacks by combining linear network coding technique and authentication code technique,where a trusted authority generates private key by exploiting Chinese remainder theorem.The scheme allows intermediate nodes and destinations verify the messages' origin and its integrity with their private keys without decoding.We finally discussed the efficiency of the proposed scheme from computational cost and storage cost.2.We proposed a CRC-NC(Cyclic Redundancy Check-Network Coding)scheme against pollution attack that exploit random linear network coding and cyclic redundancy check code approach to detecting the trustworthiness of the packets by computing the hamming weights of the packets.The scheme can decrease the probability of decoding error in the presence of pollution attack in the wireless two-way communication.We showed that the CRC-NC scheme provides a significantly lower probability of decoding error than the random selection scheme and cryptographic scheme that require computational and bandwidth overheads.3.We proposed a secure scheme against pollution attack by exploiting random linear network coding and authentication code technique which combining permutation function with Kronecker delta function to generate private key and design a tag.We showed that the scheme is correct and secure,and the scheme provides a significantly lower computation cost.