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
Security analysis of password-authenticated key agreement protocols
Kyung-Ah Shim,Seung-Hyun Seo +1 more
TL;DR: It is shown that recently proposed three password-authenticated key agreement protocols in [11,12,10] are insecure against several active attacks including a stolen-verifier attack, an off-line password guessing attack and impersonation attacks.
Journal ArticleDOI
A Small Subgroup Attack for Recovering Ephemeral Keys in Chang and Chang Password Key Exchange Protocol
TL;DR: A new method based on the small subgroup attack to solve the DLP is discussed and the key recovery attack on Chang and Chang password key exchange protocol is implemented by using the new method to recover the ephemeral key.
Proceedings ArticleDOI
Password-authenticated 3PEKE with round efficiency without server's public key
Ya-Fen Chang,Chin-Chen Chang +1 more
TL;DR: A secure three-party EKE protocol with only five rounds is proposed, not practical for some environments because a certificate is needed, and an improvement is proposed.
Posted Content
Blind Password Registration for Verifier-based PAKE.
Franziskus Kiefer,Mark Manulis +1 more
TL;DR: Blind Password Registration (BPR) as discussed by the authors is a new class of cryptographic protocols that is instrumental for secure registration of client passwords at remote servers with additional protection against password disclosure on the server side that may occur due to the lack of the state-of-theart password protection mechanisms implemented by the server or due to common server-compromise attacks.
Proceedings ArticleDOI
Blind Password Registration for Verifier-based PAKE
Franziskus Kiefer,Mark Manulis +1 more
TL;DR: Blind Password Registration (BPR) as mentioned in this paper is a new class of cryptographic protocols that is instrumental for secure registration of client passwords at remote servers with additional protection against password disclosure on the server side that may occur due to the lack of the state-of-the-art password protection mechanisms implemented by the server or due to common server-compromise attacks.
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.