The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Public-key cryptography and password protocols
Open accessAbstract
We study protocols for strong authentication and key exchange in asymmetric scenarios where the authentication server possesses ~a pair of private and public keys while the client has only a weak human-memorizable password as its authentication key. We present and analyze several simple password authentication protocols in this scenario, and show that the security of these protocols can be formally proven based on standard cryptographic assumptions. Remarkably, our analysis shows optimal resistance to off-line password guessing attacks under the choice of suitable public key encryption functions. In addition to user authentication, we describe ways to enhance these protocols to provide two-way authentication, authenticated key exchange, defense against server's compromise, and user anonymity. We complement these results with a proof that strongly indicates that public key techniques are unavoidable for password protocols that resist off-line guessing attacks. As a further contribution, we introduce the notion of public passwords that enables the use of the above protocols in situations where the client's machine does not have the means to validate the server's public key. Public passwords serve as "hand-held certificates" that the user can carry without the need for specal computing devices.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
A public key cryptosystem and a signature scheme based on discrete logarithms
Elgamal, T. (1985) · IEEE Transactions on Information Theory · doi:10.1109/tit.1985.1057074 · Cited by 8,059
Password authentication with insecure communication
Lamport, L. (1981) · Communications of the ACM · doi:10.1145/358790.358797 · Cited by 2,789
Security Architecture for the Internet Protocol
Atkinson, R. (1995) · doi:10.17487/rfc1825 · Cited by 2,762
Goldwasser, S., & Micali, S. (1984) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(84)90070-9 · Cited by 2,603
How to construct random functions
Goldreich, O., Goldwasser, S., & Micali, S. (1986) · Journal of the ACM · doi:10.1145/6490.6503 · Cited by 2,115
Dierks, T., & Allen, C. (1999) · doi:10.17487/rfc2246 · Cited by 1,654
A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack
Cramer, R., & Shoup, V. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0055717 · Cited by 1,437
Encrypted key exchange: password-based protocols secure against dictionary attacks
Bellovin, S. M., & Merritt, M. (2003) · Proceedings 1992 IEEE Computer Society Symposium on Research in Security and Privacy · doi:10.1109/risp.1992.213269 · Cited by 1,353
Authentication and authenticated key exchanges
Diffie, W., Van Oorschot, P. C., & Wiener, M. J. (1992) · Designs, Codes and Cryptography · doi:10.1007/bf00124891 · Cited by 1,154
Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack
Rackoff, C., & Simon, D. R. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46766-1_35 · Cited by 1,039
Dolev, D., Dwork, C., & Naor, M. (1991) · Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91 · doi:10.1145/103418.103474 · Cited by 990
Security Architecture for the Internet Protocol
Kent, S., & Seo, K. (2005) · doi:10.17487/rfc4301 · Cited by 868
Relations among notions of security for public-key encryption schemes
Bellare, M., Desai, A., Pointcheval, D., & Rogaway, P. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0055718 · Cited by 810
Network Security: Private Communication in a Public World
Kaufman, C., Perlman, R., & Speciner, M. (1995) · Cited by 730
Advances in Cryptology — CRYPTO ’91: Proceedings
(1992) · Lecture Notes in Computer Science · doi:10.1007/3-540-46766-1 · Cited by 687
Limits on the provable consequences of one-way permutations
Impagliazzo, R., & Rudich, S. (1989) · Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 · doi:10.1145/73007.73012 · Cited by 575
Adaptively secure multi-party computation
Canetti, R., Feige, U., Goldreich, O., & Naor, M. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.238015 · Cited by 548
The S/KEY One-Time Password System
Haller, N. (1995) · doi:10.17487/rfc1760 · Cited by 537
Strong password-only authenticated key exchange
Jablon, D. P. (1996) · ACM SIGCOMM Computer Communication Review · doi:10.1145/242896.242897 · Cited by 532
Freier, A., Kocher, P. C., & Karlton, P. (1996) · Cited by 524
Bellovin, S. M., & Merritt, M. (1993) · Proceedings of the 1st ACM conference on Computer and communications security - CCS '93 · doi:10.1145/168588.168618 · Cited by 522
The Secure Remote Password Protocol.
Wu, T. D. (1998) · Cited by 448
Optimal Asymmetric Encryption-How to Encrypt with RSA
Bellare, M. (1995) · Cited by 382
Protecting poorly chosen secrets from guessing attacks
Gong, L., Lomas, M. A., Needham, R. M., & Saltzer, J. H. (1993) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.223865 · Cited by 365
Bellare, M., Canetti, R., & Krawczyk, H. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276854 · Cited by 358
Self-citationRefinement and extension of encrypted key exchange
Steiner, M., Tsudik, G., & Waidner, M. (1995) · ACM SIGOPS Operating Systems Review · doi:10.1145/206826.206834 · Cited by 253
SKEME: a versatile secure key exchange mechanism for Internet
Krawczyk, H. (2002) · Proceedings of Internet Society Symposium on Network and Distributed Systems Security · doi:10.1109/ndss.1996.492418 · Cited by 223
Self-citationNumber theoretic attacks on secure password schemes
Patel, S. (2002) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/secpri.1997.601340 · Cited by 118
Open key exchange: How to defeat dictionary attacks without encrypting public keys
Lucks, S. (1998) · Lecture notes in computer science · doi:10.1007/bfb0028161 · Cited by 114
Cited by
Authenticated Key Exchange Secure against Dictionary Attacks
Bellare, M., Pointcheval, D., & Rogaway, P. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_11 · Cited by 1,503
Password-Based Authenticated Key Exchange in the Three-Party Setting
Abdalla, M., Fouque, P.-A., & Pointcheval, D. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30580-4_6 · Cited by 833
Provably Secure Password-Authenticated Key Exchange Using Diffie-Hellman
Boyko, V., MacKenzie, P., & Patel, S. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_12 · Cited by 729
Flicker: an execution infrastructure for tcb minimization
McCune, J. M., Parno, B. J., Perrig, A., Reiter, M. K., & Isozaki, H. (2008) · Proceedings of the 3rd ACM SIGOPS/EuroSys European Conference on Computer Systems 2008 · doi:10.1145/1352592.1352625 · Cited by 640
Two birds with one stone: two-factor authentication with security beyond conventional bound
Wang, D., & Wang, P. (2016) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2016.2605087 · Cited by 539
Metadata
- Authors
- Halevi, S., & Krawczyk, H.
- Venue
- ACM Transactions on Information and System Security
- Published
- 1999-08
- Volume
- 2
- Issue
- 3
- Pages
- 230-268
- ISSN
- 1094-9224 (ISSN-L)
- 1557-7406
- OpenAlex
- W1992506132
- Cited by
- 314
- References
- 30
- FWCI
- 10.68
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.