Cited by 749Cryptography and Data SecurityAdvanced Authentication Protocols SecurityQuantum Information and Cryptography

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

Canetti, Ran, Krawczyk, Hugo·2002·Lecture Notes in Computer Science

Overview

Integrity signals

Registry

Crossref · 10.1007/3-540-46035-7_22

Cites

26 of 26 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

  • The composable extractor was first introduced in classical cryptography and later extended to quantum cryptography.

    “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

Flagged first, then by citations

2 of the 28 references couldn’t be matched to a known paper.

Research works printed but not linked: 1

  1. S. Goldwasser and S. Micali, Probabilistic encryption, JCSS, Vol. 28, No 2, April 1984, pp. 270–299.

Cited by

Sorted by citations

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
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