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.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
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.
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
Min- and Max-Relative Entropies and a New Entanglement Monotone
Datta, N. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2018325 · Cited by 491
Impagliazzo, R., & Zuckerman, D. (1989) · 30th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1989.63486 · Cited by 387
A Fully Quantum Asymptotic Equipartition Property
Tomamichel, M., Colbeck, R., & Renner, R. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2032797 · Cited by 356
Self-citationUniversally Composable Privacy Amplification Against Quantum Adversaries
Renner, R., & König, R. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30576-7_22 · Cited by 337
Self-citationExtractors and pseudorandom generators
(2001) · Journal of the ACM · doi:10.1145/502090.502099 · Cited by 324
Universal hashing and authentication codes
Stinson, D. R. (1994) · Designs, Codes and Cryptography · doi:10.1007/bf01388651 · Cited by 292
Duality Between Smooth Min- and Max-Entropies
Tomamichel, M., Colbeck, R., & Renner, R. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2054130 · Cited by 236
Self-citationQuantum Cryptography and Secret-Key Distillation
Assche, G. V. (2006) · Cambridge University Press eBooks · doi:10.1017/cbo9780511617744 · Cited by 209
The Quantum Capacity of Channels With Arbitrarily Correlated Noise
Buscemi, F., & Datta, N. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2039166 · Cited by 184
Correcting errors without leaking partial information
Dodis, Y., & Smith, A. (2005) · Proceedings of the thirty-seventh annual ACM symposium on Theory of computing · doi:10.1145/1060590.1060688 · Cited by 171
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-citationGavinsky, D., Kempe, J., Kerenidis, I., Raz, R., & de Wolf, R. (2007) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1250790.1250866 · Cited by 160
Single-shot Quantum State MergingPreprint
Berta, M. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0912.4495 · Cited by 108
Zur quantenmechanischen Begr�ndung des zweiten Hauptsatzes der W�rmelehre
Klein, O. (1931) · The European Physical Journal A · doi:10.1007/bf01341997 · Cited by 103
On the Power of Quantum Memory
König, R., Maurer, U. M., & Renner, R. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.850087 · Cited by 95
Self-citationComputing with Very Weak Random Sources
Srinivasan, A., & Zuckerman, D. (1999) · SIAM Journal on Computing · doi:10.1137/s009753979630091x · Cited by 85
Sampling of Min-Entropy Relative to Quantum Knowledge
König, R., & Renner, R. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2146730 · Cited by 76
Self-citationGeneralized relative entropies and the capacity of classical-quantum channels
Mosonyi, M., & Datta, N. (2009) · Journal of Mathematical Physics · doi:10.1063/1.3167288 · Cited by 68
The Transition Probability for States of *‐Algebras
Uhlmann, A. (1985) · Annalen der Physik · doi:10.1002/andp.19854970419 · Cited by 43
Randomness Extraction Via δ-Biased Masking in the Presence of a Quantum Attacker
Fehr, S., & Schaffner, C. (2008) · Springer eBooks · doi:10.1007/978-3-540-78524-8_26 · Cited by 40
Self-citationNear-optimal extractors against quantum storage
De, A., & Vidick, T. (2010) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1806689.1806713 · Cited by 29
Short seed extractors against quantum storage
Ta‐Shma, A. (2009) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1536414.1536470 · Cited by 25
Quantum Entropic Security and Approximate Quantum Encryption
Desrosiers, S. P., & Dupuis, F. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2048488 · Cited by 21
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-citation
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.