Leftover hashing against quantum side information

Marco Tomamichel, Renato Renner, Christian Schaffner, Adam Davison Smith

Research output: Chapter in Book/Report/Conference proceedingConference contribution

10 Citations (Scopus)

Abstract

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, we prove 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. Furthermore, our result applies to arbitrary δ-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.

Original languageEnglish (US)
Title of host publication2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings
Pages2703-2707
Number of pages5
DOIs
StatePublished - Aug 23 2010
Event2010 IEEE International Symposium on Information Theory, ISIT 2010 - Austin, TX, United States
Duration: Jun 13 2010Jun 18 2010

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8103

Other

Other2010 IEEE International Symposium on Information Theory, ISIT 2010
CountryUnited States
CityAustin, TX
Period6/13/106/18/10

Fingerprint

Hash functions
Side Information
Quantum Information
Hashing
Lemma
Hash Function
Cryptography
Entropy
Key Agreement
Universal Function
Information Processing
Quantum Systems
Randomness
Strictly
Valid
Formulation
Output
Arbitrary

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Cite this

Tomamichel, M., Renner, R., Schaffner, C., & Smith, A. D. (2010). Leftover hashing against quantum side information. In 2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings (pp. 2703-2707). [5513652] (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2010.5513652
Tomamichel, Marco ; Renner, Renato ; Schaffner, Christian ; Smith, Adam Davison. / Leftover hashing against quantum side information. 2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings. 2010. pp. 2703-2707 (IEEE International Symposium on Information Theory - Proceedings).
@inproceedings{6e8b6c9f039c4106b4521a0ec8f80032,
title = "Leftover hashing against quantum side information",
abstract = "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, we prove 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. Furthermore, our result applies to arbitrary δ-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.",
author = "Marco Tomamichel and Renato Renner and Christian Schaffner and Smith, {Adam Davison}",
year = "2010",
month = "8",
day = "23",
doi = "10.1109/ISIT.2010.5513652",
language = "English (US)",
isbn = "9781424469604",
series = "IEEE International Symposium on Information Theory - Proceedings",
pages = "2703--2707",
booktitle = "2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings",

}

Tomamichel, M, Renner, R, Schaffner, C & Smith, AD 2010, Leftover hashing against quantum side information. in 2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings., 5513652, IEEE International Symposium on Information Theory - Proceedings, pp. 2703-2707, 2010 IEEE International Symposium on Information Theory, ISIT 2010, Austin, TX, United States, 6/13/10. https://doi.org/10.1109/ISIT.2010.5513652

Leftover hashing against quantum side information. / Tomamichel, Marco; Renner, Renato; Schaffner, Christian; Smith, Adam Davison.

2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings. 2010. p. 2703-2707 5513652 (IEEE International Symposium on Information Theory - Proceedings).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Leftover hashing against quantum side information

AU - Tomamichel, Marco

AU - Renner, Renato

AU - Schaffner, Christian

AU - Smith, Adam Davison

PY - 2010/8/23

Y1 - 2010/8/23

N2 - 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, we prove 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. Furthermore, our result applies to arbitrary δ-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.

AB - 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, we prove 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. Furthermore, our result applies to arbitrary δ-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.

UR - http://www.scopus.com/inward/record.url?scp=77955669047&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77955669047&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2010.5513652

DO - 10.1109/ISIT.2010.5513652

M3 - Conference contribution

AN - SCOPUS:77955669047

SN - 9781424469604

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 2703

EP - 2707

BT - 2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings

ER -

Tomamichel M, Renner R, Schaffner C, Smith AD. Leftover hashing against quantum side information. In 2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings. 2010. p. 2703-2707. 5513652. (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2010.5513652