Calibrating Noise to Sensitivity in Private Data Analysis
The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“The evaluation of MAML algorithms for supervised tasks is largely focused on synthetic image classification problems [290, 386] in which infinite artificial tasks can be constructed by subsampling from classes of images.”
From Advances and Open Problems in Federated Learning (2021) · cites this paper as [290]
In the citing paper
“Hence, Laplace noises [197] are added to these possibly exposed training data for enhancing the training data privacy assurance.”
From Convergence of Edge Computing and Deep Learning: A Comprehensive Survey (2020) · cites this paper as [197]
In the citing paper
“Differential privacy (DP) [13,14] is a well-established notion of privacy that offers strong guarantees on the privacy of individual records in the training dataset.”
From Extracting Training Data from Large Language Models (2020) · cites this paper as [13]
In the citing paper
“We identify several memorized URLs that originated from the leaked Podesta Emails available on WikiLeaks 13 .”
From Extracting Training Data from Large Language Models (2020) · cites this paper as [13]
In the citing paper
“Then, based on Laplace mechanism [9], the independent zero-mean Laplace noise with scale 2 √ N -1 / ϵ is added to each ˆ X i,j,k for i ∈ { 1 , 2 , . . . , L f } and j ∈ { 1 , 2 , . . . , W f } to protect X i,j,k under ϵ -differential privacy.”
From Privacy-Preserving Blockchain-Based Federated Learning for IoT Devices (2021) · cites this paper as [9]
3 more claims about this paper
Create a free account to see every claim other papers make about this one.
Citations
Cites
k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
SWEENEY, L. (2002) · International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems · doi:10.1142/s0218488502001648 · Cited by 8,571
Privacy-preserving data mining
Agrawal, R., & Srikant, R. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335438 · Cited by 2,961
Goldwasser, S., & Micali, S. (1984) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(84)90070-9 · Cited by 2,603
Privacy-preserving data mining
Agrawal, R., & Srikant, R. (2000) · Proceedings of the 2000 ACM SIGMOD international conference on Management of data · doi:10.1145/342009.335438 · Cited by 1,719
On the design and quantification of privacy preserving data mining algorithms
Agrawal, D., & Aggarwal, C. C. (2001) · Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/375551.375602 · Cited by 1,006
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
Security-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
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-citationPrivacy-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-citationSecure statistical databases with random sample queries
Denning, D. E. (1980) · ACM Transactions on Database Systems · doi:10.1145/320613.320616 · Cited by 204
Some 3CNF properties are hard to test
Ben‐Sasson, E., Harsha, P., & Raskhodnikova, S. (2003) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/780542.780594 · Cited by 26
On the Utility of Privacy-Preserving Histograms
Chawla, S., Dwork, C., McSherry, F., & Talwar, K. (2004) · Cited by 25
Self-citation31st Conference on Uncertainty in Artificial Intelligence (UAI 2015)
Georgatzis, K., & Williams, C. K. I. (2015) · Cited by 18
Research works printed but not linked: 2
- Web page for the Bertinoro CS-Statistics workshop on privacy and confidentiality (July 2005), Available from, http://www.stat.cmu.edu/~hwainer
- Doctoral Dissertation
Cited by
Machine learning: Trends, perspectives, and prospects
Jordan, M. I., & Mitchell, T. M. (2015) · Science · doi:10.1126/science.aaa8415 · Cited by 9,955
Advances and Open Problems in Federated Learning
Kairouz, P., & McMahan, H. B. (2021) · Foundations and Trends in Machine Learning · doi:10.1561/2200000083 · Cited by 7,772
Deep Learning with Differential Privacy
Abadi, M., Chu, A., Goodfellow, I., McMahan, H. B., Mironov, I., Talwar, K., & Zhang, L. (2016) · Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2976749.2978318 · Cited by 6,578
Federated learning: Challenges, methods, and future directions
Li, T., Sahu, A. K., Talwalkar, A., & Smith, V. (2020) · IEEE Signal Processing Magazine · doi:10.1109/msp.2020.2975749 · Cited by 6,210
Dwork, C. (2006) · Lecture Notes in Computer Science · doi:10.1007/11787006_1 · Cited by 5,291
Self-citation
Metadata
- Authors
- Dwork, C., McSherry, F., Nissim, K., & Smith, A.
- Affiliations
- Microsoft (United States) (US)
- Weizmann Institute of Science (IL)
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2006
- Pages
- 265-284
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1873763122
- Cited by
- 7,272
- References
- 15
- Citations by year
- 2026: 443 · 2025: 656 · 2024: 692 · 2023: 598 · 2022: 601 · 2021: 795 · 2020: 740 · 2019: 531 · 2018: 421 · 2017: 342 · 2016: 287 · 2015: 253 · 2014: 214 · 2013: 222 · 2012: 178
- FWCI
- 25.16
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Lecture notes in computer science (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
- Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security
- Physical Sciences › Computer Science › Information Systems › Cloud Data Security Solutions
- Keywords
- differential privacy, noise calibration, sensitivity, separation results, trusted server
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.