Our data, ourselves: privacy via distributed noise generation
Cynthia Dwork,Krishnaram Kenthapadi,Frank McSherry,Ilya Mironov,Moni Naor +4 more
- Vol. 4004, pp 486-503
TLDR
In this paper, a distributed protocol for generating shares of random noise, secure against malicious participants, was proposed, where the purpose of the noise generation is to create a distributed implementation of the privacy-preserving statistical databases described in recent papers.Abstract:
In this work we provide efficient distributed protocols for generating shares of random noise, secure against malicious participants. The purpose of the noise generation is to create a distributed implementation of the privacy-preserving statistical databases described in recent papers [14,4,13]. In these databases, privacy is obtained by perturbing the true answer to a database query by the addition of a small amount of Gaussian or exponentially distributed random noise. The computational power of even a simple form of these databases, when the query is just of the form ∑if(di), that is, the sum over all rows i in the database of a function f applied to the data in row i, has been demonstrated in [4]. A distributed implementation eliminates the need for a trusted database administrator.
The results for noise generation are of independent interest. The generation of Gaussian noise introduces a technique for distributing shares of many unbiased coins with fewer executions of verifiable secret sharing than would be needed using previous approaches (reduced by a factor of n). The generation of exponentially distributed noise uses two shallow circuits: one for generating many arbitrarily but identically biased coins at an amortized cost of two unbiased random bits apiece, independent of the bias, and the other to combine bits of appropriate biases to obtain an exponential distribution.read more
Citations
More filters
Posted Content
Haze: Privacy-Preserving Real-Time Traffic Statistics
TL;DR: The model and general approach of Haze, a system for traffic-update applications that supports the creation of traffic statistics from user reports while protecting the privacy of the users is introduced.
Book ChapterDOI
Ask a better question, get a better answer a new approach to private data analysis
TL;DR: A new perspective has been brought to the development of a powerful approach to private data analysis, founded on precise mathematical definitions, and yielding algorithms with provable, meaningful, privacy guarantees.
Proceedings ArticleDOI
The Challenges of Effectively Anonymizing Network Data
TL;DR: The extensive work done on micro- data anonymity provides the network research community with several useful insights about how to effectively apply anonymization to published data, including the development of appropriate privacy and utility definitions for the more complex case of network data.
Book ChapterDOI
Privacy-Preserving Data Mining: A Survey
Charu C. Aggarwal,Philip S. Yu +1 more
TL;DR: This paper provides a review of the state-of-the-art methods for privacy, including methods for randomization, k-anonymization, and distributed privacy-preserving data mining, and the computational and theoretical limits associated with privacy- Preserving over high dimensional data sets.
Proceedings Article
Locally Private Mean Estimation: Z-test and Tight Confidence Intervals
TL;DR: This work provides tight upper- and lower-bounds for the problem of mean estimation under differential privacy in the local-model, when the input is composed of n i.i.d. drawn samples from a Gaussian.
References
More filters
Book ChapterDOI
Calibrating noise to sensitivity in private data analysis
TL;DR: In this article, the authors show that for several particular applications substantially less noise is needed than was previously understood to be the case, and also show the separation results showing the increased value of interactive sanitization mechanisms over non-interactive.
Journal ArticleDOI
The Byzantine Generals Problem
TL;DR: The Albanian Generals Problem as mentioned in this paper is a generalization of Dijkstra's dining philosophers problem, where two generals have to come to a common agreement on whether to attack or retreat, but can communicate only by sending messengers who might never arrive.
Book ChapterDOI
The Byzantine generals problem
TL;DR: In this article, a group of generals of the Byzantine army camped with their troops around an enemy city are shown to agree upon a common battle plan using only oral messages, if and only if more than two-thirds of the generals are loyal; so a single traitor can confound two loyal generals.
Journal Article
Calibrating noise to sensitivity in private data analysis
TL;DR: The study is extended to general functions f, proving that privacy can be preserved by calibrating the standard deviation of the noise according to the sensitivity of the function f, which is the amount that any single argument to f can change its output.
Proceedings ArticleDOI
How to play ANY mental game
TL;DR: This work presents a polynomial-time algorithm that, given as a input the description of a game with incomplete information and any number of players, produces a protocol for playing the game that leaks no partial information, provided the majority of the players is honest.