Differential privacy is a framework to quantify to what extent individual privacy in a statistical database is preserved while releasing useful aggregate information about the database. In this paper, within the classes of mechanisms oblivious of the database and the queries beyond the global sensitivity, we characterize the fundamental tradeoff between privacy and utility in differential privacy, and derive the optimal ∈-differentially private mechanism for a single realvalued query function under a very general utility-maximization (or cost-minimization) framework. The class of noise probability distributions in the optimal mechanism has staircase-shaped probability density functions which are symmetric (around the origin), monotonically decreasing and geometrically decaying. The staircase mechanism can be viewed as a geometric mixture of uniform probability distributions, providing a simple algorithmic description for the mechanism. Furthermore, the staircase mechanism naturally generalizes to discrete query output settings as well as more abstract settings. We explicitly derive the parameter of the optimal staircase mechanism for ℓ1 and ℓ2 cost functions. Comparing the optimal performances with those of the usual Laplacian mechanism, we show that in the high privacy regime (∈ is small), the Laplacian mechanism is asymptotically optimal as ∈ → 0; in the low privacy regime (∈ is large), the minimum magnitude and second moment of noise are Θ(Δe(-∈/2)) and Θ(Δ2e(-2∈/3)) as ∈ → +∞, respectively, while the corresponding figures when using the Laplacian mechanism are Δ/∈ and 2Δ2/∈2, where Δ is the sensitivity of the query function. We conclude that the gains of the staircase mechanism are more pronounced in the moderate-low privacy regime.
- Data privacy
- Randomized algorithm
ASJC Scopus subject areas
- Information Systems
- Computer Science Applications
- Library and Information Sciences