Skip to main content

Abstract

One-time password scheme based on infinite forward stepping hash chains and not requiring re-initialization after a certain number of authentications is proposed. It resists known for such type schemes attacks, channel failures, and server side database compromise.

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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. V. Goyal, A. Abraham, S. Sanyal, and S.Y. Han, “The N/ R one time password system.” in Proceedings of International Conference on Information Technology: Coding and Computing (ITCC’ 05), 4-6 April, 2005, vol. 1, pp. 733-738, 2005.

    Google Scholar 

  2. N. Haller, “The S/ KEY one-time password system.” RFC 1760, 1995, available from http:/ / www.ietf.org.

    Google Scholar 

  3. L. Lamport, “Password authentication with insecure communication.” Comm. ACM, vol. 24, No 11, pp. 770-772, 1981.

    Article  MathSciNet  Google Scholar 

  4. W. Diffie and M.E. Hellman, “New directions in cryptography.” IEEE Trans. Inform. Theory, vol. IT-22, No 6, pp. 644-654, 1976.

    Article  MathSciNet  Google Scholar 

  5. K. Bicakci and N. Baykal, “Infinite length hash chains and their applications.” in Proceedings of 11^th IEEE Int. Workshops on Enabling Technologies: Infrastructure for Collaborating Enterprises (WETICE’ 02), pp. 57-61, 2002.

    Google Scholar 

  6. T.C. Yeh, H.Y. Shen, and J.J. Hwang, “A secure one-time password authentication scheme using smart cards.” IEICE Trans. Commun., vol. E85-B, No. 11, pp. 2515-2518, 2002.

    Google Scholar 

  7. D.H. Yum and P.J. Lee, “Cryptanalysis of Yeh-Shen-Hwang’ s one-time password authentication scheme.” IEICE Trans. Commun., vol. E88-B, No. 4, pp. 1647-1648, 2005.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer Science+Business Media B.V.

About this paper

Cite this paper

Chefranov, A.G. (2008). One-Time Password Authentication with Infinite Hash Chains. In: Sobh, T., Elleithy, K., Mahmood, A., Karim, M.A. (eds) Novel Algorithms and Techniques In Telecommunications, Automation and Industrial Electronics. Springer, Dordrecht. https://doi.org/10.1007/978-1-4020-8737-0_51

Download citation

  • DOI: https://doi.org/10.1007/978-1-4020-8737-0_51

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-1-4020-8736-3

  • Online ISBN: 978-1-4020-8737-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics