Distributed private data analysis: Simultaneously solving how and what

108Citations
Citations of this article
68Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We examine the combination of two directions in the field of privacy concerning computations over distributed private inputs - secure function evaluation (SFE) and differential privacy. While in both the goal is to privately evaluate some function of the individual inputs, the privacy requirements are significantly different. The general feasibility results for SFE suggest a natural paradigm for implementing differentially private analyses distributively: First choose what to compute, i.e., a differentially private analysis; Then decide how to compute it, i.e., construct an SFE protocol for this analysis. We initiate an examination whether there are advantages to a paradigm where both decisions are made simultaneously. In particular, we investigate under which accuracy requirements it is beneficial to adapt this paradigm for computing a collection of functions including Binary Sum, Gap Threshold, and Approximate Median queries. Our results yield new separations between the local and global models of computations for private data analysis. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Beimel, A., Nissim, K., & Omri, E. (2008). Distributed private data analysis: Simultaneously solving how and what. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5157 LNCS, pp. 451–468). https://doi.org/10.1007/978-3-540-85174-5_25

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free