An Efficient Secure Key Issuing Protocol in ID-Based Cryptosystems
ITCC '05 Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01
Design and analysis of network codes
Design and analysis of network codes
Foundations and Trends® in Networking
Practical defenses against pollution attacks in intra-flow network coding for wireless mesh networks
Proceedings of the second ACM conference on Wireless network security
An efficient dynamic-identity based signature scheme for secure network coding
Computer Networks: The International Journal of Computer and Telecommunications Networking
On Homomorphic Signatures for Network Coding
IEEE Transactions on Computers
Preventing pollution attacks in multi-source network coding
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Reducing elliptic curve logarithms to logarithms in a finite field
IEEE Transactions on Information Theory
Hi-index | 0.25 |
It has been proven that network coding can provide significant benefits to networks. However, network coding is very vulnerable to pollution attacks. In recent years, many schemes have been designed to defend against these attacks, but as far as we know almost all of them are inapplicable for multi-source network coding system. This paper proposed a novel homomorphic signature scheme based on bilinear pairings to stand against pollution attacks for multi-source network coding, which has a broader application background than single-source network coding. Our signatures are publicly verifiable and the public keys are independent of the files so that our scheme can be used to authenticate multiple files without having to update public keys. The signature length of our proposed scheme is as short as the shortest signatures of a single-source network coding. The verification speed of our scheme is faster than those signature schemes based on elliptic curves in the single-source network.