Robust protocols for securely expanding randomness and distributing keys using untrusted quantum devices

DOI10.1145/2885493zbMATH Open1407.94143arXiv1402.0489OpenAlexW2535210057WikidataQ130920921 ScholiaQ130920921MaRDI QIDQ3177810FDOQ3177810

Authors: Carl A. Miller, Yaoyun Shi 

Publication date: 2 August 2018

Published in: Journal of the ACM, Proceedings of the forty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)

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.

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

Recommendations

• Private randomness expansion with untrusted devices
• Infinite randomness expansion with a constant number of devices
• Certifiable quantum dice, or, true random number generation secure against quantum adversaries
• Simple and tight device-independent security proofs

zbMATH Keywords

uncertainty principlequantum cryptographykey distributionprivacyrandomness extractionnonlocal gamesrandomness expansionuntrusted devicerandom-number generation

Mathematics Subject Classification ID

Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)

Cites Work

• Theory of Cryptography
• On the geometry of differential privacy
• Interactive privacy via the median mechanism
• The price of privately releasing contingency tables and the spectra of random matrices with correlated rows
• Lower bounds in differential privacy
• Iterative Constructions and Private Data Release
• Differential privacy and the fat-shattering dimension of linear queries
• Our Data, Ourselves: Privacy Via Distributed Noise Generation
• On the complexity of differentially private data release, efficient algorithms and hardness results
• Title not available (Why is that?)
• Collusion-secure fingerprinting for digital data
• Advances in Cryptology – CRYPTO 2004
• Title not available (Why is that?)
• New Efficient Attacks on Statistical Disclosure Control Mechanisms
• Bounds on the sample complexity for private learning and private data release
• Answering \(n^{2+o(1)}\) counting queries with differential privacy is hard
• Characterizing the sample complexity of private learners
• Faster algorithms for privately releasing marginals
• Faster private release of marginals on small databases
• Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
• Efficient algorithms for privately releasing marginals via convex relaxations

Uses Software

• SuLQ

This page was built for publication: Robust protocols for securely expanding randomness and distributing keys using untrusted quantum devices

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