The DOI matches its Crossref record; 26 of the 28 references it cites were found in a registry or an index.
Universally Composable Notions of Key Exchange and Secure Channels
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
“The composable extractor was fi rst introduced in classical cryptography, 93,94 and it was later extended to quantum cryptography. 95,96”
From Quantum random number generation (2016) · cites this paper as [94]
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
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Universally composable security: a new paradigm for cryptographic protocols
Canetti, R. (2001) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2001.959888 · Cited by 3,348
Self-citationThe knowledge complexity of interactive proof systems
Goldwasser, S., Micali, S., & Rackoff, C. (1989) · SIAM Journal on Computing · doi:10.1137/0218012 · Cited by 3,285
Handbook of Applied Cryptography
Menezes, A., van Oorschot, P. C., & Vanstone, S. A. (2010) · CRC Press eBooks · doi:10.1201/9781439821916 · Cited by 2,910
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
Goldwasser, S., Micali, S. M., & Rivest, R. L. (1988) · SIAM Journal on Computing · doi:10.1137/0217017 · Cited by 2,803
Goldreich, O. (2001) · Cambridge University Press eBooks · doi:10.1017/cbo9780511546891 · Cited by 2,220
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
Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels
Canetti, R., & Krawczyk, H. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44987-6_28 · Cited by 1,706
Self-citationSecurity and Composition of Multiparty Cryptographic Protocols
Canetti, R. (2000) · Journal of Cryptology · doi:10.1007/s001459910006 · Cited by 1,397
Self-citationAuthentication and authenticated key exchanges
Diffie, W., van Oorschot, P. C., & Wiener, M. J. (1992) · Designs Codes and Cryptography · doi:10.1007/bf00124891 · Cited by 1,147
Foundations of Cryptography: Basic Tools
Goldreich, O. (2000) · Cambridge University Press eBooks · Cited by 1,019
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
Mihir Bellare, Y., & Rogaway, P. (1995) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/225058.225084 · Cited by 593
Witness indistinguishable and witness hiding protocols
Feige, U., & Adi Shamir, Z. (1990) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/100216.100272 · Cited by 523
Advances in Cryptology — CRYPTO’ 88
(1990) · Lecture notes in computer science · doi:10.1007/0-387-34799-2 · Cited by 415
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-citationMihir Bellare, Y., Canetti, R., & Krawczyk, H. (1998) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/276698.276854 · Cited by 357
Self-citationFair Computation of General Functions in Presence of Immoral Majority
Goldwasser, S., & Levin, L. A. (2007) · Springer eBooks · doi:10.1007/3-540-38424-3_6 · Cited by 345
On Formal Models for Secure Key Exchange.
Shoup, V. (1999) · Cited by 322
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 257
Self-citationSecure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority
Beaver, D. (1991) · Journal of Cryptology · doi:10.1007/bf00196771 · Cited by 226
Systematic Design of Two-Party Authentication Protocols
Bird, R., Gopal, I. S., Herzberg, A., Janson, P., Kutten, S., Molva, R. A., & Yung, M. M. (2007) · Springer eBooks · doi:10.1007/3-540-46766-1_3 · Cited by 148
Systematic design of a family of attack-resistant authentication protocols
Bird, R., Gopal, I., Herzberg, A., Janson, P. A., Kutten, S., Molva, R. A., & Yung, M. M. (1993) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.223869 · Cited by 141
Universally Composable Notions of Key Exchange and Secure Channels (Extended Abstract)
Canetti, R., & Krawczyk, H. (2002) · Cited by 19
Self-citationProvably Secure Certified Mail
Pfitzmann, B., Schunter, M., & Waidner, M. (2000) · Cited by 14
Research works printed but not linked: 1
- S. Goldwasser and S. Micali, Probabilistic encryption, JCSS, Vol. 28, No 2, April 1984, pp. 270–299.
Cited by
Sorted by citations
HMQV: A High-Performance Secure Diffie-Hellman Protocol
Krawczyk, H. (2005) · Lecture notes in computer science · doi:10.1007/11535218_33 · Cited by 757
Self-citationQuantum random number generation
Ma, X., Yuan, X., Cao, Z., Qi, B., & Zhang, Z. (2016) · npj Quantum Information · doi:10.1038/npjqi.2016.21 · Cited by 445
Scalable Protocols for Authenticated Group Key Exchange
Katz, J. I., & Yung, M. M. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-45146-4_7 · Cited by 395
Lattice Cryptography for the Internet
Peikert, C. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-11659-4_12 · Cited by 361
Bellare, M., & Palacio, A. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45708-9_11 · Cited by 313
Metadata
- Authors
- Canetti, R., & Krawczyk, H.
- Affiliations
- IBM Research - Thomas J. Watson Research Center (US)
- Technion – Israel Institute of Technology (IL)
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2002
- Pages
- 337-351
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1561441787
- Cited by
- 746
- References
- 28
- Citations by year
- 2026: 39 · 2025: 95 · 2024: 95 · 2023: 88 · 2022: 74 · 2021: 54 · 2020: 49 · 2019: 19 · 2018: 18 · 2017: 8 · 2016: 8 · 2015: 11 · 2014: 12 · 2013: 11 · 2012: 7
- FWCI
- 12.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 › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Keywords
- key exchange, secure communication channels, universally composable security, composability, secret key establishment
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
