Leftover Hashing against quantum side information
METADATA ONLY
Loading...
Author / Producer
Date
2010
Publication Type
Conference Paper
ETH Bibliography
yes
Citations
Altmetric
METADATA ONLY
Data
Rights / License
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, 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 δ-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.
Permanent link
Publication status
published
External links
Editor
Book title
2010 IEEE International Symposium on Information Theory
Journal / series
Volume
Pages / Article No.
2703 - 2707
Publisher
IEEE
Event
IEEE International Symposium on Information Theory (ISIT 2010)
Edition / version
Methods
Software
Geographic location
Date collected
Date created
Subject
Organisational unit
03781 - Renner, Renato / Renner, Renato