Interactive diffie-hellman assumptions with applications to password-based authentication

119Citations
Citations of this article
35Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Password-based authenticated key exchange are protocols that are designed to provide strong authentication for client-server applications, such as online banking, even when the users' secret keys are considered weak (e.g., a four-digit pin). In this paper, we address this problem in the three-party setting, in which the parties trying to authenticate each other and to establish a session key only share a password with a trusted server and not directly among themselves. This is the same setting used in the popular Kerberos network authentication system. More precisely, we introduce a new three-party password-based authenticated key exchange protocol. Our protocol is reasonably efficient and has a per-user computational cost that is comparable to that of the underlying two-party authenticated key exchange protocol. The proof of security is in the random oracle model and is based on new and apparently stronger variants of the decisional Diffie-Hellman problem which are of independent interest. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Abdalla, M., & Pointcheval, D. (2005). Interactive diffie-hellman assumptions with applications to password-based authentication. In Lecture Notes in Computer Science (Vol. 3570, pp. 341–356). Springer Verlag. https://doi.org/10.1007/11507840_31

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free