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].”
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 · cited 1×
“accurate statistics about a population while preserving the privacy of individuals [1, 2, 15, 11, 14, 5, 6, 4, 13].”
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 · cited 1×
“accurate statistics about a population while preserving the privacy of individuals [1, 2, 15, 11, 14, 5, 6, 4, 13].”
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 · cited 6×
“A slightly different definition of privacy was used in [14, 4].”
InfluentialSelf-citationVerifiable secret sharing and achieving simultaneity in the presence of faults
Chor, B., Goldwasser, S., Micali, S., & Awerbuch, B. (1985) · 26th Annual Symposium on Foundations of Computer Science (sfcs 1985) · doi:10.1109/sfcs.1985.64 · Cited by 771 · cited 4×
“A nonmalleable VSS scheme ensures that the values shared by a non-faulty processor are completely independent of the values shared by the other processors; even exact copying is prevented.”
InfluentialNisan, N., & Zuckerman, D. (1996) · Journal of Computer and System Sciences · doi:10.1006/jcss.1996.0004 · Cited by 634 · cited 1×
“A randomness extractor [21] is a method of converting a non-uniform input distribution into a near-uniform distribution on a smaller set.”
Rabin, M. O. (1983) · 24th Annual Symposium on Foundations of Computer Science (sfcs 1983) · doi:10.1109/sfcs.1983.48 · Cited by 589 · 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].”
Damgård, I., Fitzi, M., Kiltz, E., Nielsen, J. B., & Toft, T. (2006) · Lecture Notes in Computer Science · doi:10.1007/11681878_15 · Cited by 443 · cited 1×
“[10], which requires n sharings and two multiplications per coin.”
The bit extraction problem or t-resilient functions
Chor, B., Goldreich, O., Hasted, J., Freidmann, J., Rudich, S., & Smolensky, R. (1985) · 26th Annual Symposium on Foundations of Computer Science (sfcs 1985) · doi:10.1109/sfcs.1985.55 · Cited by 361 · cited 1×
“without Y ) for sources with a special structure [7, 9, 24, 19, 16] where the randomness is concentrated on k bits and the rest are fixed.”
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 · cited 3×
“A slightly different definition of privacy was used in [14, 4].”
Self-citationRECENT DEVELOPMENTS IN EXPLICIT CONSTRUCTIONS OF EXTRACTORS
SHALTIEL, R. (2004) · Current Trends in Theoretical Computer Science · doi:10.1142/9789812562494_0013 · Cited by 291 · cited 1×
“Optimal extractors can extract n = δ − 2 log(1/ ) + O(1) nearly-random bits with the seed length O(log |X |) (see [23] for many constructions matching the bound).”
Toward 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 · cited 1×
“accurate statistics about a population while preserving the privacy of individuals [1, 2, 15, 11, 14, 5, 6, 4, 13].”
Self-citationExtracting randomness from samplable distributions
Trevisan, L., & Vadhan, S. (2002) · Proceedings 41st Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892063 · Cited by 192 · cited 1×
“without Y ) for sources with a special structure [7, 9, 24, 19, 16] where the randomness is concentrated on k bits and the rest are fixed.”
Dispersers, deterministic amplification, and weak random sources
Cohen, A., & Wigderson, A. (1989) · 30th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1989.63449 · Cited by 182
Digital signets: self-enforcing protection of digital information (preliminary version)
Dwork, C., Lotspiech, J. B., & Naor, M. (1996) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/237814.237997 · Cited by 88
Self-citationDeterministic Extractors for Bit‐Fixing Sources by Obtaining an Independent Seed
Gabizon, A., Raz, R., & Shaltiel, R. (2006) · SIAM Journal on Computing · doi:10.1137/s0097539705447049 · Cited by 73 · cited 3×
“without Y ) for sources with a special structure [7, 9, 24, 19, 16] where the randomness is concentrated on k bits and the rest are fixed.”
Deterministic extractors for bit-fixing sources and exposure-resilient cryptography
Kamp, J., & Zuckerman, D. (2004) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2003.1238184 · Cited by 57 · cited 1×
“without Y ) for sources with a special structure [7, 9, 24, 19, 16] where the randomness is concentrated on k bits and the rest are fixed.”
Deterministic Extractors for Bit-Fixing Sources by Obtaining an Independent Seed
Gabizon, A., Raz, R., & Shaltiel, R. (2004) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2004.21 · Cited by 27
On the Utility of Privacy-Preserving Histograms
Chawla, S., Dwork, C., McSherry, F., & Talwar, K. (2004) · Cited by 25
Self-citationDistributed pseudo-random bit generators---a new way to speed-up shared coin tossing
Bellare, M., Garay, J. A., & Rabin, T. (1996) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/248052.248090 · Cited by 15 · cited 3×
“The techniques in [3] complement ours; see Section 5.”
Influential
Cited by
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
“On the other hand, in the centralized setup where all the users’ data is already assumed to be held by a single entity and hence no communication is required, trade-offs between accuracy and privacy have been extensively studied in central DP starting with the foundational work of [147, 146].”
BackgroundDeep 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
“Differential privacy for repeated applications of additivenoise mechanisms follows from the basic composition theorem [19, 20], or from advanced composition theorems and their refinements [24, 34, 23, 11].”
BackgroundSelf-citationPractical Secure Aggregation for Privacy-Preserving Machine Learning
Bonawitz, K., Ivanov, V., Kreuter, B., Marcedone, A., McMahan, H. B., Patel, S., Ramage, D., Segal, A., & Seth, K. (2017) · Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3133956.3133982 · Cited by 3,956
The Algorithmic Foundations of Differential Privacy
Dwork, C., & Roth, A. (2013) · doi:10.1561/9781601988195 · Cited by 3,856
Self-citationDifferential 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
Self-citation
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.