Infinite randomness expansion with a constant number of devices

DOI10.1145/2591796.2591873zbMath1315.94067arXiv1310.6755OpenAlexW2009263142WikidataQ130979427 ScholiaQ130979427MaRDI QIDQ5259577

Henry C. Yuen, Matthew Coudron

Publication date: 26 June 2015

Published in: 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/1310.6755

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (6)

On characterising assemblages in Einstein–Podolsky–Rosen scenarios ⋮ Universal Security for Randomness Expansion from the Spot-Checking Protocol ⋮ Another round of breaking and making quantum money: how to not build it from lattices, and more ⋮ Deciding the existence of perfect entangled strategies for nonlocal games ⋮ Simple and Tight Device-Independent Security Proofs ⋮ Semi-device-independent randomness certification with partially free random sources using \(4\rightarrow 1\) quantum random access code

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

This page was built for publication: Infinite randomness expansion with a constant number of devices