Robust Protocols for Securely Expanding Randomness and Distributing Keys Using Untrusted Quantum Devices
- 26 October 2016
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 63 (4), 1-63
- https://doi.org/10.1145/2885493
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 devices, requiring only unit size quantum memory (for each device component) in an honest implementation, and allowing a large natural class of constructions for the protocol. In conjunction with a recent work by Chung et al. [2014], it also leads to robust unbounded expansion using just 2 multipart 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.Keywords
Other Versions
This publication has 44 references indexed in Scilit:
- Secure device-independent quantum key distribution with causally independent measurement devicesNature Communications, 2011
- Entropic uncertainty relations—a surveyNew Journal of Physics, 2010
- Non-Abelian anyons and topological quantum computationReviews of Modern Physics, 2008
- Linear-Time Encodable/Decodable Codes With Near-Optimal RateIEEE Transactions on Information Theory, 2005
- Extractors and pseudorandom generatorsJournal of the ACM, 2001
- Unconditional security in quantum cryptographyJournal of the ACM, 2001
- Simple Proof of Security of the BB84 Quantum Key Distribution ProtocolPhysical Review Letters, 2000
- Unconditional Security of Quantum Key Distribution over Arbitrarily Long DistancesScience, 1999
- Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphsIEEE Transactions on Information Theory, 1992
- Quantum cryptography based on Bell’s theoremPhysical Review Letters, 1991