Leftover Hashing Against Quantum Side Information

DOI10.1109/TIT.2011.2158473zbMath1365.81032arXiv1002.2436OpenAlexW2180630352WikidataQ60026423 ScholiaQ60026423MaRDI QIDQ5273504

No author found.

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

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

Related Items

Asymptotic reversibility of thermal operations for interacting quantum spin systems via generalized quantum Stein’s lemma ⋮ Quantum Bilinear Optimization ⋮ Relating different quantum generalizations of the conditional Rényi entropy ⋮ Composable security of unidimensional continuous-variable quantum key distribution ⋮ Two-way unclonable encryption with a vulnerable sender ⋮ A modular framework for quantum-proof randomness extractors ⋮ 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 ⋮ Optimizing the decoy-state BB84 QKD protocol parameters ⋮ One-shot decoupling ⋮ Simple and Tight Device-Independent Security Proofs ⋮ Decoupling with unitary approximate two-designs ⋮ Secure Random Number Generation in Continuous Variable Systems ⋮ THE PHYSICS OF QUANTUM INFORMATION: COMPLEMENTARITY, UNCERTAINTY, AND ENTANGLEMENT ⋮ The quantum reverse Shannon theorem based on one-shot information theory ⋮ The smooth entropy formalism for von Neumann algebras ⋮ Strong converse theorems using Rényi entropies ⋮ Better short-seed quantum-proof extractors ⋮ Quantum key distribution using universal hash functions over finite fields ⋮ Estimating security of the quantum key distribution from the guesswork