Security analysis of a homomorphic signature scheme for network coding
Authors:
- 11 August 2015
- journal article
- research article
- Published by Wiley in Security and Communication Networks
- Vol. 8 (18) , 4053-4060
Abstract
Recently, Liu and Wang proposed a homomorphic signature scheme for network coding, which was claimed to resist against pollution attacks. However, we show that in Liu and Wang's scheme, after several generations, the adversary is able to launch a successful forgery attack with a high probability. Therefore, Liu and Wang's scheme is not secure. After analyzing the cause of the attack, an improved scheme is given, which can combat against the proposed attack in an efficient way. Copyright © 2015 John Wiley & Sons, Ltd.Keywords
Funding Information
- National Natural Science Foundation of China (61301166, 61370224, 61363069)
This publication has 22 references indexed in Scilit:
- Performance Bounds on a Wiretap Network With Arbitrary Wiretap SetsIEEE Transactions on Information Theory, 2014
- Verifiable delegation of computation on outsourced data2013
- Fully Homomorphic Message Authenticators2013
- Efficient Network Coding Signatures in the Standard Model2012
- Secure Network Coding over the Integers2010
- Signing a Linear Subspace: Signature Schemes for Network Coding2009
- Homomorphic MACs: MAC-Based Integrity for Network Coding2009
- Network coding for large scale content distribution2005
- ON THE KEYSPACE OF THE HILL CIPHERCryptologia, 2005
- Network information flowIEEE Transactions on Information Theory, 2000