Signature Scheme For Network Coding

It has been proven that network coding can be widely applied in wireless sensor networks, traditional networks, peer to peer and peer for peer systems, and provide significant benefits to networks, such as improved throughput, reduced congestion, increased reliability, reduced power consumption, and so on. However, network coding is very vulnerable to pollution attacks. In recent years, many authentication schemes have been proposed to defend against this kind of attacks, those schemes based on cryptographic approaches have higher security, and can defend against attacks from any amount of adversaries, therefore, this kind of schemes have more promising future.This paper proposed three signature schemes for network coding aims at kinds of disadvantages in published signature schemes, which will make network coding be used in various network systems. What's more, we have proved the security of the three signature schemes by using analysis and random oracle model:-One time signature scheme for network coding:Some signature schemes require to update the public keys when transmitting a new file, which will greatly increase the overload in the network. This proposed signature scheme uses one time secrete key based on homomorphic public cryptograpgy to sign the messages, and updating the secrete key when transmit a new file without changing the public key, it will not only reduce the overload in network, but also enhance the security of the scheme;-Fast signature scheme for network coding:Most of these prblished schemes are based on expensive computations, these schemes are inefficient for verifying messages, and are not suitable for scenarios with low computing capability, such as mobile Ad hoc networks and wireless sensor networks. This scheme proposed a novel signature scheme for network coding based on a linear homomorphic public cryptography, and using fast computation which greatly improved the efficiency of authentication when counteracting pollution attack for network coding. Experiment shows that the time complexity of verification in this signature scheme is much less than those in the existing algorithms.-Short signatures for multi-source network coding:All of these published schemes cannot be used in multi-source network coding, which has a broader application background than single-source network coding. In this signature schem, we proposed a novel homomorphic signature scheme based on bilinear pairings to stand against pollution attacks for multi-source network coding. The signatures in this scheme are publicly verifiable and the public keys are independent of the files so that this scheme can be used to authenticate multiple files without having to update public keys. The signature length in this scheme is as short as the shortest signatures of a single-source network, and the verification speed is faster than those signature schemes based on elliptic curves in the single-source network.