Robust Protocols for Securely Expanding Randomness and Distributing Keys Using Untrusted Quantum Devices

DOI10.1145/2885493zbMath1407.94143arXiv1402.0489OpenAlexW2535210057MaRDI QIDQ3177810

Yaoyun Shi, Carl A. Miller

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)

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

zbMATH Keywords

uncertainty principleprivacyquantum cryptographykey distributionrandomness extractionnonlocal gamesrandomness expansionuntrusted devicerandom-number generation

Mathematics Subject Classification ID

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

Related Items

Interactive Proofs with Approximately Commuting Provers, Universal Security for Randomness Expansion from the Spot-Checking Protocol, Unnamed Item, Quantum cryptography beyond quantum key distribution, Entropy accumulation, Simple and Tight Device-Independent Security Proofs, Probing entropic uncertainty relations under a two-atom system coupled with structured bosonic reservoirs, Linear game non-contextuality and Bell inequalities—a graph-theoretic approach

Uses Software

• SuLQ

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient algorithms for privately releasing marginals via convex relaxations
• The Geometry of Differential Privacy: The Small Database and Approximate Cases
• Faster Algorithms for Privately Releasing Marginals
• Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
• Privately Releasing Conjunctions and the Statistical Query Barrier
• 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
• Characterizing the sample complexity of private learners
• Faster private release of marginals on small databases
• Bounds on the Sample Complexity for Private Learning and Private Data Release
• Differential Privacy and the Fat-Shattering Dimension of Linear Queries
• Our Data, Ourselves: Privacy Via Distributed Noise Generation
• New Efficient Attacks on Statistical Disclosure Control Mechanisms
• Collusion-secure fingerprinting for digital data
• On the complexity of differentially private data release
• Advances in Cryptology – CRYPTO 2004
• Answering n _{2+o(1)} counting queries with differential privacy is hard
• Theory of Cryptography