Anti-pollution network encoding method based on probability detection

Abstract

The invention discloses an anti-pollution network encoding method based on probability detection, which comprises the following steps of: each node of the network randomly selects t keys from a key pool by adopting a probability key predistribution mechanism; an information source node cuts and expands information into n original vectors; the information source node selects t pairs of safety parameters and a pseudorandom sequence generator and computes t information authentication codes for each original vector by utilizing the t keys; the information source node or an intermediate node can compute t information authentication codes for new code vectors by utilizing homogeneity; the intermediate node or an information sink node authenticates the integrality and the effectiveness of received code vector data by utilizing shared keys of the intermediate node or the information sink node and the information source node; and the information sink node can decode to obtain original information after receiving n linearly independent code vectors and authenticating the n linearly independent code vectors. The invention has good safety property, high pollution detection probability, little communication overhead and fast authentication and is suitable for the safety application of network codes.

Description

technical field [0001] The present invention belongs to the technical field of communication network security, in particular to an anti-pollution network coding scheme, which utilizes the probabilistic key pre-distribution mechanism and the property of homomorphism, so that the intermediate node and the sink node can complete the received coding vector Probabilistic verification of security and validity is carried out to ensure the security of network coding of each node. Background technique [0002] The introduction of network coding technology has brought many advantages to the existing network, including increasing the throughput of the network, improving the reliability of the network, and reducing the energy consumption of communication. But at the same time, network coding also brings many security problems that cannot be ignored, and pollution attack is one of them. Pollution attack means that in a network coding system, a malicious node can maliciously modify the t...

AI Technical Summary

Problems solved by technology

Later, American scholars Gkantsidis and Rodriguez introduced the homomorphic signature method into secure network coding in the paper "Cooperative Security for Network Coding File Distribution" on "IEEE INFOCOM" in 2006, but this method requires additional The secure channel transmits the signature value, and the calculation complexity is high, and the communication overhead is large

At the "IEEEINFOCOM" conference in 2009, Z.Yu, Y.Wei, B.Ramkumar and Y.Guan proposed a method using key pre-distribution and signature in their paper "An Efficient Scheme for Securing XOR Network Coding against Pollution Attack". Thought resistance pollution attack problem, although this method can effectively reduce the computational complexity of verification information, its disadvantage is that the communication overhead increases with the increase of the number of original vectors involved in coding, it is more suitable for XOR network coding, not suitable for In addition, the detection probability of the pollution vector is not high enough for this method, and the pollution diffusion cannot be better suppressed, thus reducing the efficiency of the entire network

Images