Research On Secure Network Coding Against Pollution Attack

Compared to routing mechanisms, network coding has obvious advantages, such as increasing network throughput; improve network robustness to packet losses and so on.On the other hand, once some corrupted packets exist in the network, thus causing a large number of corrupted packets propagating in the network. Therefore pollution attack pose a real challenge to information security,which has received wide attention form scholars, this paper mainly deal with pollution attack in the multicast network with single source node and several sink nodes,our major contribution is followed:Firstly, we propose a defense scheme against pollution attack. This mechanism can distinguish pollution attack and random transmission errors and dynamically adjust the authentication strategy of intermediate nodes to achieve different level of security.Simulation result illustrated that our scheme has a lower bandwidth overhead and a lower time delay of verification process.Secondly, we propose a novel pollution attackers identification scheme. The thesis consider the problem of locating of malicious nodes, we let the non-repudiation of transmission protocol integrate into that adaptive defense scheme to prevent malicious nodes frame innocent nodes. The mechanism can accurately identify malicious nodes at a high probability.Thirdly, we analyze the relationship between the parameters for characterizing the network and efficiency of some prototypic schemes. Compared to normal network coding, secure network coding cause more communication overhead and computation overhead which decrease the throughput of network. Under specific network topology, several cryptography-based solutions which aim at handling pollution attack with different amounts of overhead are compared.Simulation results illustrate that there does not exist best secure network scheme concerning efficiency, but all selected schemes are more or less suited under certain network topologies.