The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Universally Composable Password-Based Key Exchange
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Universally composable security: a new paradigm for cryptographic protocols
Canetti, R. (2001) · Proceedings 42nd IEEE Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2001.959888 · Cited by 3,309
Self-citationGoldwasser, S., & Micali, S. (1984) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(84)90070-9 · Cited by 2,603
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
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
Cramer, R., Damgård, I., & Schoenmakers, B. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48658-5_19 · Cited by 1,152
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
Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption
Cramer, R., & Shoup, V. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-46035-7_4 · Cited by 831
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
Universally Composable Notions of Key Exchange and Secure Channels
Canetti, R., & Krawczyk, H. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-46035-7_22 · Cited by 746
Self-citationDolev, D., Dwork, C., & Naor, M. (2000) · SIAM Journal on Computing · doi:10.1137/s0097539795291562 · Cited by 746
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
Self-citationNon-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security
Sahai, A. (2003) · 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) · doi:10.1109/sffcs.1999.814628 · Cited by 575
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
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
On-line/off-line digital signatures
Even, S., Goldreich, O., & Micali, S. (1996) · Journal of Cryptology · doi:10.1007/bf02254791 · Cited by 318
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
Self-citationRobust Non-interactive Zero Knowledge
De Santis, A., Di Crescenzo, G., Ostrovsky, R., Persiano, G., & Sahai, A. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_33 · Cited by 293
A Framework for Password-Based Authenticated Key Exchange
Gennaro, R., & Lindell, Y. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-39200-9_33 · Cited by 292
Self-citationA Proposal for an ISO Standard for Public Key Encryption.
Shoup, V. (2001) · Cited by 271
Universal Composition with Joint State
Canetti, R., & Rabin, T. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45146-4_16 · Cited by 259
Self-citationSession-Key Generation Using Human Passwords Only
Goldreich, O., & Lindell, Y. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_24 · Cited by 205
Self-citationOn the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions
Canetti, R., Kushilevitz, E., & Lindell, Y. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-39200-9_5 · Cited by 165
Self-citationOn Simulation-Sound Trapdoor Commitments
MACKENZIE, P. D., & Yang, K. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24676-3_23 · Cited by 106
Self-citationPublic-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
Strengthening Zero-Knowledge Protocols Using Signatures
Garay, J. A., MACKENZIE, P. D., & Yang, K. (2003) · Lecture notes in computer science · doi:10.1007/3-540-39200-9_11 · Cited by 77
Self-citationTwo-Server Password-Only Authenticated Key Exchange
Katz, J. I., MACKENZIE, P. D., Taban, G., & Gligor, V. D. (2005) · Lecture notes in computer science · doi:10.1007/11496137_1 · Cited by 73
Self-citationSimpler Session-Key Generation from Short Random Passwords
Nguyen, M.-H., & Vadhan, S. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24638-1_24 · Cited by 29
Cited by
PESTO: Proactively Secure Distributed Single Sign-On, or How to Trust a Hacked Server
Baum, C., Frederiksen, T., Hesse, J., Lehmann, A., & Yanai, A. (2020) · 2020 IEEE European Symposium on Security and Privacy (EuroS&P) · doi:10.1109/eurosp48549.2020.00044 · Cited by 49
“It is well-known that for password-based primitives these notions cannot properly capture the way users (mis)handle passwords [15].”
BackgroundCryptanalysis of the dragonfly key exchange protocol
Clarke, D., & Hao, F. (2014) · IET Information Security · doi:10.1049/iet-ifs.2013.0081 · Cited by 25
On the Provable Security of the Dragonfly Protocol
Lancrenon, J., & Škrobot, M. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-23318-5_14 · Cited by 15
The Relationship Between Password-Authenticated Key Exchange and Other Cryptographic Primitives
Nguyen, M.-H. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30576-7_25 · Cited by 7
“A recent series of works [1, 6, 11, 17, 8, 20, 7] has focused on our theoretical understanding of”
BackgroundMethod
Metadata
- Authors
- Canetti, R., Halevi, S., Katz, J., Lindell, Y., & MacKenzie, P.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2005
- Pages
- 404-421
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1759759811
- Cited by
- 285
- References
- 30
- FWCI
- 11.21
- 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.