MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Strong Password-Only Authenticated Key Exchange (1996) [122 citations — 0 self]

by David P. Jablon ,  Westboro Ma
ACM Computer Communications Review
Add To MetaCart

Abstract:

A new simple password exponential key exchange method (SPEKE) is described. It belongs to an exclusive class of methods which provide authentication and key establishment over an insecure channel using only a small password, without risk of offline dictionary attack. SPEKE and the closely-related Diffie-Hellman Encrypted Key Exchange (DH-EKE) are examined in light of both known and new attacks, along with sufficient preventive constraints. Although SPEKE and DH-EKE are similar, the constraints are different. The class of strong password-only methods is compared to other authentication schemes. Benefits, limitations, and tradeoffs between efficiency and security are discussed. These methods are important for several uses, including replacement of obsolete systems, and building hybrid two-factor systems where independent password-only and key-based methods can survive a single event of either key theft or password compromise. 1 Introduction It seems paradoxical that small passwords are important for strong authentication. Clearly, cryptographically large passwords would be better, if only ordinary people could remember them. Password verification over an insecure network has been a particularly tough problem, in light of the ever-present threat of dictionary attack. Password problems have been around so long that many have assumed that strong remote authentication using only a small password is impossible. In fact, it can be done. Since the early 1990’s, an increased focus on the problem has yielded a few novel solutions, specially designed to resist to dictionary attack. In this paper we outline the problem, and describe a new simple password exponential key exchange, SPEKE, which performs strong authentication, over an insecure channel, using only a small password. That a small password can accomplish this alone goes against common wisdom. This is not your grandmother’s network login. We compare SPEKE to the closely-related Diffie-Hellman Encrypted Key Exchange [BM92], and review the potential threats and countermeasures in some detail. We show that previously-known and new attacks against both methods are thwarted when proper constraints are applied.

Citations

235 Encrypted key exchange: Password-based protocols secure against dictionary attacks – Bellovin, Merritt - 1992
211 An Improved Algorithm for Computing Logarithms over GF(p) and its Cryptographic Significance – Pohlig, Hellman - 1978
209 Applied Cryptography, Second Edition – Schneier - 1996
100 Augmented encrypted key exchange: a password-based protocol secure against dictionary atttacks and password file compromise – Bellovin, Merrit - 1993
96 Protecting Poorly Chosen Secrets from Guessing Attacks – Gong, Needham, et al. - 1993
63 Privacy and Authentication: An Introduction to Cryptography – Diffie, Hellman - 1979
61 SPX: Global Authentication using public key certificates – Tardo, Alagappan - 1992
48 Refinement and Extension of Encrypted Key Exchange – Steiner, Tsudik, et al. - 1995
46 On Diffie-Hellman key agreement with short exponents – Oorschot, Wiener - 1996
36 Optimal authentication protocols resistant to password guessing attacks – Gong - 1995
31 Establishing identity without certification authorities. August 4 – Ellison - 1996
22 Fortifying Key Negotiation Schemes with Poorly Chosen Passwords – Anderson, Lomas - 1994
13 An attack on the interlock protocol when used for authentication – Bellovin, Merritt - 1994
8 Dual-workfactor Encrypted Key Exchange: Efficiently Preventing Password Chaining and Dictionary Attacks – Jaspan - 1996
7 Authentication and Authenticated Key Exchanges", Designs, Codes and Cryptography, v 2 pp 107-125 – Diffie, Oorshot, et al. - 1992
5 private communication – Bellovin - 1999
5 The discrete logarithm problem", Cryptology and Computational Number Theory – McCurley - 1990