A Privacy-Preserving Signature Scheme for Network Coding

In this paper, a novel privacy-preserving signature scheme for network coding is proposed, which can mitigate both intra-generation and inter-generation pollution attacks efficiently, and leverage the inherent security property of random network coding to prevent eavesdropping attacks at the same time. Our scheme is constructed on a bi-linear map between two multiplicative cyclic groups with the same order, and its security relies on the hardness of the discrete logarithm problem. We proved that the construction of our scheme is correct, and also showed that our scheme is resistant against both pollution attacks and eavesdropping attacks by demonstrating that the probabilities of an adversary recovering the native messages and forging a valid signature for a bogus packet are both negligible functions of the security parameter. We evaluated the performance of our scheme in terms of communication overhead and computational complexity, and carried out extensive experiments to compare the running time of different procedures between our scheme and several previous schemes. The experimental results showed that our scheme is more efficient than the previous schemes simulated.