Skip to main content

An Efficient ID Based Security Algorithm for Mutual Node Authentication and Key Management: An Elliptic Curve Cryptography Based Approach

  • Conference paper
Applied Algorithms (ICAA 2014)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 8321))

Included in the following conference series:

Abstract

The biggest challenge in the field of networking is the secured communication between the nodes within the network system; therefore it has become one of the major and attractive fields of research in computer network. The importance of Elliptic Curve Cryptography (ECC) in this field is increasing rapidly because of its smaller key size compare to other known public-key algorithms. Several user authentication and key management algorithms or schemes have been developed so far but most of them contain complex computations. Not only that, most of the schemes also rely on remote server for node authentication as well as node communication. In this paper, an ECC based algorithm has been proposed to overcome these kinds of complexities. The proposed work will do mutual authentication and session key management for node communication efficiently without putting extra burden on any server but with lesser computation time.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Stallings, W.: Cryptography and Network Security, Principles and Practice, 5th edn. Prentice Hall

    Google Scholar 

  2. Koblitz, N.: Elliptic Curve Cryptosystems. Mathematics of Computation, American Mathematical Society 48(177), 203–209 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  3. Lopez, J., Dahab, R.: An Overview of Elliptic Curve Cryptography. Technical Report IC-00-10, http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.2771

  4. Vigila, S.M.C., Muneeswaran, K.: Implementation of Text based Cryptosystem using Elliptic Curve Cryptography. In: First International Conference on Advanced Computing, December 13-15, pp. 82–85 (2009)

    Google Scholar 

  5. Hankerson, D., Menezes, A., Vanstone, S.: Guide to Elliptic Curve Cryptography. Springer (2004)

    Google Scholar 

  6. Li, F., Xin, X., Hu, Y.: Identity-based broadcast signcryption. Computer Standard and Interfaces 30, 89–94 (2008)

    Article  MATH  Google Scholar 

  7. Yang, J., Chang, C.: An ID-based remote mutual authentication with key agreement scheme for mobile devices on elliptic curve cryptosystem. Computer & Security, 138–143 (2009)

    Google Scholar 

  8. Choie, Y.J., Jeong, E., Lee, E.: Efficient identity-based authenticated key agreement protocol from pairings. Applied Mathematics and Computation 162(1), 179–188 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  9. Wu, S., Chiu, J., Chieu, B.: ID-based remote authentication with smart cards on open distributed system from Elliptic curve cryptography. In: IEEE International Conference on Electro Information Technology (May 2005)

    Google Scholar 

  10. Tian, X., Wong, D.S., Zhu, R.W.: Analysis and Improvement of Authenticated Key Exchange Protocol for Sensor Networks. IEEE Communication Letters 9(11), 970–972 (2005)

    Article  Google Scholar 

  11. Jia, Z., Zhang, Y., Shao, H., Lin, Y., Wang, J.: A Remote User Authentication Scheme Using Bilinear Pairings and ECC. In: Proceedings of the Sixth International Conference on Intelligent Systems Design and Applications (ISDA 2006), vol. 2, pp. 1091–1094 (October 2006)

    Google Scholar 

  12. Abi-Char, P.E., Mhamed, A., El-Hassan, B.A.: A Fast and Secure Elliptic Curve Based Authenticated Key Agreement Protocol For Low Power Mobile Communications. In: The 2007 International Conference on Next Generation Mobile Applications, Services and Technologies (September 2007)

    Google Scholar 

  13. Damasevicius, R., Ziberkas, G., Stuikys, V., Toldinas, J.: Energy Consumption of Hash Functions. Elektronika Ir Elektrotechnika 18(10) (2012) ISSN 1392-1215

    Google Scholar 

  14. Wang, X., Yu, H.: How to break MD5 and other hash functions. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 19–35. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  15. Wang, X., Yin, Y.L., Yu, H.: Finding Collisions in the Full SHA-1. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 17–36. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  16. Stevens, M.: Fast Collision Attack on MD5. IACR ePrint archive report (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Sen, N. (2014). An Efficient ID Based Security Algorithm for Mutual Node Authentication and Key Management: An Elliptic Curve Cryptography Based Approach. In: Gupta, P., Zaroliagis, C. (eds) Applied Algorithms. ICAA 2014. Lecture Notes in Computer Science, vol 8321. Springer, Cham. https://doi.org/10.1007/978-3-319-04126-1_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-04126-1_10

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-04125-4

  • Online ISBN: 978-3-319-04126-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics