The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Authenticated Key Exchange Secure against Dictionary Attacks
Open accessOverview
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
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
Self-citationEncrypted 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
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
Timestamps in key distribution protocols
Denning, D. E., & Sacco, G. M. (1981) · Communications of the ACM · doi:10.1145/358722.358740 · Cited by 682
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
Self-citationStrong password-only authenticated key exchange
Jablon, D. P. (1996) · ACM SIGCOMM Computer Communication Review · doi:10.1145/242896.242897 · Cited by 532 · cited 1×
“This protocol problem has become quite popular, with further papers suggesting solutions including [7,15,16,17,18,22,10,11,10,21].”
BackgroundBellovin, 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
A Modular Approach to the Design and Analysis of Authentication and Key Exchange Protocols.
Bellare, M., Canetti, R., & Krawczyk, H. (1998) · Cited by 381
Self-citationProtecting 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-citationOn 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
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
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
Secure Sessions from Weak Secrets
Christianson, B., Roe, M., & Wheeler, D. (2005) · Lecture notes in computer science · doi:10.1007/11542322_24 · Cited by 18
Research works printed but not linked: 2
- P. Buhler, T. Eirich, M. Steiner, and M. Waidner. Secure Password-Based Cipher Suite for TLS. Proceedings of Network and Distributed Systems Security Symposium. February 2000.
- P. MacKenzie and R. Swaminathan. Secure Authentication with a Short Secret. Manuscript. November 2, 1999. Earlier version as Secure Network Authentication with Password Identification. Submission to IEEE P1363a. August 1999. Available from http://grouper.ieee.org/groups/1363/addendum.html
Cited by
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
Self-citationProvably 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
Stronger Security of Authenticated Key Exchange
LaMacchia, B., Lauter, K., & Mityagin, A. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-75670-5_1 · Cited by 695
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
Anonymous Two-Factor Authentication in Distributed Systems: Certain Goals Are Beyond Attainment
Wang, D., He, D., Wang, P., & Chu, C.-H. (2015) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2014.2355850 · Cited by 451
Metadata
- Authors
- Bellare, M., Pointcheval, D., & Rogaway, P.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2000
- Pages
- 139-155
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W2124926080
- Cited by
- 1,503
- References
- 17
- FWCI
- 18.14
- Type
- conference paper
- Language
- en
- Open access
- bronze
- Licence
- www.springer.com/tdm (tdm)
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.