TY - JOUR
T1 - Leftover hashing against quantum side information
AU - Tomamichel, Marco
AU - Schaffner, Christian
AU - Smith, Adam
AU - Renner, Renato
N1 - Funding Information:
Manuscript received July 19, 2010; revised February 03, 2011; accepted March 16, 2011. Date of current version July 29, 2011. M. Tomamichel and R. Renner were supported by the Swiss National Science Foundation under Grant 200021-119868. C. Schaffner was supported by a NWO VICI project. A. Smith was supported by the U.S. National Science Foundation under Grants 0747294 and 0729171.
PY - 2011/8
Y1 - 2011/8
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, 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.
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, 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.
UR - http://www.scopus.com/inward/record.url?scp=79960993674&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79960993674&partnerID=8YFLogxK
U2 - 10.1109/TIT.2011.2158473
DO - 10.1109/TIT.2011.2158473
M3 - Review article
AN - SCOPUS:79960993674
SN - 0018-9448
VL - 57
SP - 5524
EP - 5535
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
IS - 8
M1 - 5961850
ER -