The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Provably Secure Password-Authenticated Key Exchange Using Diffie-Hellman
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
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
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
Random oracles are practical: a paradigm for designing efficient protocols
Bellare, M., & Rogaway, P. (1993) · Proceedings of the 1st ACM conference on Computer and communications security - CCS '93 · doi:10.1145/168588.168596 · Cited by 4,712
Entity Authentication and Key Distribution
Bellare, M., & Rogaway, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48329-2_21 · Cited by 1,752
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
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
Secure Integration of Asymmetric and Symmetric Encryption Schemes
Fujisaki, E., & Okamoto, T. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48405-1_34 · Cited by 1,132
The random oracle methodology, revisited
Canetti, R., Goldreich, O., & Halevi, S. (2004) · Journal of the ACM · doi:10.1145/1008731.1008734 · Cited by 978
Bellare, M., & Rogaway, P. (1995) · Lecture Notes in Computer Science · doi:10.1007/bfb0053428 · Cited by 906
The Decision Diffie-Hellman problem
Boneh, D. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054851 · Cited by 895
The random oracle methodology, revisited (preliminary version)
Canetti, R., Goldreich, O., & Halevi, S. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276741 · Cited by 715
Key agreement protocols and their security analysis
Blake-Wilson⋆⋆, S., Johnson, D. B., & Menezes, A. (1997) · Lecture notes in computer science · doi:10.1007/bfb0024447 · Cited by 595
Provably secure session key distribution: the three party case
Bellare, M., & Rogaway, P. (1995) · Proceedings of the twenty-seventh annual ACM symposium on Theory of computing - STOC '95 · doi:10.1145/225058.225084 · Cited by 593
Strong password-only authenticated key exchange
Jablon, D. P. (1996) · ACM SIGCOMM Computer Communication Review · doi:10.1145/242896.242897 · Cited by 532 · cited 1×
“Following EKE, many password authenticated key exchange protocols were proposed [9, 19, 18, 28, 21, 22, 24, 29].”
MethodBellovin, 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
Secure Integration of Asymmetric and Symmetric Encryption Schemes
Fujisaki, E., & Okamoto, T. (2013) · Journal of Cryptology · doi:10.1007/s00145-011-9114-1 · Cited by 402
A Modular Approach to the Design and Analysis of Authentication and Key Exchange Protocols.
Bellare, M., Canetti, R., & Krawczyk, H. (1998) · Cited by 381
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
On Formal Models for Secure Key Exchange.
Shoup, V. (1999) · Cited by 322
Public-key cryptography and password protocols
Halevi, S., & Krawczyk, H. (1999) · ACM Transactions on Information and System Security · doi:10.1145/322510.322514 · Cited by 314
Refinement 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
Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority
Beaver, D. (1991) · Journal of Cryptology · doi:10.1007/bf00196771 · Cited by 228
Extended password key exchange protocols immune to dictionary attack
Jablon, D. P. (2002) · Proceedings of IEEE 6th Workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises · doi:10.1109/enabl.1997.630822 · Cited by 175
A Real-World Analysis of Kerberos Password Security.
Wu, T. D. (1999) · Cited by 120
Reducing risks from poorly chosen keys
Lomas, T., Gong, L., Saltzer, J. H., & Needhamn, R. (1989) · ACM SIGOPS Symposium on Operating Systems Principles (SOSP) · doi:10.1145/74850.74853 · Cited by 118
Number 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
Self-citationOptimal authentification protocols resistant to password guessing attacks
Gong, L. (2002) · doi:10.1109/csfw.1995.518549 · Cited by 115
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
Public-key cryptography and password protocols
Boyarsky, M. K. (1999) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/319709.319719 · Cited by 84
Public-key cryptography and password protocols
Halevi, S., & Krawczyk, H. (1998) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/288090.288118 · Cited by 81
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
Juels, A., & Sudan, M. (2003) · Proceedings IEEE International Symposium on Information Theory, · doi:10.1109/isit.2002.1023680 · Cited by 820
Juels, A., & Sudan, M. (2006) · Designs, Codes and Cryptography · doi:10.1007/s10623-005-6343-z · Cited by 648
Fast dictionary attacks on passwords using time-space tradeoff
Narayanan, A., & Shmatikov, V. (2005) · Proceedings of the 12th ACM conference on Computer and communications security · doi:10.1145/1102120.1102168 · Cited by 447
Metadata
- Authors
- Boyko, V., MacKenzie, P., & Patel, S.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2000
- Pages
- 156-171
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W203500824
- Cited by
- 729
- References
- 32
- FWCI
- 15.32
- Type
- conference paper
- Language
- en
- Open access
- closed
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.