Computer Science – Databases
Scientific paper
2008-11-18
Computer Science
Databases
rewritten for clarity, typos corrected
Scientific paper
A mechanism for releasing information about a statistical database with sensitive data must resolve a trade-off between utility and privacy. Privacy can be rigorously quantified using the framework of {\em differential privacy}, which requires that a mechanism's output distribution is nearly the same whether or not a given database row is included or excluded. The goal of this paper is strong and general utility guarantees, subject to differential privacy. We pursue mechanisms that guarantee near-optimal utility to every potential user, independent of its side information (modeled as a prior distribution over query results) and preferences (modeled via a loss function). Our main result is: for each fixed count query and differential privacy level, there is a {\em geometric mechanism} $M^*$ -- a discrete variant of the simple and well-studied Laplace mechanism -- that is {\em simultaneously expected loss-minimizing} for every possible user, subject to the differential privacy constraint. This is an extremely strong utility guarantee: {\em every} potential user $u$, no matter what its side information and preferences, derives as much utility from $M^*$ as from interacting with a differentially private mechanism $M_u$ that is optimally tailored to $u$.
Ghosh Arpita
Roughgarden Tim
Sundararajan Mukund
No associations
LandOfFree
Universally Utility-Maximizing Privacy Mechanisms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Universally Utility-Maximizing Privacy Mechanisms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Universally Utility-Maximizing Privacy Mechanisms will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-100661