Between Pure and Approximate Differential Privacy

We show a new lower bound on the sample complexity of (varepsilon, δ)-differentially private algorithms that accurately answer statistical queries on high-dimensional databases. The novelty of our bound is that it depends optimally on the parameter δ, which loosely corresponds to the probability that the algorithm fails to be private, and is the first to smoothly interpolate between approximate differential privacy (δ > 0) and pure differential privacy (δ = 0). Specifically, we consider a database D ∈ ±1n × d and its one-way marginals, which are the d queries of the form "What fraction of individual records have the i-th bit set to +1?" We show that in order to answer all of these queries to within error ± α (on average) while satisfying (varepsilon, δ)-differential privacy, it is necessary that n ≥ Omegaleft( frac√d log(1/δ)α varepsilon right), which is optimal up to constant factors. To prove our lower bound, we build on the connection between fingerprinting codes and lower bounds in differential privacy (Bun, Ullman, and Vadhan, STOC'14). In addition to our lower bound, we give new purely and approximately differentially private algorithms for answering arbitrary statistical queries that improve on the sample complexity of the standard Laplace and Gaussian mechanisms for achieving worst-case accuracy guarantees by a logarithmic factor.