381 citations · 2.3k across the 89 of their papers we have counts for
4 papers · 1 filter
Fast Private Data Release Algorithms for Sparse Queries
Avrim Blum, Aaron Roth
We revisit the problem of accurately answering large classes of statistical queries while preserving differential privacy. Previous approaches to this problem have either been very…
Beating Randomized Response on Incoherent Matrices
Moritz Hardt, Aaron Roth
Computing accurate low rank approximations of large matrices is a fundamental data mining task. In many applications however the matrix contains sensitive information about individ…
A Learning Theory Approach to Non-Interactive Database Privacy
Avrim Blum, Katrina Ligett, Aaron Roth
In this paper we demonstrate that, ignoring computational constraints, it is possible to privately release synthetic databases that are useful for large classes of queries -- much…
Iterative Constructions and Private Data Release
Anupam Gupta, Aaron Roth, Jonathan Ullman
In this paper we study the problem of approximately releasing the cut function of a graph while preserving differential privacy, and give new algorithms (and new analyses of existi…