Computer Science – Cryptography and Security
Scientific paper
2009-11-10
Computer Science
Cryptography and Security
Appeared in STOC 2010
Scientific paper
We define a new interactive differentially private mechanism -- the median mechanism -- for answering arbitrary predicate queries that arrive online. Relative to fixed accuracy and privacy constraints, this mechanism can answer exponentially more queries than the previously best known interactive privacy mechanism (the Laplace mechanism, which independently perturbs each query result). Our guarantee is almost the best possible, even for non-interactive privacy mechanisms. Conceptually, the median mechanism is the first privacy mechanism capable of identifying and exploiting correlations among queries in an interactive setting. We also give an efficient implementation of the median mechanism, with running time polynomial in the number of queries, the database size, and the domain size. This efficient implementation guarantees privacy for all input databases, and accurate query results for almost all input databases. The dependence of the privacy on the number of queries in this mechanism improves over that of the best previously known efficient mechanism by a super-polynomial factor, even in the non-interactive setting.
Roth Aaron
Roughgarden Tim
No associations
LandOfFree
Interactive Privacy via the Median Mechanism 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 Interactive Privacy via the Median Mechanism, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Interactive Privacy via the Median Mechanism will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-50841