Leftover Hashing Against Quantum Side Information

@article{Tomamichel2011LeftoverHA,
  title={Leftover Hashing Against Quantum Side Information},
  author={Marco Tomamichel and Christian Schaffner and Adam D. Smith and Renato Renner},
  journal={IEEE Transactions on Information Theory},
  year={2011},
  volume={57},
  pages={5524-5535}
}
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… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 56 extracted citations

Large Deviation Analysis for Quantum Security via Smoothing of Rényi Entropy of Order 2

IEEE Transactions on Information Theory • 2014
View 5 Excerpts
Highly Influenced

The Complexity of Entangled Games

View 4 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…