Encrypted key exchange: password-based protocols secure against dictionary attacks
Steven M. Bellovin,Michael Merritt +1 more
- pp 72-84
TLDR
A combination of asymmetric (public-key) and symmetric (secret- key) cryptography that allow two parties sharing a common password to exchange confidential and authenticated information over an insecure network is introduced.Abstract:
Classic cryptographic protocols based on user-chosen keys allow an attacker to mount password-guessing attacks. A combination of asymmetric (public-key) and symmetric (secret-key) cryptography that allow two parties sharing a common password to exchange confidential and authenticated information over an insecure network is introduced. In particular, a protocol relying on the counter-intuitive motion of using a secret key to encrypt a public key is presented. Such protocols are secure against active attacks, and have the property that the password is protected against offline dictionary attacks. >read more
Citations
More filters
Book ChapterDOI
One-time-password-authenticated key exchange
TL;DR: In this article, the authors consider the use of one-time passwords in the context of password-authenticated key exchange (PAKE), which allows for mutual authentication, session key agreement, and resistance to phishing attacks.
Patent
Method for determining temporary mobile identifiers and managing use thereof
TL;DR: In this paper, the authors propose a method for managing the use of temporary mobile identifiers (TIDs), where the mobile and the network each store a list of TIDs for the mobile.
Posted Content
CompChall: Addressing Password Guessing Attacks.
TL;DR: In this paper, a new authentication protocol called CompChall (computational challenge) is proposed, which uses only one way hash functions as the building blocks and attempts to eliminate online dictionary attacks by implementing a challenge-response system.
Book ChapterDOI
Forward secrecy in password-only key exchange protocols
TL;DR: This paper presents a natural definition of security which incorporates the more challenging requirement of forward secrecy and provides the first natural example showing that forward secrecy is a strictly stronger requirement for PAKE protocols.
Proceedings ArticleDOI
Applying the dependability paradigm to computer security
TL;DR: A rough outline of a fault model for security is developed and it is shown how it could be applied to better the authors' understanding of the place of both fault tolerance and fault forecasting in computer security.
References
More filters
Journal ArticleDOI
New Directions in Cryptography
TL;DR: This paper suggests ways to solve currently open problems in cryptography, and discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standing.
Journal ArticleDOI
A method for obtaining digital signatures and public-key cryptosystems
TL;DR: An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key.
Journal ArticleDOI
A public key cryptosystem and a signature scheme based on discrete logarithms
TL;DR: A new signature scheme is proposed, together with an implementation of the Diffie-Hellman key distribution scheme that achieves a public key cryptosystem that relies on the difficulty of computing discrete logarithms over finite fields.
Book ChapterDOI
A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
TL;DR: In this article, a new signature scheme is proposed together with an implementation of the Diffie-Hellman key distribution scheme that achieves a public key cryptosystem and the security of both systems relies on the difficulty of computing discrete logarithms over finite fields.
Book
Cryptography and data security
TL;DR: The goal of this book is to introduce the mathematical principles of data security and to show how these principles apply to operating systems, database systems, and computer networks.