Smooth sensitivity and sampling in private data analysis
The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Abstract
We introduce a new, generic framework for private data analysis.The goal of private data analysis is to release aggregate information about a data set while protecting the privacy of the individuals whose information the data set contains.Our framework allows one to release functions f of the data withinstance-based additive noise. That is, the noise magnitude is determined not only by the function we want to release, but also bythe database itself. One of the challenges is to ensure that the noise magnitude does not leak information about the database. To address that, we calibrate the noise magnitude to the smoothsensitivity of f on the database x --- a measure of variabilityof f in the neighborhood of the instance x. The new frameworkgreatly expands the applicability of output perturbation, a technique for protecting individuals' privacy by adding a smallamount of random noise to the released statistics. To our knowledge, this is the first formal analysis of the effect of instance-basednoise in the context of data privacy.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Calibrating Noise to Sensitivity in Private Data Analysis
Dwork, C., McSherry, F., Nissim, K., & Smith, A. (2006) · Lecture Notes in Computer Science · doi:10.1007/11681878_14 · Cited by 7,272
Self-citationDwork, C. (2006) · Lecture Notes in Computer Science · doi:10.1007/11787006_1 · Cited by 5,291
Our Data, Ourselves: Privacy Via Distributed Noise Generation
Dwork, C., Kenthapadi, K., McSherry, F., Mironov, I., & Naor, M. (2006) · Lecture Notes in Computer Science · doi:10.1007/11761679_29 · Cited by 1,835
Kleinberg, J. M., & Eva Tardos, D. (2005) · Cited by 1,400
Towards Sharp Inapproximability For Any 2-CSP
Austrin, P. (2007) · 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) · doi:10.1109/focs.2007.41 · Cited by 1,294
Revealing information while preserving privacy
Dinur, I., & Nissim, K. (2003) · Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/773153.773173 · Cited by 980
Self-citationSecurity-control methods for statistical databases: a comparative study
Adam, N. R., & Worthmann, J. C. (1989) · ACM Computing Surveys · doi:10.1145/76894.76895 · Cited by 969
Tools for privacy preserving distributed data mining
Clifton, C., Kantarcioglu, M., Vaidya, J., Lin, X., & Zhu, M. Y. (2002) · ACM SIGKDD Explorations Newsletter · doi:10.1145/772862.772867 · Cited by 890
Limiting privacy breaches in privacy preserving data mining
Evfimievski, A., Gehrke, J., & Srikant, R. (2003) · Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/773153.773174 · Cited by 815
Practical privacy: the SuLQ framework
Blum, A., Dwork, C., McSherry, F., & Nissim, K. (2005) · Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/1065167.1065184 · Cited by 797
Self-citationAggregating inconsistent information
Ailon, N., Charikar, M., & Newman, A. (2008) · Journal of the ACM · doi:10.1145/1411509.1411513 · Cited by 630
A learning theory approach to non-interactive database privacy
Blum, A., Ligett, K., & Roth, A. (2008) · Proceedings of the fortieth annual ACM symposium on Theory of computing · doi:10.1145/1374376.1374464 · Cited by 505
Privacy, accuracy, and consistency too: a holistic solution to contingency table release
Barak, B., Chaudhuri, K., Dwork, C., Kale, S., McSherry, F., & Talwar, K. (2007) · Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/1265530.1265569 · Cited by 468
Privacy-Preserving Datamining on Vertically Partitioned Databases
Dwork, C., & Nissim, K. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-28628-8_32 · Cited by 348
Self-citationToward Privacy in Public Databases
Chawla, S., Dwork, C., McSherry, F., Smith, A., & Wee, H. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30576-7_20 · Cited by 264
Self-citationThe Effectiveness of Lloyd-Type Methods for the k-Means Problem
Ostrovsky, R., Rabani, Y., Schulman, L., & Swamy, C. (2006) · 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) · doi:10.1109/focs.2006.75 · Cited by 261
A spectral algorithm for learning mixture models
Vempala, S., & Wang, G. J. (2004) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(03)00180-6 · Cited by 216
Aggregating inconsistent information
Ailon, N., Charikar, M., & Newman, A. (2005) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1060590.1060692 · Cited by 187
A Two-round Variant of EM for Gaussian MixturesPreprint
Dasgupta, S., & Schulman, L. J. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.3850 · Cited by 141
When Random Sampling Preserves Privacy
Chaudhuri, K., & Mishra, N. (2006) · Lecture notes in computer science · doi:10.1007/11818175_12 · Cited by 101
Optimal Time Bounds for Approximate Clustering
Mettu, R. R., & Plaxton, C. G. (2004) · Machine Learning · doi:10.1023/b:mach.0000033114.18632.e0 · Cited by 100
On the Utility of Privacy-Preserving Histograms
Chawla, S., Dwork, C., McSherry, F., & Talwar, K. (2004) · Cited by 25
31st Conference on Uncertainty in Artificial Intelligence (UAI 2015)
Georgatzis, K., & Williams, C. K. I. (2015) · Cited by 18
Cited by
The Algorithmic Foundations of Differential Privacy
Dwork, C., & Roth, A. (2013) · doi:10.1561/9781601988195 · Cited by 3,856
Differential Privacy: A Survey of Results
Dwork, C. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-79228-4_1 · Cited by 3,542
“Over the past five years a new approach to privacy-preserving data analysis has born fruit [13, 18, 7, 19, 5, 37, 35, 8, 32].”
Towards Sharp Inapproximability For Any 2-CSP
Austrin, P. (2007) · 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) · doi:10.1109/focs.2007.41 · Cited by 1,294
(2011) · PubMed · Cited by 990
Kasiviswanathan, S. P., Lee, H. K., Nissim, K., Raskhodnikova, S., & Smith, A. (2011) · SIAM Journal on Computing · doi:10.1137/090756090 · Cited by 898
“A recent line of work, initiated by Dinur and Nissim [15] and called private data analysis, seeks to place data privacy on firmer theoretical foundations and has been successful at formulating a strong, yet attainable privacy definition.”
Self-citation
Metadata
- Authors
- Nissim, K., Raskhodnikova, S., & Smith, A.
- Venue
- Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
- Publisher
- ACM
- Published
- 2007-06-11
- Pages
- 75-84
- OpenAlex
- W2101771965
- Cited by
- 974
- References
- 23
- FWCI
- 15.18
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.