73 citations · 585 across the 58 of their papers we have counts for
1 paper · 2 filters
Mark Bun, Jonathan Ullman, Salil Vadhan
We show new lower bounds on the sample complexity of (ε,δ)-differentially private algorithms that accurately answer large sets of counting queries. A counting query on…