Download:
|
by Jonathan Katz, Rafail Ostrovsky, Moti Yung
http://eprint.iacr.org/2001/031.ps.gz
Add To MetaCart
Abstract:
Abstract. There has been much interest in password-authenticated keyexchange protocols which remain secure even when users choose passwords from a very small space of possible passwords (say, a dictionary of English words). Under this assumption, one must be careful to design protocols which cannot be broken using o-line dictionary attacks in which an adversary enumerates all possible passwords in an attempt to determine the correct one. Many heuristic protocols have been proposed to solve this important problem. Only recently have formal validations of security (namely, proofs in the idealized random oracle and ideal cipher models) been given for specic constructions [3, 10, 22]. Very recently, a construction based on general assumptions, secure in the standard model with human-memorable passwords, has been proposed by Goldreich and Lindell [17]. Their protocol requires no public parameters; unfortunately, it requires techniques from general multi-party computation which make it impractical. Thus, [17] only proves that solutions
Citations
|
640
|
A Digital Signature Scheme Secure Against Adaptive Chosen Message Attacks
– Goldwasser, MiCali, et al.
- 1988
|
|
255
|
New directions in cryptography
– e, Hellman
- 1976
|
|
237
|
Encrypted key exchange: Password-based protocols secure against dictionary attacks
– Bellovin, Merritt
- 1992
|
|
195
|
Authenticated key exchange secure against dictionary attacks
– Bellare, Pointcheval, et al.
- 2000
|
|
98
|
Provably Secure Password Authentication and Key Exchange Using Diffie-Hellman
– Boyko, MacKenzie, et al.
- 2000
|
|
66
|
Public-key encryption in a multi-user setting: Security proofs and improvements
– Bellare, Boldyreva, et al.
- 2000
|
|
57
|
Open key exchange: How to defeat dictionary attacks without encrypting public keys
– Lucks
- 1997
|
|
34
|
Password authenticated key exchange based on RSA
– MacKenzie, Patel, et al.
- 2000
|
|
11
|
On All-Or-Nothing Transforms and Password-Authenticated Key Exchange Protocols
– Boyko
- 2000
|
|
4
|
Personal Communication and Crypto 2000 Rump Session. Session-Key Generation using Human Passwords Only. Available at http://eprint.iacr.org/2000/057
– Goldreich, Lindell
|
|
3
|
The Decision Die-Hellman Problem. Proceedings of the Third Algorithmic Number Theory Symposium
– Boneh
- 1998
|
