Leftover hashing against quantum side information

Publication Type:
Journal Article
IEEE Transactions on Information Theory, 2011, 57 (8), pp. 5524 - 5535
Issue Date:
Filename Description Size
ja.pdfPublished Version259.41 kB
Adobe PDF
Full metadata record
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. © 2011 IEEE.
Please use this identifier to cite or link to this item: