(Enter summary)
Abstract: The problem of password authentication over an insecure
network when the user holds only a human-memorizable
password has received much attention in the literature.
The first rigorous treatment was provided by Halevi and
Krawczyk, who studied off-line password guessing attacks
in the scenario in which the authentication server possesses
a pair of private and public keys. In this work we:
ffl Show the inadequacy of both the HK formalization
and protocol in the case where there is more than a... (Update)
Cited by: More
Prompted User Retrieval of Secret Entropy: The Passmaze.. - Dece Mb Er (2005)
(Correct)
Universally Composable Password-Based Key Exchange - Canetti, Halevi, Katz.. (2005)
(Correct)
Session-Key Generation Using Human Passwords Only - Goldreich, Lindell (2005)
(Correct)
Active bibliography (related documents): More All
0.5: Cryptanalysis of Microsoft's PPTP Authentication.. - Bruce Schneier Mudge (1999)
(Correct)
0.5: Oblivious Transfer with Adaptive Queries - Naor, Pinkas (1999)
(Correct)
0.4: Non-Malleable Cryptography - Dolev, Dwork, Naor (1998)
(Correct)
Similar documents based on text: More All
0.2: A Secure Human-Computer Authentication Scheme - Hopper, Blum (2001)
(Correct)
0.1: Alternatives to Non-Malleability: Definitions.. - MacKenzie, Reiter, Yang (2004)
(Correct)
0.1: Cryptanalysis of an ID-based Password Authentication Scheme using.. - Scott (2004)
(Correct)
Related documents from co-citation: More All
21: Encrypted Key Exchange: Password-Based Protocols Secure Against Dictionary Attac..
- Bellovin, Merritt - 1992
20: Entity authentication and key distribution (context) - Bellare, Rogaway - 1993
20: Public-key cryptography and password protocols
- Halevi, Krawczyk - 1998
BibTeX entry: (Update)
M. Boyarsky. Public-Key Cryptography and Password Protocols: The Multi-User Case. Proceedings of the 7th Annual Conference on Computer and Communications Security, ACM, 1999. http://citeseer.ist.psu.edu/boyarsky99publickey.html More
@inproceedings{ boyarsky99publickey,
author = "Maurizio Kliban Boyarsky",
title = "Public-Key Cryptography and Password Protocols: The Multi-User Case",
booktitle = "{ACM} Conference on Computer and Communications Security",
pages = "63-72",
year = "1999",
url = "citeseer.ist.psu.edu/boyarsky99publickey.html" }
Citations (may not include all citations):
278
Probabilistic Encryption (context) - Goldwasser, Micali - 1984
260
Relations among notions of security for public-key encryptio.. (context) - Bellare, Desai et al. - 1998
208
Universal One-way Hash Functions and their Cryptographic App..
- Naor, Yung - 1989
179
Security and Composition of Multi-party Cryptographic Protoc..
- Canetti
150
Encrypted key exchange: Password-based protocols secure agai..
- Bellovin, Merritt - 1992
130
Provably Secure Session Key Distribution: The Three Party Ca..
- Bellare, Rogaway - 1995
118
Optimal Asymmetric Encryption -- How to Encrypt with RSA (context) - Bellare, Rogaway - 1994
99
One-way Functions are Necessary and Sufficient for Signature.. (context) - Rompel - 1990
88
Protecting poorly chosen secrets from guessing attacks
- Gong, Lomas et al. - 1993
69
Adaptively Secure Multi-party Computation
- Canetti, Feige et al. - 1996
58
Public-key Cryptography and password protocols
- Halevi, Krawczyk - 1999
58
Public-key Cryptography and password protocols
- Halevi, Krawczyk - 1998
45
Open Key Exchange: How to Defeat Dictionary Attacks Without ..
- Lucks
32
New generation of secure and practical RSA-based signatures ..
- Cramer, Damgard - 1996
27
Use of Randomness in Algorithms and Protocols (context) - Kilian - 1990
26
An Efficient Existentially Unforgeable Signature Scheme and ..
- Dwork, Naor - 1998
25
Non-Malleable Encryption: Equivalence between Two Notions
- Bellare, Sahai
25
Pseudo-randomness and applications (context) - Luby - 1996
22
A general completeness theorem for two-party games (context) - Kilian - 1991
20
A Secure Digital Signature Scheme (context) - Goldwasser, Micali et al. - 1988
18
Advances in Cryptology -- Crypto (context) - Bellare, Rogaway et al. - 1994
14
Efficient network authentication protocols: Lower bounds and..
- Gong - 1995
12
the Limitations of certain One-Way Permutations (context) - Impagliazzo, Rudich - 1989
8
A practical Public Key Cryptosystem Provable Secure against .. (context) - Cramer, Shoup - 1998
5
One-way functions are essential to computational based crypt.. (context) - Impagliazzo, Luby - 1989
2
Internet Society Network and Distributed System Security Sym.. (context) - Wu, Remote et al. - 1998
2
th ACM Symp (context) - Naor, Pinkas et al. - 1999
1
the Twenty third ACM Symposium on Theory of Computing (context) - Dolev, Dwork et al. - 1991
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://eprint.iacr.org/complete/): More
A Tool for Obtaining Tighter Security Analyses of.. - Bellare, Impagliazzo (1999)
(Correct)
Chameleon Hashing and Signatures - Krawczyk, Rabin (1997)
(Correct)
Verifiable Encryption and Applications to Group.. - Camenisch, Damgård (1999)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC