Boosting and Differential Privacy

DSpace/Manakin Repository

Boosting and Differential Privacy

Citable link to this page


Title: Boosting and Differential Privacy
Author: Dwork, Cynthia; Rothblum, Guy N.; Vadhan, Salil P.

Note: Order does not necessarily reflect citation order of authors.

Citation: Dwork, Cynthia, Guy N. Rothblum, and Salil Vadhan. 2010. Boosting and differential privacy. In Proceedings; 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS), Las Vegas, Nevada, 23-26 October 2010. Los Alamitos, CA: IEEE Computer Society.
Access Status: Full text of the requested work is not available in DASH at this time (“dark deposit”). For more information on dark deposits, see our FAQ.
Full Text & Related Files:
Abstract: Boosting is a general method for improving the accuracy of learning algorithms. We use boosting to construct improved privacy-preserving synopses of an input database. These are data structures that yield, for a given set \(Q\) of queries over an input database, reasonably accurate estimates of the responses to every query in \(Q\), even when the number of queries is much larger than the number of rows in the database. Given a base synopsis generator that takes a distribution on \(Q\) and produces a “weak” synopsis that yields “good” answers for a majority of the weight in \(Q\), our Boosting for Queries algorithm obtains a synopsis that is good for all of \(Q\). We ensure privacy for the rows of the database, but the boosting is performed on the queries. We also provide the first synopsis generators for arbitrary sets of arbitrary low- sensitivity queries, i.e., queries whose answers do not vary much under the addition or deletion of a single row.
In the execution of our algorithm certain tasks, each incurring some privacy loss, are performed many times. To analyze the cumulative privacy loss, we obtain an \(O(\varepsilon^2)\) bound on the expected privacy loss from a single \(\varepsilon\)-differentially private mechanism. Combining this with evolution of confidence arguments from the literature, we get stronger bounds on the expected cumulative privacy loss due to multiple mechanisms, each of which provides \(\varepsilon\)-differential privacy or one of its relaxations, and each of which operates on (potentially) different, adaptively chosen, databases.
Published Version: doi:10.1109/FOCS.2010.12
Other Sources:
Citable link to this page:
Downloads of this work:

Show full Dublin Core record

This item appears in the following Collection(s)


Search DASH

Advanced Search