Leftover hashing against quantum side information

Publication Type:
Conference Proceeding
Citation:
IEEE International Symposium on Information Theory - Proceedings, 2010, pp. 2703 - 2707
Issue Date:
2010-08-23
Metrics:
Full metadata record
Files in This Item:
Filename Description Size
cp.pdfPublished version115.05 kB
Adobe PDF
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. © 2010 IEEE.
Please use this identifier to cite or link to this item: