Fetching the paper…
Reading the bibliography…
In differential privacy (DP), we want to query a database about n users, in a way that "leaks at most eps about any individual user," even conditioned on any outcome of the query.
Proposed experiment to test local hidden-variable theories
J. F. Clauser, M. A. Horne, A. Shimony, and R. A. Holt · 1969
Earlier work this paper cites.
Two theorems on random polynomial time
L. Adleman · 1978
Earlier work this paper cites.
Approximate Distributions of Order Statistics
R.-D. Reiss · 1989
Earlier work this paper cites.
Strengths and weaknesses of quantum computing
C. Bennett, E. Bernstein, G. Brassard, and U. Vazirani · 1997
Earlier work this paper cites.
Separability of very noisy mixed states and implications for NMR quantum computing
S. L. Braunstein, C. M. Caves, N. Linden, S. Popescu, and R. Schack · 1999
Earlier work this paper cites.
Quantum Computation and Quantum Information
M. Nielsen and I. Chuang · 2000
Earlier work this paper cites.
Quantum lower bound for the collision problem
S. Aaronson · 2002
Earlier work this paper cites.
Adiabatic quantum state generation and statistical zero knowledge
D. Aharonov and A. Ta-Shma · 2003
Earlier work this paper cites.
Separable balls around the maximally mixed multipartite quantum states
L. Gurvits and H. Barnum · 2003
Earlier work this paper cites.
Quantum theory from five reasonable axioms
L. Hardy · 2003
Earlier work this paper cites.
Limitations of quantum advice and one-way communication
S. Aaronson · 2004
Earlier work this paper cites.
The quantum query complexity of the hidden subgroup problem is polynomial
M. Ettinger, P. Høyer, and E. Knill · 2004
Earlier work this paper cites.
QMA/qpoly is contained in PSPACE/poly: de-Merlinizing quantum protocols
S. Aaronson · 2006
Earlier work this paper cites.
Universal quantum data compression via gentle tomography
C. H. Bennett, A. W. Harrow, and S. Lloyd · 2006
Earlier work this paper cites.
Calibrating noise to sensitivity in private data analysis
C. Dwork, F. McSherry, K. Nissim, and A. D. Smith · 2006
Earlier work this paper cites.
Quantum copy-protection and quantum money
S. Aaronson · 2009
Earlier work this paper cites.
On the complexity of differentially private data release: efficient algorithms and hardness results
Cynthia Dwork, Moni Naor, Omer Reingold, Guy N. Rothblum, and Salil P. Vadhan · 2009
Cited alongside, same era.
Boosting and differential privacy
C. Dwork, G. N. Rothblum, and S. P. Vadhan · 2010
Cited alongside, same era.
A multiplicative weights mechanism for privacy-preserving data analysis
M. Hardt and G. N. Rothblum · 2010
Cited alongside, same era.
Sequential decoding of a general classical-quantum channel
M. Wilde · 2013
Cited alongside, same era.
Fingerprinting codes and the price of approximate differential privacy
M. Bun, J. Ullman, and S. P. Vadhan · 2014
Cited alongside, same era.
Max-information, differential privacy, and post-selection hypothesis testing
R. M. Rogers, A. Roth, A. D. Smith, and O. Thakkar · 2016
Later among the works it cites.
Interactive fingerprinting codes and the hardness of preventing false discovery
T. Steinke and J. Ullman · 2016
Later among the works it cites.
Answering n 2+o(1) {}^{\mbox{2+o(1)}} counting queries with differential privacy is hard
J. Ullman · 2016
Later among the works it cites.
Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
Dan Boneh and Mark Zhandry · 2017
Later among the works it cites.
Exponential quantum speed-ups for semidefinite programming with applications to quantum learning
F. Brandão, A. Kalev, T. Li, C. Lin, K. Svore, and X. Wu · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
C. Dwork and A. Roth · 2014
Cited alongside, same era.
Preventing false discovery in interactive data analysis is hard
M. Hardt and J. Ullman · 2014
Cited alongside, same era.
Preventing false discovery in interactive data analysis is hard
M. Hardt and J. Ullman · 2014
Cited alongside, same era.
Generalization in adaptive data analysis and holdout reuse
C. Dwork, V. Feldman, M. Hardt, T. Pitassi, O. Reingold, and A. L. Roth · 2015
Cited alongside, same era.
Preserving statistical validity in adaptive data analysis
C. Dwork, V. Feldman, M. Hardt, T. Pitassi, O. Reingold, and A. L. Roth · 2015
Cited alongside, same era.
The complexity of quantum states and transformations: From quantum money to black holes, February 2016
S. Aaronson · 2016
Cited alongside, same era.
Algorithmic stability for adaptive data analysis
R. Bassily, K. Nissim, A. D. Smith, T. Steinke, U. Stemmer, and J. Ullman · 2016
Cited alongside, same era.
A. Harrow, C. Lin, and A. Montanaro · 2017
Later among the works it cites.
Privacy-preserving quantum machine learning using differential privacy
M. Senekane, M. Mafu, and B. Taele · 2017
Later among the works it cites.
Tight lower bounds for differentially private selection
Thomas Steinke and Jonathan Ullman · 2017
Later among the works it cites.
Privacy loss in Apple’s implementation of differential privacy on MacOS 10.12
J. Tang, A. Korolova, X. Bai, X. Wang, and X. Wang · 2017
Later among the works it cites.
The complexity of differential privacy
S. Vadhan · 2017
Later among the works it cites.
Differential privacy in quantum computation
L. Zhou and M. Ying · 2017
Later among the works it cites.
Shadow tomography of quantum states
S. Aaronson · 2018
Later among the works it cites.
Online learning of quantum states
S. Aaronson, X. Chen, E. Hazan, S. Kale, and A. Nayak · 2018
Later among the works it cites.
Hardness of non-interactive differential privacy from one-way functions
Lucas Kowalczyk, Tal Malkin, Jonathan Ullman, and Daniel Wichs · 2018
Later among the works it cites.
The limits of post-selection generalization
K. Nissim, A. D. Smith, T. Steinke, U. Stemmer, and J. Ullman · 2018
Later among the works it cites.