CoChat
Sign Up
Cited by 337Quantum Information and CryptographyCryptography and Data SecurityCoding theory and cryptography

Universally Composable Privacy Amplification Against Quantum Adversaries

Open access
Renner, Renato, König, Robert·2005·Lecture Notes in Computer Science
DOI 10.1007/978-3-540-30576-7_22
Open this paper in CoChat — free accountOpen PDF

Integrity signals

Registry

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

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

The citation lists haven’t been fetched yet

References 30 · Cited by 337

Authors
Renner, R., & König, R.
Affiliations
ETH Zurich (CH)
ORCID
Venue
Lecture Notes in Computer Science
Publisher
Springer Berlin Heidelberg
Published
2005
Pages
407-425
ISSN
  • 0302-9743 (ISSN-L)
  • 1611-3349
DOI
10.1007/978-3-540-30576-7_22
OpenAlex
W2114805880
Cited by
337
References
30
Citations by year
2026: 12 · 2025: 14 · 2024: 10 · 2023: 12 · 2022: 15 · 2021: 20 · 2020: 15 · 2019: 19 · 2018: 12 · 2017: 14 · 2016: 17 · 2015: 22 · 2014: 25 · 2013: 16 · 2012: 15
FWCI
9.64
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)
  • arXiv (Cornell University)
Funders
Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung (66716)
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 › Coding theory and cryptography
Keywords
privacy amplification, universally composable security, quantum adversaries, key extraction, quantum key distribution, quantum cryptography

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