This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On Homomorphic Signatures for Network Coding
September 2010 (vol. 59 no. 9)
pp. 1295-1296
Aaram Yun, University of Minnesota, Minneapolis
Jung Hee Cheon, Seoul National University, Seoul
Yongdae Kim, University of Minnesota, Minneapolis
In this paper, we examine homomorphic signatures that can be used to protect the integrity of network coding. In particular, Yu et al. proposed an RSA-based homomorphic signature scheme recently for this purpose. We show that their scheme in fact does not satisfy the required homomorphic property, and further, even though it can be fixed easily, still it allows no-message forgery attacks.

[1] R. Ahlswede, N. Cai, S.-Y.R. Li, and R.W. Yeung, "Network Information Flow," IEEE Trans. Information Theory, vol. 46, no. 4, pp. 1204-1216, July 2000.
[2] S.-Y.R. Li, R.W. Yeung, and N. Cai, "Linear Network Coding," IEEE Trans. on Information Theory, vol. 49, no. 2, pp. 371-381, 2003.
[3] T. Ho, R. Koetter, M. Médard, D.R. Karger, and M. Effros, "The Benefits of Coding over Routing in a Randomized Setting," Proc. of IEEE Int'l Symp. on Information Theory, p. 442, 2003.
[4] D. Boneh, D. Freeman, J. Katz, and B. Waters, "Signing a Linear Subspace: Signature Schemes for Network Coding," Proc. 12th Int'l Conf. Practice and Theory in Public Key Cryptography (PKC), http://eprint.iacr.org/2008316, 2009.
[5] Z. Yu, Y. Wei, B. Ramkumar, and Y. Guan, "An Efficient Signature-Based Scheme for Securing Network Coding Against Pollution Attacks," Proc. IEEE 27th Conf. Computer Communications (INFOCOM), pp. 1409-1417, Apr. 2008.
[6] D. Charles, K. Jain, and K. Lauter, "Signatures for Network Coding," Proc. 40th Ann. Conf. Information Sciences and Systems (CISS), pp. 857-863, Mar. 2006.
[7] M.N. Krohn, M.J. Freedman, and D. Mazières, "On-the-Fly Verification of Rateless Erasure Codes for Efficient Content Distribution," IEEE Symp. Security and Privacy, pp. 226-240, 2004.
[8] M. Bellare and P. Rogaway, "Random Oracles Are Practical: A Paradigm for Designing Efficient Protocols," Proc. First ACM Conf. Computer and Comm. Security pp. 62-73, 1993.
[9] D. Boneh, B. Lynn, and H. Shacham, "Short Signatures from the Weil Pairing," J. Cryptology, vol. 17, no. 4, pp. 297-319, Sept. 2004.

Index Terms:
Network coding, homomorphic signature, homomorphic hashing.
Citation:
Aaram Yun, Jung Hee Cheon, Yongdae Kim, "On Homomorphic Signatures for Network Coding," IEEE Transactions on Computers, vol. 59, no. 9, pp. 1295-1296, Sept. 2010, doi:10.1109/TC.2010.73
Usage of this product signifies your acceptance of the Terms of Use.