Novel Algorithms and Techniques In Telecommunications, Automation and Industrial Electronics pp 283-286 | Cite as
One-Time Password Authentication with Infinite Hash Chains
Conference paper
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.
Preview
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.CrossRefMathSciNetGoogle 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.CrossRefMathSciNetGoogle 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.CrossRefGoogle Scholar
Copyright information
© Springer Science+Business Media B.V. 2008