CoChat
Sign Up
Cited by 227Quantum Information and CryptographyCryptography and Data SecurityQuantum Computing Algorithms and Architecture

The Universal Composable Security of Quantum Key Distribution

Open access
Ben-Or, Michael, Horodecki, Michał, Leung, Debbie W., Mayers, Dominic, Oppenheim, Jonathan·2005·Lecture Notes in Computer Science
DOI 10.1007/978-3-540-30576-7_21
Open this paper in CoChat — free accountOpen PDF

Integrity signals

Registry

Crossref · 10.1007/978-3-540-30576-7_21

Cites

Statistics

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

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 [95]

The citation lists haven’t been fetched yet

References 33 · Cited by 227

Authors
Ben-Or, M., Horodecki, M., Leung, D. W., Mayers, D., & Oppenheim, J.
Affiliations
  • Isaac Newton Institute for Mathematical Sciences (GB)
  • California Institute of Technology (US)
ORCID
Venue
Lecture Notes in Computer Science
Publisher
Springer Berlin Heidelberg
Published
2005
Pages
386-406
ISSN
  • 0302-9743 (ISSN-L)
  • 1611-3349
DOI
10.1007/978-3-540-30576-7_21
OpenAlex
W1787342803
Cited by
227
References
33
Citations by year
2026: 15 · 2025: 9 · 2024: 5 · 2023: 8 · 2022: 11 · 2021: 17 · 2020: 17 · 2019: 12 · 2018: 8 · 2017: 10 · 2016: 15 · 2015: 16 · 2014: 13 · 2013: 6 · 2012: 6
FWCI
5.95
Type
conference paper
Language
en
Open access
Locations
  • Lecture notes in computer science (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
  • UCL Discovery (University College London) (submittedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
  • Physical Sciences › Computer Science › Artificial Intelligence › Cryptography and Data Security
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
Keywords
quantum key distribution, universal composability, composable security, information-theoretic security, security definitions

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