An Efficient Short Null Keys Based Scheme for Securing Network Coding Against Pollution Attacks

摘要: Network coding has gained wide attention nowadays for its significant advantages on many aspects compared with traditional routing mechanism. However, if there are malicious nodes launching pollution attacks by tampering or forging data packets in the communication network, sink will suffer from failure decoding, together serious results such as bandwidth wasting, longer transmission delay and increasing computation overheads. The original null keys based detection scheme cannot efficiently defend against when system colluding attackers because of high Therefore, we firstly define concept complete space, property that no can pass verification. We then propose idea partial position design an algorithm to construct short keys. Secondly, provide a network coding, which lower overheads composing space. Finally, rigorous theoretical proofs given analyze security designed scheme.