Robust protocols for securely expanding randomness and distributing keys using untrusted quantum devices
arXiv:1402.0489
Abstract
Randomness is a vital resource for modern day information processing, especially for cryptography. A wide range of applications critically rely on abundant, high quality random numbers generated securely. Here we show how to expand a random seed at an exponential rate without trusting the underlying quantum devices. Our approach is secure against the most general adversaries, and has the following new features: cryptographic level of security, tolerating a constant level of imprecision in the devices, requiring only a unit size quantum memory per device component for the honest implementation, and allowing a large natural class of constructions for the protocol. In conjunct with a recent work by Chung, Shi and Wu, it also leads to robust unbounded expansion using just 2 multi-part devices. When adapted for distributing cryptographic keys, our method achieves, for the first time, exponential expansion combined with cryptographic security and noise tolerance. The proof proceeds by showing that the Renyi divergence of the outputs of the protocol (for a specific bounding operator) decreases linearly as the protocol iterates. At the heart of the proof are a new uncertainty principle on quantum measurements, and a method for simulating trusted measurements with untrusted devices.
arXiv commentv4: Revised for publication. QKD section substantially revised with corrected and complete proofs. Some reorganization, with appendices added. Minor corrections & changes. 70 pages
References in corpus (25)
- Non-Abelian Anyons and Topological Quantum Computation
- Simple Proof of Security of the BB84 Quantum Key Distribution Protocol
- Unconditional Security Of Quantum Key Distribution Over Arbitrarily Long Distances
- Random Numbers Certified by Bell's Theorem
- No Signalling and Quantum Key Distribution
- Information Causality as a Physical Principle
- On quantum Renyi entropies: a new generalization and some properties
- Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Renyi relative entropy
- All multipartite Bell correlation inequalities for two dichotomic observables per site
- Fully device independent quantum key distribution
- Min- and Max- Relative Entropies and a New Entanglement Monotone
- The Uncertainty Relation for Smooth Entropies
- Secure device-independent quantum key distribution with causally independent measurement devices
- Free randomness can be amplified
- Sandwiched Rényi Divergence Satisfies Data Processing Inequality
- Duality Between Smooth Min- and Max-Entropies
- Memory Attacks on Device-Independent Quantum Cryptography
- Security of practical private randomness generation
- Trevisan's extractor in the presence of quantum side information
- Security and Composability of Randomness Expansion from Bell Inequalities
- Entanglement sampling and applications
- Unconditionally secure device-independent quantum key distribution with only two devices
- Physical Randomness Extractors: Generating Random Numbers with Minimal Assumptions
- Optimal robust quantum self-testing by binary nonlocal XOR games
- Infinite Randomness Expansion and Amplification with a Constant Number of Devices