Trevisan's Extractor in the Presence of Quantum Side Information
Open accessAbstract
Randomness extraction involves the processing of purely classical information and is therefore usually studied with in the framework of classical probability theory. However, such a classical treatment is generally too restrictive for applications where side information about the values taken by classical random variables may be represented by the state of a quantum system. This is particularly relevant in the context of cryptography, where an adversary may make use of quantum devices. Here, we show that the well-known construction paradigm for extractors proposed by Trevisan is sound in the presence of quantum side information. We exploit the modularity of this paradigm to give several concrete extractor constructions, which, e.g., extract all the conditional (smooth) min-entropy of the source using a seed of length polylogarithmic in the input, or only require the seed to be weakly random.
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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?
Trevisan's extractor has been proven to be secure against quantum adversaries.
“Trevisan ' s extractor 97,98 has been proven to be secure against quantum adversaries. 99”
From Quantum random number generation (2016) · cites this paper as [99]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
The citation lists haven’t been fetched yet
References 38 · Cited by 161
Research works printed but not linked: 6
- [ANTSV99] Andris Ambainis, Ashwin Nayak, Ammon Ta-Shma, and Umesh Vazirani. Dense quantum coding and a lower bound for 1way quantum automata. In Proceedings of the 31st symposium on theory of computing, STOC '99 , pages 376-383. ACM, 1999. [doi:10.1145/301250.301347, arXiv:quant-ph/9804043]. · DOI
- [KK10] Roy Kasher and Julia Kempe. Two-source extractors secure against quantum adversaries. In Proceedings of the international conference on Approximation, Randomization, and Combinatorial Optimization, APPROX-RANDOM '10 , pages 656-669. Springer, 2010. [doi:10.1007/978-3-642-15369-3 49, arXiv:1005.0512]. · DOI
- [Mau92] Ueli M. Maurer. Conditionally-perfect secrecy and a provablysecure randomized cipher. Journal of Cryptology , 5(1):53-66, 1992.
- [Sol10] Raffaele Solc` a. Efficient simulation of random quantum states and operators. Master's thesis, Swiss Federal Institute of Technology, Zurich, 2010.
- [XQM + 11] Feihu Xu, Bing Qi, Xiongfeng Ma, He Xu, Haoxuan Zheng, and HoiKwong Lo. An ultrafast quantum random number generator based on quantum phase fluctuations. eprint, 2011. [arXiv:1109.0643]. · arXiv
- [Yao82] Andrew Chi-Chih Yao. Theory and applications of trapdoor functions (extended abstract). In Proceedings of the 23rd Symposium on Foundations of Computer Science, FOCS '82 , pages 80-91. IEEE, 1982.
- Authors
- De, A., Portmann, C., Vidick, T., & Renner, R.
- Affiliations
- University of California, Berkeley (US)
- University of Geneva (CH)
- Massachusetts Institute of Technology (US)
- Venue
- SIAM Journal on Computing
- Published
- 2012-01
- Volume
- 41
- Issue
- 4
- Pages
- 915-940
- ISSN
- 0097-5397 (ISSN-L)
- 1095-7111
- OpenAlex
- W1508777461
- Cited by
- 161
- References
- 38
- Citations by year
- 2026: 4 · 2025: 10 · 2024: 4 · 2023: 9 · 2022: 7 · 2021: 10 · 2020: 14 · 2019: 33 · 2018: 3 · 2017: 6 · 2016: 11 · 2015: 4 · 2014: 13 · 2013: 10 · 2012: 9
- FWCI
- 11.34
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- SIAM Journal on Computing (publishedVersion)
- arXiv (Cornell University) (publishedVersion)
- CaltechAUTHORS (California Institute of Technology) (submittedVersion)
- DSpace@MIT (Massachusetts Institute of Technology) (submittedVersion, cc-by-nc)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Computability, Logic, AI Algorithms
- Physical Sciences › Computer Science › Artificial Intelligence › Cryptography and Data Security
- Keywords
- randomness extraction, quantum side information, conditional min-entropy, 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
