Fetching the paper…
Reading the bibliography…
We consider the problem of designing and analyzing differentially private algorithms that can be implemented on {\em discrete} models of computation in {\em strict} polynomial time, motivated by known attacks on floating point implementations of real-arithmetic differentially private algorithms (Mironov, CCS 2012) and the potential for timing attacks on expected polynomial-time algorithms.
Introduction to coding theory
Jacobus Hendricus van Lint · 1999
Earlier work this paper cites.
Our data, ourselves: Privacy via distributed noise generation
Cynthia Dwork, Krishnaram Kenthapadi, Frank McSherry, Ilya Mironov, and Moni Naor · 2006
Earlier work this paper cites.
Calibrating noise to sensitivity in private data analysis
Cynthia Dwork, Frank McSherry, Kobbi Nissim, and Adam Smith · 2006
Earlier work this paper cites.
Introduction to algorithms
Thomas H Cormen, Charles E Leiserson, Ronald L Rivest, and Clifford Stein · 2009
Earlier work this paper cites.
Differential privacy and robust statistics
Cynthia Dwork and Jing Lei · 2009
Earlier work this paper cites.
Releasing search queries and clicks privately
Aleksandra Korolova, Krishnaram Kenthapadi, Nina Mishra, and Alexandros Ntoulas · 2009
Earlier work this paper cites.
On the geometry of differential privacy
Moritz Hardt and Kunal Talwar · 2010
Earlier work this paper cites.
What can we learn privately?
Shiva Prasad Kasiviswanathan, Homin K Lee, Kobbi Nissim, Sofya Raskhodnikova, and Adam Smith · 2011
Earlier work this paper cites.
PCPs and the hardness of generating private synthetic data
Jonathan Ullman and Salil P. Vadhan · 2011
Earlier work this paper cites.
Submodular functions are noise stable
Mahdi Cheraghchi, Adam Klivans, Pravesh Kothari, and Homin K. Lee · 2012
Cited alongside, same era.
Differentially private summaries for sparse data
Graham Cormode, Cecilia Procopiuc, Divesh Srivastava, and Thanh T. L. Tran · 2012
Cited alongside, same era.
Universally utility-maximizing privacy mechanisms
Arpita Ghosh, Tim Roughgarden, and Mukund Sundararajan · 2012
Cited alongside, same era.
Iterative constructions and private data release
Anupam Gupta, Aaron Roth, and Jonathan Ullman · 2012
Cited alongside, same era.
Private data release via learning thresholds
Moritz Hardt, Guy N. Rothblum, and Rocco A. Servedio · 2012
Cited alongside, same era.
On significance of the least significant bits for differential privacy
Ilya Mironov · 2012
Cited alongside, same era.
Preserving differential privacy under finite-precision semantics
Ivan Gazeau, Dale Miller, and Catuscia Palamidessi · 2013
Later among the works it cites.
Joachim von zur Gathen and Jürgen Gerhard · 2013
Later among the works it cites.
Bounds on the sample complexity for private learning and private data release
Amos Beimel, Hai Brenner, Shiva Prasad Kasiviswanathan, and Kobbi Nissim · 2014
Later among the works it cites.
Faster private release of marginals on small databases
Karthekeyan Chandrasekaran, Justin Thaler, Jonathan Ullman, and Andrew Wan · 2014
Later among the works it cites.
Efficient algorithms for privately releasing marginals via convex relaxations
Cynthia Dwork, Aleksandar Nikolov, and Kunal Talwar · 2015
Later among the works it cites.
Simultaneous private learning of multiple concepts
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Faster algorithms for privately releasing marginals
Justin Thaler, Jonathan Ullman, and Salil Vadhan · 2012
Cited alongside, same era.
A learning theory approach to noninteractive database privacy
Avrim Blum, Katrina Ligett, and Aaron Roth · 2013
Cited alongside, same era.
Mark Bun, Kobbi Nissim, and Uri Stemmer · 2016
Later among the works it cites.
Priv’it: Private and sample efficient identity testing
Bryan Cai, Constantinos Daskalakis, and Gautam Kamath · 2017
Closest in time.
Differential privacy on finite computers
Victor Balcer and Salil Vadhan · 2018
Closest in time.