Leftover Hashing Against Quantum Side Information
By Marco Tomamichel, Christian Schaffner, Adam D. Smith, Renato Renner. IEEE Transactions on Information Theory, 2010
304 citations recorded by the source corpus.
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.
Subfields: Artificial Intelligence
View Paper: https://www.semanticscholar.org/paper/0460303f7bac4fc8eae01482b31b2fb98bf9e95e
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Renato Renner
- Marco Tomamichel
- Mario Berta
- Matthias Christandl
- Juan Carlos García-Escartín
- Miguel Herrero-Collantes
- Fernando G. S. L. Brandão
- Omar Fawzi
Citations in the corpus
- Quantum random number generators (2016, methodology): “If we have a good estimation or a conservative bound on the correlation of our weak random source with the eavesdropper, using the conditional entropies described in Section IV, it is possible to use a generalization of the Leftover Hash Lemma with side information (Tomamichel et al., 2011).”
- Quantum Information Processing with Finite Resources - Mathematical Foundations (2015, background): “ld for smooth min- and max-entropies, it was later found that the purified distance [156] is more appropriate. The chain rules were derived by Vitanov et al. [168,169], based on preliminary results in [20, 160]. The specialized chain rules for classical information in Lemmas6.7and6.8were partially de”
- Tight finite-key analysis for quantum cryptography (2011, unknown): “These protocols are described in Table I.”
- The Quantum Reverse Shannon Theorem Based on One-Shot Information Theory (2009, methodology): “Smooth entropy measures have properties similar to the ones of the von Neumann entropy and like in the iid case many operational interpretations are known [12,15–29].”