Leftover Hashing Against Quantum Side Information

DOI10.1109/TIT.2011.2158473MaRDI QIDQ5273504zbMATH OpenOpenAlexWikidataFDO

Authors

Publication date 12 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1002.2436

Mathematics Subject Classification ID

Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum cryptography (quantum-theoretic aspects) (81P94) Measures of information, entropy (94A17)

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

Cited in

(25)

• Composable security of unidimensional continuous-variable quantum key distribution
• Quantum key distribution using universal hash functions over finite fields
• Estimating security of the quantum key distribution from the guesswork
• A modular framework for quantum-proof randomness extractors
• One-shot decoupling
• Optimizing the decoy-state BB84 QKD protocol parameters
• The smooth entropy formalism for von Neumann algebras
• Strong converse theorems using Rényi entropies
• Quantum bilinear optimization
• Relating different quantum generalizations of the conditional Rényi entropy
• Secure Random Number Generation in Continuous Variable Systems
• Simple and tight device-independent security proofs
• Asymptotic reversibility of thermal operations for interacting quantum spin systems via generalized quantum Stein's lemma
• Two-way unclonable encryption with a vulnerable sender
• Decoupling with unitary approximate two-designs
• THE PHYSICS OF QUANTUM INFORMATION: COMPLEMENTARITY, UNCERTAINTY, AND ENTANGLEMENT
• Bounds for smooth min- and max-entropy
• Operational interpretation of the sandwiched Rényi divergence of order 1/2 to 1 as strong converse exponents
• Cone-restricted information theory
• Smooth min-entropy lower bounds for approximation chains
• One-shot holography
• Decoherence and quantum threats in voice biometric authentication with post-quantum countermeasures
• Mathematical model of random number generator based on vacuum fluctuations
• The quantum reverse Shannon theorem based on one-shot information theory
• Better short-seed quantum-proof extractors

This page was built for publication: Leftover Hashing Against Quantum Side Information

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5273504)