Simple and Tight Device-Independent Security Proofs

DOI10.1137/18M1174726zbMath1410.81014arXiv1607.01797WikidataQ113779102 ScholiaQ113779102MaRDI QIDQ4629390

Thomas Vidick, Rotem Arnon-Friedman, Renato Renner

Publication date: 22 March 2019

Published in: SIAM Journal on Computing (Search for Journal in Brave)

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

zbMATH Keywords

quantum cryptographyrandomnesskey distributionsecurity proofsdevice independence

Mathematics Subject Classification ID

Cryptography (94A60) Quantum coherence, entanglement, quantum correlations (81P40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (3)

Semi-quantum money ⋮ Universal Security for Randomness Expansion from the Spot-Checking Protocol ⋮ Entropy accumulation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quantum cryptography: public key distribution and coin tossing
• Structure of states which satisfy strong subadditivity of quantum entropy with equality
• Entropy accumulation
• Verifier-on-a-leash: new schemes for verifiable delegated quantum computation, with quasilinear resources
• Quantum randomness extraction for various levels of characterization of the devices
• Full Security of Quantum Key Distribution From No-Signaling Constraints
• From Bell’s Theorem to Secure Quantum Key Distribution
• Trevisan's Extractor in the Presence of Quantum Side Information
• Robust Protocols for Securely Expanding Randomness and Distributing Keys Using Untrusted Quantum Devices
• SECURITY OF QUANTUM KEY DISTRIBUTION
• Efficient Device-Independent Quantum Key Distribution
• Interval algorithm for random number generation
• Quantum cryptography based on Bell’s theorem
• A Fully Quantum Asymptotic Equipartition Property
• Robustness and device independence of verifiable blind quantum computing
• Entropy Accumulation With Improved Second-Order Term
• Infinite randomness expansion with a constant number of devices
• Leftover Hashing Against Quantum Side Information
• Duality Between Smooth Min- and Max-Entropies
• Universal Security for Randomness Expansion from the Spot-Checking Protocol
• Proposed Experiment to Test Local Hidden-Variable Theories
• Certifiable quantum dice
• Simple and Tight Bounds for Information Reconciliation and Privacy Amplification
• Quantum Information Processing with Finite Resources
• Security Bounds for Quantum Cryptography with Finite Resources
• Theory of Cryptography
• Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
• Device-independent bit commitment based on the CHSH inequality

This page was built for publication: Simple and Tight Device-Independent Security Proofs