SuLQ
Practical privacy: the SuLQ framework. We consider a statistical database in which a trusted administrator introduces noise to the query responses with the goal of maintaining privacy of individual database entries. In such a database, a query consists of a pair (S, f) where S is a set of rows in the database and f is a function mapping database rows to {0, 1}. The true answer is ΣiεS f(di), and a noisy version is released as the response to the query. Results of Dinur, Dwork, and Nissim show that a strong form of privacy can be maintained using a surprisingly small amount of noise -- much less than the sampling error -- provided the total number of queries is sublinear in the number of database rows. We call this query and (slightly) noisy reply the SuLQ (Sub-Linear Queries) primitive. The assumption of sublinearity becomes reasonable as databases grow increasingly large.We extend this work in two ways. First, we modify the privacy analysis to real-valued functions f and arbitrary row types, as a consequence greatly improving the bounds on noise required for privacy. Second, we examine the computational power of the SuLQ primitive. We show that it is very powerful indeed, in that slightly noisy versions of the following computations can be carried out with very few invocations of the primitive: principal component analysis, k means clustering, the Perceptron Algorithm, the ID3 algorithm, and (apparently!) all algorithms that operate in the in the statistical query learning model [11].
This software is also peer reviewed by journal TOMS.
This software is also peer reviewed by journal TOMS.
Keywords for this software
References in zbMATH (referenced in 119 articles )
Showing results 1 to 20 of 119.
Sorted by year (- Wang, Di; Xu, Jinhui: Principal component analysis in the local differential privacy model (2020)
- Bun, Mark; Nissim, Kobbi; Stemmer, Uri: Simultaneous private learning of multiple concepts (2019)
- Bun, Mark; Ullman, Jonathan; Vadhan, Salil: Fingerprinting codes and the price of approximate differential privacy (2018)
- Feldman, Vitaly; Perkins, Will; Vempala, Santosh: On the complexity of random satisfiability problems with planted solutions (2018)
- Beimel, Amos; Nissim, Kobbi; Stemmer, Uri: Private learning and sanitization: pure vs. approximate differential privacy (2016)
- Bun, Mark; Zhandry, Mark: Order-revealing encryption and the hardness of private learning (2016)
- Choromanska, Anna; Choromanski, Krzysztof; Jagannathan, Geetha; Monteleoni, Claire: Differentially-private learning of low dimensional manifolds (2016)
- Kowalczyk, Lucas; Malkin, Tal; Ullman, Jonathan; Zhandry, Mark: Strong hardness of privacy from weak traitor tracing (2016)
- Ullman, Jonathan: Answering (n^2+o(1)) counting queries with differential privacy is hard (2016)
- Wang, Ke; Wang, Peng; Fu, Ada Waichee; Wong, Raymond Chi-Wing: Generalized bucketization scheme for flexible privacy settings (2016)
- Balcan, Maria Florina; Feldman, Vitaly: Statistical active learning algorithms for noise tolerance and differential privacy (2015)
- Benkaouz, Yahya; Erradi, Mohammed: A distributed protocol for privacy preserving aggregation with non-permanent participants (2015)
- Feldman, Vitaly; Xiao, David: Sample complexity bounds on differentially private learning via communication complexity (2015)
- Ghosh, Arpita; Roth, Aaron: Selling privacy at auction (2015)
- Abraham, Ittai; Gavoille, Cyril; Gupta, Anupam; Neiman, Ofer; Talwar, Kunal: Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphs (2014)
- Agarwal, Pankaj K.; Sharathkumar, R.: Approximation algorithms for bipartite matching with metric and geometric costs (2014)
- Aggarwal, Divesh; Dodis, Yevgeniy; Lovett, Shachar: Non-malleable codes from additive combinatorics (extended abstract) (2014)
- Alistarh, Dan; Censor-Hillel, Keren; Shavit, Nir: Are lock-free concurrent algorithms practically wait-free? (2014)
- Andoni, Alexandr; Nikolov, Aleksandar; Onak, Krzysztof; Yaroslavtsev, Grigory: Parallel algorithms for geometric graph problems (2014)
- Artemenko, Sergei; Shaltiel, Ronen: Pseudorandom generators with optimal seed length for non-Boolean poly-size circuits (2014)