The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.10 - Oct. (2013 vol.62)
pp: 2096-2100
Chi Cheng , Huazhong University of Science and Technology, Wuhan
Tao Jiang , Huazhong University of Science and Technology, Wuhan
ABSTRACT
Recently, homomorphic message authentication code (MAC) schemes have been proposed to resist against pollution attacks in network coding. However, existing methods face a common challenge: the generated MAC $(t)$ belongs to a small finite field $({\hbox{\rlap{I}\kern 2.0pt{\hbox{F}}}}_{q})$, which means that an adversary could attack by randomly guessing the value of $(t)$, and succeed with probability $(1/q)$. Since $(q)$ is a predetermined system parameter which is typically set as $(2^8)$, the resulted security $(1/256)$ could be unsatisfactory in practice. In this paper, we propose an efficient homomorphic MAC for authentication in network coding. The proposed method achieves a reliable security parameter $(1/q^l)$ using only one key, where $(l)$ could be chosen according to different security requirements. Compared with previous approaches that using multiple tags, the proposed homomorphic MAC has both low computation and communication overheads.
INDEX TERMS
Games, Vectors, Equations, Network coding, Authentication, Pollution, homomorphic message authentication code, Network coding, pollution attack
CITATION
Chi Cheng, Tao Jiang, "An Efficient Homomorphic MAC with Small Key Size for Authentication in Network Coding", IEEE Transactions on Computers, vol.62, no. 10, pp. 2096-2100, Oct. 2013, doi:10.1109/TC.2012.135
REFERENCES
[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. Katti, H. Rahul, W. Hu, D. Katabi, M. Medard, and J. Crowcroft, "XORs in the Air: Practical Wireless Network Coding," IEEE/ACM Trans. Networking, vol. 16, no. 3, pp. 497-510, June 2008.
[3] C. Gkantsidis and P.R. Rodriguez, "Network Coding for Large Scale Content Distribution," Proc. IEEE INFOCOM, pp. 2235-2245, 2005.
[4] A.G. Dimakis, P.B. Godfrey, M.J. Wainwright, and K. Ramchandran, "Network Coding for Distributed Storage Systems," Proc. IEEE INFOCOM, pp. 2000-2008, 2007.
[5] M. Kim, L. Lima, F. Zhao, J. Barros, M. Medard, R. Koetter, T. Kalkert, and K.J. Han, "On Counteracting Byzantine Attacks in Network Coded Peer-To-Peer Networks," IEEE J. Selected Areas in Comm., vol. 28, no. 5, pp. 692-702, June 2010.
[6] J. Dong, R. Curtmola, and C. Nita-Rotaru, "Practical Defenses against Pollution Attacks in Wireless Network Coding," ACM Trans. Information and System Security, vol. 14, no. 1, pp. 7:1-7:31, May 2011.
[7] M. Krohn, M. Freedman, and D. Mazieres, "On-the-Fly Verification of Rateless Erasure Codes for Efficient Content Distribution," Proc. IEEE Symp. Security and Privacy, pp. 226-240, 2004.
[8] D. Charles, K. Jain, and K. Lauter, "Signatures for Network Coding," Proc. 40th Ann. Conf. Information Sciences and Systems, pp. 857-863, 2006.
[9] F. Zhao, T. Kalker, M. Medard, and K.J. Han, "Signatures for Content Distribution with Network Coding," Proc. IEEE Int'l Symp. Information Theory (ISIT), pp. 556-560, 2007.
[10] A. Yun, J.H. Cheon, and Y. Kim, "On Homomorphic Signatures for Network Coding," IEEE Trans. Computers, vol. 59, no. 9, pp. 1295-1296, Mar. 2010.
[11] F. Oggier and H. Fathi, "An Authentication Code against Pollution Attacks in Network Coding," IEEE/ACM Trans. Networking, vol. 16, no. 3, pp. 497-510, June 2011.
[12] R. Gennaro, J. Katz, H. Krawczyk, and T. Rabin, "Secure Network Coding over the Integers," Proc. Int'l Conf. Practice and Theory in Public Key Cryptography (PKC), pp. 142-160, 2010.
[13] L. Buttyan, L. Czap, and I. Vajda, "Detection and Recovery from Pollution Attacks in Coding Based Distributed Storage Schemes," IEEE Trans. Dependable and Secure Computing, vol. 8, no 6, pp. 824-838, Dec. 2011.
[14] S. Agrawal and D. Boneh, "Homomorphic MACs: MAC-Based Integrity for Network Coding," Proc. Applied Cryptography and Network Security, pp. 292-305, 2009.
[15] A. Perrig, R. Canetti, D. Song, and J.D. Tygar, "Efficient and Secure Source Authentication for Multicast," Proc. Network and Distributed System Security Symp. (NDSS), pp. 35-46, 2001.
[16] Y. Li, H. Yao, M. Chen, S. Jaggi, and A. Rosen, "RIPPLE Authentication for Network Coding," Proc. IEEE INFOCOM, pp. 2258-2266, 2010.
[17] A. Le and A. Markopoulou, "Locating Byzantine Attackers Using SpaceMac," Proc. IEEE Symp. Network Coding (NetCod), pp. 1-6, June 2010.
[18] A. Le and A. Markopoulou, "Cooperative Defense against Pollution Attacks in Network Coding Using SpaceMac," IEEE J. Selected Areas in Communications, vol. 30, no. 2, pp. 442-449, 2012.
[19] P. Zhang, Y. Jiang, C. Lin, H. Yao, A. Wasef, and X. Shen, "Padding for Orthogonality: Efficient Subspace Authentication for Network Coding," Proc. IEEE INFOCOM, pp. 1026-1034, 2011.
[20] P. Chou, Y. Wu, and K. Jain, "Practical Network Coding," Proc. Allerton Conf. Comm., Control, and Computing, 2003.
[21] R. Canetti, J. Garay, G. Itkis, D. Micciancio, M. Naor, and B. Pinkas, "Multicast Security: A Taxonomy and Some Efficient Constructions," Proc. IEEE INFOCOM, Mar. 1999.
[22] E. Barker, W. Barker, W. Burr, W. Polk, and M. Smid, "Recommendation for Key Management," Special Publication 800-57 Part 1, Revision 3, NIST, 2011.
[23] C. Cheng and T. Jiang, "A Novel Homomorphic MAC Scheme for Authentication in Network Coding," IEEE Comm. Letters, vol. 15, no. 11, pp. 1228-1230, Nov. 2011.
[24] J. Katz and Y. Lindell, Introduction to Modern Cryptography. Chapman & Hall/CRC Press, 2007.
[25] J.S. Plank, "Fast Galois Field Arithmetic Library in C/C++," Technical Report UT-CS-07-593, Univ. of Tennessee, Mar. 2007.
20 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool