The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Leftover Hashing Against Quantum Side Information
Open accessAbstract
The Leftover Hash Lemma states that the output of a two-universal hash function applied to an input with sufficiently high entropy is almost uniformly random. In its standard formulation, the lemma refers to a notion of randomness that is (usually implicitly) defined with respect to classical side information. Here, a strictly more general version of the Leftover Hash Lemma that is valid even if side information is represented by the state of a quantum system is shown. Our result applies to almost two-universal families of hash functions. The generalized Leftover Hash Lemma has applications in cryptography, e.g., for key agreement in the presence of an adversary who is not restricted to classical information processing.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Quantum computation and quantum information
Law, J. (2001) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/505482.505499 · Cited by 18,842
Universal classes of hash functions
Carter, J. L., & Wegman, M. N. (1979) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(79)90044-8 · Cited by 2,519
Bhatia, R. (1997) · Graduate Texts in Mathematics · doi:10.1007/978-1-4612-0653-8 · Cited by 2,336
Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
Dodis, Y., Ostrovsky, R., Reyzin, L., & Smith, A. (2008) · SIAM Journal on Computing · doi:10.1137/060651380 · Cited by 1,717
Self-citationA Pseudorandom Generator from any One-way Function
HÅstad, J., Impagliazzo, R., Levin, L. A., & Luby, M. (1999) · SIAM Journal on Computing · doi:10.1137/s0097539793244708 · Cited by 1,653
Generalized privacy amplification
Bennett, C. H., Brassard, G., Crepeau, C., & Maurer, U. M. (1995) · IEEE Transactions on Information Theory · doi:10.1109/18.476316 · Cited by 1,417
Privacy Amplification by Public Discussion
Bennett, C. H., Brassard, G., & Robert, J.-M. (1988) · SIAM Journal on Computing · doi:10.1137/0217014 · Cited by 867
Pseudo-random generation from one-way functions
Impagliazzo, R., Levin, L. A., & Luby, M. (1989) · Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 · doi:10.1145/73007.73009 · Cited by 724
The Operational Meaning of Min- and Max-Entropy
Konig, R., Renner, R., & Schaffner, C. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2025545 · Cited by 659
Self-citationQuantum key distribution over25kmwith an all-fiber continuous-variable system
Lodewyck, J., Bloch, M., García-Patrón, R., Fossier, S., Karpov, E., Diamanti, E., Debuisschert, T., Cerf, N. J., Tualle-Brouri, R., McLaughlin, S. W., et al. (2007) · Physical Review A · doi:10.1103/physreva.76.042305 · Cited by 543
Cited by
Advances in quantum cryptography
Pirandola, S., Andersen, U. L., Banchi, L., Berta, M., Bunandar, D., Colbeck, R., Englund, D., Gehring, T., Lupo, C., Ottaviani, C., et al. (2020) · Advances in Optics and Photonics · doi:10.1364/aop.361502 · Cited by 2,033
Self-citationSecure quantum key distribution with realistic devices
Xu, F., Ma, X., Zhang, Q., Lo, H.-K., & Pan, J.-W. (2020) · Reviews of Modern Physics · doi:10.1103/revmodphys.92.025002 · Cited by 1,543
Quantum random number generators
Herrero-Collantes, M., & Garcia-Escartin, J. C. (2017) · Reviews of Modern Physics · doi:10.1103/revmodphys.89.015004 · Cited by 791
Entropic uncertainty relations and their applications
Coles, P. J., Berta, M., Tomamichel, M., & Wehner, S. (2017) · Reviews of Modern Physics · doi:10.1103/revmodphys.89.015002 · Cited by 658
Self-citationTight finite-key analysis for quantum cryptography
Tomamichel, M., Lim, C. C. W., Gisin, N., & Renner, R. (2012) · Nature Communications · doi:10.1038/ncomms1631 · Cited by 634
Self-citationA generator for unique quantum random numbers based on vacuum states
Gabriel, C., Wittmann, C., Sych, D., Dong, R., Mauerer, W., Andersen, U. L., Marquardt, C., & Leuchs, G. (2010) · Nature Photonics · doi:10.1038/nphoton.2010.197 · Cited by 419
Security in quantum cryptography
Portmann, C., & Renner, R. (2022) · Reviews of Modern Physics · doi:10.1103/revmodphys.94.025008 · Cited by 390
Self-citationComposable Security Proof for Continuous-Variable Quantum Key Distribution with Coherent States
Leverrier, A. (2015) · Physical Review Letters · doi:10.1103/physrevlett.114.070501 · Cited by 382
Quantum Information Processing with Finite Resources
Tomamichel, M. (2016) · SpringerBriefs in Mathematical Physics · doi:10.1007/978-3-319-21891-5 · Cited by 329
Self-citationFurrer, F., Franz, T., Berta, M., Leverrier, A., Scholz, V. B., Tomamichel, M., & Werner, R. F. (2012) · Physical Review Letters · doi:10.1103/physrevlett.109.100502 · Cited by 303
Self-citationA Hierarchy of Information Quantities for Finite Block Length Analysis of Quantum Tasks
Tomamichel, M., & Hayashi, M. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2276628 · Cited by 284
Self-citationTrevisan's Extractor in the Presence of Quantum Side Information
De, A., Portmann, C., Vidick, T., & Renner, R. (2012) · SIAM Journal on Computing · doi:10.1137/100813683 · Cited by 161
Self-citationBeyond heat baths: Generalized resource theories for small-scale thermodynamics
Yunger Halpern, N., & Renes, J. M. (2016) · Physical Review E · doi:10.1103/physreve.93.022126 · Cited by 85
A modular framework for randomness extraction based on Trevisan's construction
Mauerer, W., Portmann, C., & Scholz, V. B. (2012) · arXiv · doi:10.48550/arxiv.1212.0520 · Cited by 23
Quantum-Proof Randomness Extractors via Operator Space Theory
Berta, M., Fawzi, O., & Scholz, V. B. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2627531 · Cited by 12
Variations on classical and quantum extractors
Berta, M., Fawzi, O., Scholz, V., & Szehr, O. (2014) · 2014 IEEE International Symposium on Information Theory · doi:10.1109/isit.2014.6875078 · Cited by 10
Practical randomness amplification and privatisation with implementations on quantum computers
Foreman, C., Wright, S., Edgington, A., Berta, M., & Curchod, F. J. (2020) · arXiv · doi:10.48550/arxiv.2009.06551 · Cited by 1
Metadata
- Authors
- Tomamichel, M., Schaffner, C., Smith, A., & Renner, R.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2011-08
- Volume
- 57
- Issue
- 8
- Pages
- 5524-5535
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2180630352
- Cited by
- 303
- References
- 33
- FWCI
- 14.78
- Type
- journal article
- Language
- en
- Open access
- green
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
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.