Leftover Hashing Against Quantum Side Information

@article{Tomamichel2010LeftoverHA,
  title={Leftover Hashing Against Quantum Side Information},
  author={Marco Tomamichel and Renato Renner and Christian Schaffner and Adam D. Smith},
  journal={2010 IEEE International Symposium on Information Theory},
  year={2010},
  pages={2703-2707}
}
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… CONTINUE READING

Topics

Statistics

01020201020112012201320142015201620172018
Citations per Year

109 Citations

Semantic Scholar estimates that this publication has 109 citations based on the available data.

See our FAQ for additional information.