The DOI matches its Crossref record; 2 of the 2 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.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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-citationStrong password-only authenticated key exchange
Jablon, D. P. (1996) · ACM SIGCOMM Computer Communication Review · doi:10.1145/242896.242897 · Cited by 532
Research works printed but not linked: 16
- M. Bellare, R. Canetti, and H. Krawczyk. A Modular Approach to the Design and Analysis of Authentication and Key Exchange Protocols. Proc. of the 30th STOC. ACM Press, New York, 1998.
- M. Bellare and P. Rogaway. Provably Secure Session Key Distribution: the Three Party Case. Proc. of the 27th STOC. ACM Press, New York, 1995.
- S. Bellovin and M. Merritt. Encrypted Key Exchange: Password-Based Protocols Secure against Dictionary Attacks. Proc. of the Symposium on Security and Privacy, pages 72–84. IEEE, 1992. · DOI · Paper page
- S. Bellovin and M. Merritt. Augmented Encrypted Key Exchange: A Password-Based Protocol Secure against Dictionary Attacks and Password File Compromise. Proceedings of the 1st Annual Conference on Computer and Communications Security, ACM, 1993. · DOI · Paper page
- M. Boyarsky. Public-Key Cryptography and Password Protocols: The Multi-User Case. Proceedings of the 6th Annual Conference on Computer and Communications Security, ACM, 1999. · DOI
- V. Boyko, P. MacKenzie, and S. Patel. Provably Secure Password-Authenticated Key Exchange Using Diffie-Hellman. Eurocrypt 2000, LNCS 1807, pages 156–171. Springer-Verlag, Berlin, 2000. · DOI · Paper page
- 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.
- D. Denning and G. Sacco. Timestamps in Key Distribution Protocols. Communications of the ACM, 24, 1981, pp 533–536. · DOI · Paper page
- L. Gong, M. Lomas, R. Needham, and J. Saltzer. Protecting Poorly Chosen Secrets from Guessing Attacks. IEEE Journal on Selected Areas in Communications, 11(5):648–656, June 1993. · DOI · Paper page
- S. Halevi and H. Krawczyk. Public-Key Cryptography and Password Protocols. ACM Transactions on Information and System Security, Vol. 2, No. 3, pp. 230–268, August 1999. Earlier version in Proc. of the 5th CCS conference, ACM Press, New York, 1998.
- D. Jablon. Extended Password Key Exchange Protocols Immune to Dictionary Attacks. Proc. of WET-ICE’ 97, pp. 248–255. IEEE Computer Society, June 1997. · DOI · Paper page
- S. Lucks. Open Key Exchange: How to Defeat Dictionary Attacks Without Encrypting Public Keys. Proc. of the Security Protocols Workshop, LNCS 1361. Springer-Verlag, Berlin, 1997.
- 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
- V. Shoup. On Formal Models for Secure Key Exchange. Theory of Cryptography Library Record 99-12, http://philby.ucsd.edu/cryptolib/ and invited talk at ACM Computer and Communications Security conference, 1999.
- M. Roe, B. Christianson, and D. Wheeler. Secure Sessions from Weak Secrets. Technical report from University of Cambridge and University of Hertfordshire. Manuscript, 1998.
- T. Wu. The Secure Remote Password Protocol. Proceedings of the Internet Society Symposium on Network and Distributed System Security, pp. 97–111, 1998.
Cited by
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
Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords
Katz, J., Ostrovsky, R., & Yung, M. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44987-6_29 · Cited by 398
An improved smart card based password authentication scheme with provable security
Xu, J., Zhu, W.-T., & Feng, D.-G. (2009) · Computer Standards & Interfaces · doi:10.1016/j.csi.2008.09.006 · Cited by 373
Qiu, S., Wang, D., Xu, G., & Kumari, S. (2020) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2020.3022797 · Cited by 224
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
- 2
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Authenticated Key Exchange Secure against Dictionary Attacks. https://app.cochat.ai/papers/10.1007/3-540-45539-6_11
- The paper
- Bellare, M., Pointcheval, D., & Rogaway, P. (2000). Authenticated Key Exchange Secure against Dictionary Attacks. Lecture Notes in Computer Science. https://doi.org/10.1007/3-540-45539-6_11
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.
