$Answering n^{2+o(1)} Counting Queries with Differential Privacy is Hard$

Answering n^{2+o(1)} Counting Queries with Differential Privacy is Hard

30 July 2012

Jonathan R. Ullman

Papers citing "Answering n^{2+o(1)} Counting Queries with Differential Privacy is Hard"

6 / 6 papers shown

Title
The Price of Selection in Differential Privacy Mitali Bafna Jonathan R. Ullman 73 30 0 09 Feb 2017
A Learning Theory Approach to Non-Interactive Database Privacy Avrim Blum Katrina Ligett Aaron Roth 70 550 0 10 Sep 2011
Iterative Constructions and Private Data Release Anupam Gupta Aaron Roth Jonathan R. Ullman 56 208 0 19 Jul 2011
Private Data Release via Learning Thresholds Moritz Hardt G. Rothblum Rocco A. Servedio 37 56 0 13 Jul 2011
Privately Releasing Conjunctions and the Statistical Query Barrier Anupam Gupta Moritz Hardt Aaron Roth Jonathan R. Ullman 69 148 0 04 Nov 2010
Interactive Privacy via the Median Mechanism Aaron Roth Tim Roughgarden 80 283 0 10 Nov 2009