The DOI matches its Crossref record; 30 of the 31 references it cites were found in a registry or an index.
The Relationship Between Password-Authenticated Key Exchange and Other Cryptographic Primitives
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“In fact, Nguyen et al. did investigate the relationship between password protocols and other cryptographic primitives and realized that password-authenticated key exchange and public-key encryption are incomparable under black-box reductions in [268].”
From Robotics cyber security: vulnerabilities, attacks, countermeasures, and recommendations (2022) · cites this paper as [268]
Citations
Cites
Goldreich, O. (2001) · Cambridge University Press eBooks · doi:10.1017/cbo9780511546891 · Cited by 2,181
Goldreich, O. (2004) · Cambridge University Press eBooks · doi:10.1017/cbo9780511721656 · Cited by 1,805
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 · cited 5×
“Assuming the existence of one-way functions, it is known that one can transform a PAK protocol into a protocol for password-based authentication using two additional messages [2, 1, 16, 11, 17].”
BackgroundInfluentialFoundations of Cryptography: Volume 2, Basic Applications
Goldreich, O. (2004) · Cited by 1,592
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 · cited 24×
“If one-way functions exist, there exists a PAK protocol that is secure for the Bellare-Pointcheval-Rogaway (BPR) definition [1] for the dictionary D = {0, 1}.”
BackgroundMethodInfluentialEncrypted 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 · cited 2×
“The problem of session-key generation using passwords suggested by Bellovin and Merritt [3] considers the situation where Alice and Bob share a password, i.e. an element chosen uniformly at random from a small dictionary D ⊆ {0, 1}n.”
Goldreich, O., Micali, S., & Wigderson, A. (1991) · Journal of the ACM · doi:10.1145/116825.116852 · Cited by 1,349 · cited 1×
“3 This equivalence would be non-black-box as the known construction of OT from honest OT is non-black-box since it uses the zero-knowledge proofs of [ 12 ] ( see [9]).”
MethodSelf Protecting Pirates and Black-Box Traitor Tracing
Kiayias, A., & Yung, M. M. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44647-8_4 · Cited by 1,121
Fischlin, M., & Coron, J.-S. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-49896-5 · Cited by 882
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 · cited 6×
“We will follow the paradigm of [6] and show how to transform some of the real adversary’s queries to the oracle Γ into password guesses for the ideal adversary.”
BackgroundMethodInfluential
Cited by
Robotics cyber security: vulnerabilities, attacks, countermeasures, and recommendations
Yaacoub, J.-P. A., Noura, H. N., Salman, O., & Chehab, A. (2022) · International Journal of Information Security · doi:10.1007/s10207-021-00545-8 · Cited by 320
“did investigate the relationship between password protocols and other cryptographic primitives and realized that passwordauthenticated key exchange and public-key encryption are incomparable under black-box reductions in [268].”
Wang, D., & Wang, P. (2014) · Computer Networks · doi:10.1016/j.comnet.2014.07.010 · Cited by 205
“In 2006, Nguyen [46] investigated the relationship between password protocols and other cryptographic primitives, and observed that password-authenticated key exchange and public-key encryption are incomparable under black-box reductions.”
BackgroundA Secure Threshold Anonymous Password-Authenticated Key Exchange Protocol
Shin, S., Kobara, K., & Imai, H. (2007) · Springer eBooks · doi:10.1007/978-3-540-75651-4_30 · Cited by 23
A Unified Framework for UC from Only OT
Pass, R., Lin, H., & Venkitasubramaniam, M. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-34961-4_42 · Cited by 21
“combined with the result of [2] that the existence of PAKE protocols im-”
BackgroundResultInfluentialA Secure Construction for Threshold Anonymous Password-Authenticated Key Exchange
Shin, S., Kobara, K., & IMAI, H. (2008) · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · doi:10.1093/ietfec/e91-a.11.3312 · Cited by 10
Metadata
- Authors
- Nguyen, M.-H.
- Affiliations
- Harvard University (US)
- Corresponding author
- Nguyen, Minh-Huyen
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2005
- Pages
- 457-475
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1588362921
- Cited by
- 7
- References
- 31
- Citations by year
- 2021: 1 · 2017: 1 · 2014: 1 · 2012: 1
- FWCI
- 0.48
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Lecture notes in computer science (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security
- Physical Sciences › Computer Science › Computer Networks and Communications › Advanced Authentication Protocols Security
- Physical Sciences › Computer Science › Information Systems › User Authentication and Security Systems
- Keywords
- password-authenticated key exchange, session key generation, black-box reductions, public-key encryption, key exchange, one-way functions, low-entropy passwords, dictionary attacks, cryptographic primitives
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: The Relationship Between Password-Authenticated Key Exchange and Other Cryptographic Primitives. https://app.cochat.ai/papers/10.1007/978-3-540-30576-7_25
- The paper
- Nguyen, M.-H. (2005). The Relationship Between Password-Authenticated Key Exchange and Other Cryptographic Primitives. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-540-30576-7_25
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.