Leftover Hashing Against Quantum Side Information

Details Leftover Hashing Against Quantum Side Information Leftover Hashing Against Quantum Side Information

2010-02-12

arxiv.org/abs/1002.2436v1

IEEE Trans. Inf. Theory, 57 (8), 2011

Physics

Quantum Physics

Scientific paper

10.1109/TIT.2011.2158473

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

Affiliated with

Also associated with

No associations

Rating

Leftover Hashing Against Quantum Side Information does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Leftover Hashing Against Quantum Side Information, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Leftover Hashing Against Quantum Side Information will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-419097