Abstract

ELLIPTIC CURVE CRYPTOGRAPHY FOR MESSAGE AUTHENTICATION IN WSN

Manjula M, Dr.T. Senthil Prakash , Ms.Ramya Raveendran

Volume: 6 Issue: 1 2016

Abstract:

Message authentication is one of the most effective ways to thwart unauthorized and corrupted messages from being forwarded in wireless sensor networks (WSNs). Message authentication schemes have been developed, based on either symmetric-key cryptosystems or public-key cryptosystems which, have the limitations of high computational and communication overhead in addition to lack of scalability and resilience to node compromise attacks. To address these issues, a polynomial-based scheme was recently introduced. However, this scheme and its extensions all have the weakness of a built-in threshold determined by the degree of the polynomial when the number of messages transmitted is larger than this threshold, the adversary can fully recover the polynomial. While enabling intermediate Nodes authentication, proposed scheme allows any node to transmit an unlimited number of messages without suffering the threshold problem. In addition, this scheme can also provide message source privacy. Both theoretical analysis and simulation results demonstrate that proposed scheme is more efficient than the polynomial-based approach in terms of computational and communication overhead under comparable security levels while providing message source privacy.

Back Download

References

• “Hop-by-Hop Message Authentication and Source Privacy in Wireless Sensor Networks “,Jian Li, Yun Li, Jian Ren, Senior Member, IEEE, and Jie Wu, Fellow, IEEE”,2015.
• “Cryptographic Key Length Recommendation,” http://www. keylength.com/en/3/, 2013. M. Albrecht, C. Gentry, S. Halevi, and J. Katz, “Attacking Crypto-graphic Schemes Based on ‘Perturbation Polynomials’,” Report 2009/098, http://eprint.iacr.org/, 2009.
• Pfitzmann and M. Hansen, “Anonymity, Unlinkability, Unobservability, Pseudonymity, and Identity Management Proposal for Terminology,” http://dud.inf.tudresden.de/ literatur/Anon_Terminology_v0.31.pdf, Feb. 2008.
• R. Watro, D. Kong, S. Cuti, C. Gardiner, C. Lynn, and P. Kruus, “Tinypk: Securing sensor networks with public key technology,” ACM SASN’04,October 2004.
• F. Ye, H. Lou, Statistical.Lu,en-routeandfilteringLof.injectedZhang,falsedata in “sensor networks,” IEEEinINFOCOM, March 2004.
• S. Zhu, S. Setia,As interleaved.Jajodia ,hop-by-hopauthentication and schemeP. For Ning, filteringfalse“ data in sensor networks,”IEEE inSymposium on Security and Privacy, 2004.
• Blundo, A. De Santis, A. Herzberg,Perfectly-secureSkey. distributionKutten,for U dynamic conferences,” Advancesin in Cryptology - Crypto’92,ser.Lecture Notes in Computer Science Volume 740, 1992, pp. 471–486.
• W. Zhang, N. Subramanian,Lightweight And compromise and Resilient G.Wang, messageauthentication in sensor networks,” IEEEin INFOCOM, Phoenix, AZ., April 15- 17 2008.
• M. Albrecht, C. Gentry,AttackingS.cryptographic Halevi,schemesand Jbased.Katz,on polynomials”,” Cryptology ePrint Archive, Report 2009.