Leftover hashing against quantum side information

Marco Tomamichel, Christian Schaffner, Adam Smith, Renato Renner

Research output: Contribution to journalReview articlepeer-review

98 Scopus citations

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, 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.

Original languageEnglish (US)
Article number5961850
Pages (from-to)5524-5535
Number of pages12
JournalIEEE Transactions on Information Theory
Volume57
Issue number8
DOIs
StatePublished - Aug 2011

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Fingerprint Dive into the research topics of 'Leftover hashing against quantum side information'. Together they form a unique fingerprint.

Cite this