Our Data, Ourselves: Privacy Via Distributed Noise Generation
The DOI matches its Crossref record; 29 of the 31 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
“Differential privacy (DP) [26] is an alternative theoretical model for protecting the privacy of individual data, which has been widely applied to many areas, not only traditional algorithms, e.g., boosting [27], principal component analysis [15], support vector machine [86], but also deep learning research [1, 70]. It ensures that the addition or removal does not substantially affect the outcome”
From Federated Learning for Healthcare Informatics (2021) · cites this paper as [26]
In the citing paper
“The simplest way to create a DP-mechanism is by adding Gaussian noise to the outcomes of a deterministic function with bounded sensitivity 21 .”
From Federated Learning and Differential Privacy for Medical Image Analysis (2021) · cites this paper as [21]
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-citationThe Byzantine generals problem
Lamport, L., Shostak, R., & Pease, M. (1982) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357172.357176 · Cited by 6,023 · cited 1×
“We will refer to several well-known primitive building blocks for constructing distributed protocols: Byzantine Agreement [20], Distributed Coin Flipping [22], Verifiable Secret Sharing (VSS) [8], Non-Malleable VSS, and Secure Function Evaluation (SFE) [18].”
Goldreich, O., Micali, S., & Wigderson, A. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.28420 · Cited by 3,590
Protocols for secure computations
Yao, A. C. (1982) · 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982) · doi:10.1109/sfcs.1982.38 · Cited by 3,306
Privacy-preserving data mining
Agrawal, R., & Srikant, R. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335438 · Cited by 2,961
Protocols for secure computations
Yao, A. C.-C. (1982) · doi:10.1109/sfcs.1982.88 · Cited by 2,661
Goldreich, O. (2001) · Cambridge University Press eBooks · doi:10.1017/cbo9780511546891 · Cited by 2,181
Goldreich, O. (2004) · Cambridge University Press eBooks · doi:10.1017/cbo9780511721656 · Cited by 1,805
Foundations of Cryptography: Volume 2, Basic Applications
Goldreich, O. (2004) · Cited by 1,592
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 · cited 1×
“accurate statistics about a population while preserving the privacy of individuals [1, 2, 15, 11, 14, 5, 6, 4, 13].”
Cited by
Items 1,001–1,008 of 1,008
Privacy‐preserving constrained spectral clustering algorithm for large‐scale data sets
Ji, L., Wei, J., Ye, M., Liu, W., & Hu, X. (2019) · IET Information Security · doi:10.1049/iet-ifs.2019.0255 · Cited by 9
Differentially Private Graph Publishing and Randomized Response for Collaborative Filtering
Salas, J., & Torra, V. (2020) · International Joint Conference on e-Business and Telecommunications (ICETE) · doi:10.5220/0009833804150422 · Cited by 9
“Some variants and extensions have been provided for k-anonymity such as ` diversity (Machanavajjhala et al., 2007) and t-closeness approach (Li et al., 2007), as well as for ε-differential privacy (Desfontaines and Pejó, 2019), including (ε,δ)-differential privacy (Dwork et al., 2006).”
BackgroundDifferentially private high dimensional sparse covariance matrix estimation
Wang, D., & Xu, J. (2021) · Theoretical Computer Science · doi:10.1016/j.tcs.2021.03.001 · Cited by 18
A Method to Reveal Speaker Identity in Distributed ASR Training, and How to Counter IT
Dang, T., Thakkar, O. D., Ramaswamy, S., Mathews, R., Chin, P. S., & Beaufays, F. (2022) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp43922.2022.9746443 · Cited by 11
Simultaneous Discrimination Prevention and Privacy Protection in Data Publishing and Mining
Hajian, S. (2013) · Rovira & Virgili repository · doi:10.48550/arxiv.1306.6805 · Cited by 18
“There are alternative privacy measures which are extensions of -differentially privacy including ( , δ)-differentially privacy [19] and the crowd-blending privacy model [31].”
BackgroundEANA: Reducing Privacy Risk on Large-scale Recommendation Models
Ning, L., Chien, S., Song, S., Chen, M., Xue, Y., & Berlowitz, D. (2022) · Proceedings of the 16th ACM Conference on Recommender Systems · doi:10.1145/3523227.3546769 · Cited by 5
“When performing the secret sharer tests, we inject 1195000 canaries to the training examples, 1000 canaries for each number of occurrences in [1, 2, 3, 4, 5, 10, 20, 50, 100, 1000].”
BackgroundMethodInfluentialPerson identity shift for privacy-preserving person re-identification
Dou, S., Jiang, X., Zhao, Q., Wang, Y., Li, D., & Zhao, C. (2026) · Science China Information Sciences · doi:10.1007/s11432-023-4583-x · Cited by 2
“Training a model with ( ǫ , δ )-DP [36] can protect the privacy of all training examples, where ( ǫ , δ )-DP means that the probabilities of outputting a model M trained on two datasets D and D ′ that differ in a single example are close.”
Composition in Differential Privacy for General Granularity Notions
Guerra-Balboa, P., Miranda-Pascual, À., Parra-Arnau, J., & Strufe, T. (2024) · 2024 IEEE 37th Computer Security Foundations Symposium (CSF) · doi:10.1109/csf61375.2024.00004 · Cited by 1
Metadata
- Authors
- Dwork, C., Kenthapadi, K., McSherry, F., Mironov, I., & Naor, M.
- Affiliations
- Microsoft (United States) (US)
- Stanford University (US)
- Weizmann Institute of Science (IL)
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2006
- Pages
- 486-503
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1557833142
- Cited by
- 1,835
- References
- 31
- Citations by year
- 2026: 65 · 2025: 138 · 2024: 184 · 2023: 179 · 2022: 175 · 2021: 188 · 2020: 216 · 2019: 123 · 2018: 80 · 2017: 81 · 2016: 61 · 2015: 69 · 2014: 78 · 2013: 70 · 2012: 52
- FWCI
- 7.51
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Lecture notes in computer science (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security
- Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
- Physical Sciences › Computer Science › Information Systems › Cloud Data Security Solutions
- Keywords
- malicious security, verifiable secret sharing, Gaussian noise, exponential distribution, random bit generation, distributed protocols
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.