Encrypted key exchange: password-based protocols secure against dictionary attacks

@article{Bellovin1992EncryptedKE,
  title={Encrypted key exchange: password-based protocols secure against dictionary attacks},
  author={Steven M. Bellovin and Michael Merritt},
  journal={Proceedings 1992 IEEE Computer Society Symposium on Research in Security and Privacy},
  year={1992},
  pages={72-84}
}
  • S. Bellovin, Michael Merritt
  • Published 4 May 1992
  • Computer Science, Mathematics
  • Proceedings 1992 IEEE Computer Society Symposium on Research in Security and Privacy
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… 

Simple and efficient password-based authenticated key exchange protocol

TLDR
This paper proposes a simple, efficient and provably secure PAKE protocol based on Diffie-Hellman key exchange and cryptographic hash function that is secure against dictionary attacks.

Augmented encrypted key exchange: a password-based protocol secure against dictionary attacks and password file compromise

TLDR
Two ways to accomplish EKE augmented so that hosts do not store cleartext passwords are shown, one using digital signatures and one that relies on a family of commutative one-way functions.

A Study on Encrypted Key exchange using password

TLDR
A traditional password protocol was based on user-chosen key, however, this method has password-guessing attack to attacker and new method to share session key between each other is proposed.

Open Key Exchange: How to Defeat Dictionary Attacks Without Encrypting Public Keys

  • S. Lucks
  • Computer Science, Mathematics
    Security Protocols Workshop
  • 1997
TLDR
Bellovin and Merritt proposed “encrypted key exchange” (EKE) protocols, to frustrate key-guessing attacks, which requires the use of asymmetric cryptosystems and is based on encrypting the public key, using a symmetric cipher.

Password-Authenticated Public-Key Encryption

We introduce password-authenticated public-key encryption (PAPKE), a new cryptographic primitive. PAPKE enables secure end-to-end encryption between two entities without relying on a trusted third

Key Exchange Protocol Using Encryption Scheme Provably Secure Against CCA

TLDR
This paper presents a new idea using an assymmetric encryption scheme that do not require the knowledge of public key of the other party that are secure against the dictionary attack, impersonation attack and known session key attack under random oracle model.

Simple authenticated key agreement protocol resistant to password guessing attacks

TLDR
This paper presents a simple authenticated key agreement protocol called SAKA which is simple and cost-effective, and provides a formal proof of security to show its strength against both passive and active adversaries.

Off-line dictionary attack on password-based authenticated key exchange protocols

TLDR
It is shown that the two protocols are vulnerable to off-line dictionary attacks in the presence of an inside attacker because of an authentication flaw and how to eliminate the security flaw is shown.

Efficient Password-Based Authenticated Key Agreement Protocol

In this paper, we present a new password-based authenticated key agreement protocol called PAKA, which provides mutual authentication and key agreement over an insecure channel between two parties
...

References

SHOWING 1-10 OF 26 REFERENCES

Verifiable-text attacks in cryptographic protocols

  • L. Gong
  • Computer Science, Mathematics
    Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration
  • 1990
The author introduces a form of attack, a verifiable-test attack, in which an attacker obtains secret information, such as a password used in a protocol, without breaking the underlying cryptosystem.

How to expose an eavesdropper

TLDR
A new protocol for establishing secure communications over an insecure communications charmel in the absence of trusted third parties or authenticated keys is presented, which forces a potential eavesdropper to reveal his existence by modifying and seriously garbling the communication.

Reducing risks from poorly chosen keys

TLDR
This paper shows alternatively how to construct an authentication protocol in which offline experimentation is impracticable; any attack based on experiment must involve the real authentication server and is thus open to detection by the server noticing multiple attempts.

A method for obtaining digital signatures and public-key cryptosystems

An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key. This has two important

A method for obtaining digital signatures and public-key cryptosystems

TLDR
An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key, soriers or other secure means are not needed to transmit keys.

A note on redundancy in encrypted messages

TLDR
This note shows that, because of the secrecy that comes with encryption, redundancy can be provided at two different levels, and demonstrates that this distinction is useful in guarding against certain cryptographic attacks on weak keys.

SPX: global authentication using public key certificates

  • J. TardoKannan Alagappan
  • Computer Science
    Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy
  • 1991
SPX, a reference implementation of an open distributed authentication service architecture based on ISO Standard 9594-9/CCITT X.509 directory public key certificates and hierarchically organized

UNIX Password Security

TLDR
This document was written to make system administrators aware of the importance of wellchosen passwords to protect a system from newbie hackers.

Computation of Discrete Logarithms in Prime Fields

  • A. B.
  • Computer Science, Mathematics
TLDR
This paper describes an implementation of a discrete logarithm algorithm which shows that primes of under 200 bits, such as that in the Sun system, are very insecure.

Computation of discrete logarithms in prime fields

TLDR
This paper describes an implementation of a discrete logarithm algorithm which shows that primes of under 200 bits, such as that in the Sun system, are very insecure.