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
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-citationRAPPOR: Randomized Aggregatable Privacy-Preserving Ordinal Response
Erlingsson, Ú., Pihur, V., & Korolova, A. (2014) · Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2660267.2660348 · Cited by 1,838
“The work of [11] approaches the challenge of eliminating the need for a trusted aggregator with a distributed solu-tion that places trust in other clients instead.”
BackgroundFederated Learning for Healthcare Informatics
Xu, J., Glicksberg, B. S., Su, C., Walker, P., Bian, J., & Wang, F. (2021) · Journal of Healthcare Informatics Research · doi:10.1007/s41666-020-00082-4 · Cited by 1,542
“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.”
BackgroundFederated Learning for Healthcare Informatics
Xu, J., Glicksberg, B. S., Su, C., Walker, P., Bian, J., & Wang, F. (2019) · arXiv · doi:10.48550/arxiv.1911.06270 · Cited by 1,538
“The presence of a non-zero δ allows us to relax the strict relative shift in unlikely events [35].”
BackgroundInfluentialMironov, I. (2017) · 2017 IEEE 30th Computer Security Foundations Symposium (CSF) · doi:10.1109/csf.2017.11 · Cited by 1,255
“The first application of ( , δ)-differential privacy was analysis of the Gaussian noise mechanism [2].”
BackgroundSelf-citationPrivacy integrated queries: an extensible platform for privacy-preserving data analysis
McSherry, F. D. (2009) · Proceedings of the 2009 ACM SIGMOD International Conference on Management of data · doi:10.1145/1559845.1559850 · Cited by 1,124
Self-citationSmooth sensitivity and sampling in private data analysis
Nissim, K., Raskhodnikova, S., & Smith, A. (2007) · Proceedings of the thirty-ninth annual ACM symposium on Theory of computing · doi:10.1145/1250790.1250803 · Cited by 974
A Hybrid Approach to Privacy-Preserving Federated Learning
Truex, S., Baracaldo, N., Anwar, A., Steinke, T., Ludwig, H., Zhang, R., & Zhou, Y. (2019) · Proceedings of the 12th ACM Workshop on Artificial Intelligence and Security · doi:10.1145/3338501.3357370 · Cited by 1,029
(2011) · PubMed · Cited by 990
A survey of unsupervised deep domain adaptation
Wilson, G., & Cook, D. J. (2020) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/3400066 · Cited by 987
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.”
Boosting and Differential Privacy
Dwork, C., Rothblum, G. N., & Vadhan, S. (2010) · 2010 IEEE 51st Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2010.12 · Cited by 784
“Definition II.2 ((e, δ)-Differential Privacy [ 8 ]).”
BackgroundInfluentialSelf-citationConcentrated Differential Privacy: Simplifications, Extensions, and Lower Bounds
Bun, M., & Steinke, T. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-53641-4_24 · Cited by 584
Private Empirical Risk Minimization: Efficient Algorithms and Tight Error Bounds
Bassily, R., Smith, A., & Thakurta, A. (2014) · 2014 IEEE 55th Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2014.56 · Cited by 621
“A randomized algorithm A is (, δ)differentially private ([17] [16]) if, for all neighboring data sets D and D and for all events S in the output space of A, we Algorithms that satisfy differential privacy for 1 and δ 1/n provide meaningful privacy guarantees, even in the presence of side…”
BackgroundDifferentially private recommender systems: Building privacy into the Netflix Prize contenders
McSherry, F., & Mironov, I. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557090 · Cited by 664
Self-citationKifer, D., & Machanavajjhala, A. (2011) · Proceedings of the 2011 ACM SIGMOD International Conference on Management of data · doi:10.1145/1989323.1989345 · Cited by 619
“Since then, many additional variations of differential privacy have been proposed [9, 4, 29, 2, 23, 20, 28].”
BackgroundDifferential privacy and robust statistics
Dwork, C., & Lei, J. (2009) · Proceedings of the forty-first annual ACM symposium on Theory of computing · doi:10.1145/1536414.1536466 · Cited by 611
Self-citationDifferential privacy under continual observation
Dwork, C., Naor, M., Pitassi, T., & Rothblum, G. N. (2010) · Proceedings of the forty-second ACM symposium on Theory of computing · doi:10.1145/1806689.1806787 · Cited by 583
“The one exception considers a distributed setting, in which each data holder controls her own data and decides in which analyses to participate [10].”
BackgroundSelf-citationPrivacy-Preserving Blockchain-Based Federated Learning for IoT Devices
Zhao, Y., Zhao, J., Jiang, L., Tan, R., Niyato, D., Li, Z., Lyu, L., & Liu, Y. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2020.3017377 · Cited by 613
“DP guarantees the privacy and utility of a data set with rigorous theoretical foundation [9], [10].”
BackgroundDong, J., Roth, A., & Su, W. J. (2022) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/rssb.12454 · Cited by 374
Privacy and Robustness in Federated Learning: Attacks and Defenses
Lyu, L., Yu, H., Ma, X., Chen, C., Sun, L., Zhao, J., Yang, Q., & Yu, P. S. (2024) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2022.3216981 · Cited by 548
“The notion of DDP reflects the fact that the required level of noise in the target statistic is sourced from multiple participants [115].”
BackgroundDifferentially private aggregation of distributed time-series with transformation and encryption
Rastogi, V., & Nath, S. (2010) · Proceedings of the 2010 ACM SIGMOD International Conference on Management of data · doi:10.1145/1807167.1807247 · Cited by 534
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
“Categories and Subject Descriptors F.2 [Theory of Computation]: Analysis of Algorithms and Problem Complexity General Terms Algorithms, Security, Theory Keywords non-interactive database privacy, learning theory”
Privacy‐preserving federated learning based on multi‐key homomorphic encryption
Ma, J., Naas, S., Sigg, S., & Lyu, X. (2022) · International Journal of Intelligent Systems · doi:10.1002/int.22818 · Cited by 421
“To address this weakness and to enhance the privacy protection of federated learning, cryptographic methods have been proposed, such as multi-party computation [26], differential privacy [27, 28, 29], as well as homomorphic encryption [30], to protect the shared model updates.”
MethodA General Survey of Privacy-Preserving Data Mining Models and Algorithms
Aggarwal, C. C., & Yu, P. S. (2008) · Advances in Database Systems · doi:10.1007/978-0-387-70992-5_2 · Cited by 469
Li, X., Gu, Y., Dvornek, N., Staib, L. H., Ventola, P., & Duncan, J. S. (2020) · Medical Image Analysis · doi:10.1016/j.media.2020.101765 · Cited by 480
Synthetic Data for Deep Learning
Nikolenko, S. I. (2021) · Springer Optimization and Its Applications · doi:10.1007/978-3-030-75178-4 · Cited by 423
“The basic approach to achieving differential privacy is to add noise to the output of A; many classical works on the subject focus on estimating and reducing the amount of noise necessary to ensure privacy under various assumptions [160–163,361].”
BackgroundFederated Learning and Differential Privacy for Medical Image Analysis
Adnan, M., Kalra, S., Cresswell, J. C., Taylor, G. W., & Tizhoosh, H. (2021) · doi:10.21203/rs.3.rs-1005694/v1 · Cited by 464
“The simplest way to create a DP-mechanism is by adding Gaussian noise to the outcomes of a deterministic function with bounded sensitivity 21 .”
BackgroundLocal, Private, Efficient Protocols for Succinct Histograms
Bassily, R., & Smith, A. (2015) · Proceedings of the forty-seventh annual ACM symposium on Theory of Computing · doi:10.1145/2746539.2746632 · Cited by 315
“In fact, it is standard to assume that δ = o ( 1 n ) , say δ ≈ 1 n γ , γ ≥ 2 , since otherwise there are trivial examples of algorithms that are clearly non-private yet they satisfy the definition ( (cid:15), δ ) differential privacy (for example, see [6, Example 2]).”
BackgroundTechnical Privacy Metrics: A Systematic Survey
Wagner, I., & Eckhoff, D. (2019) · ACM Computing Surveys · doi:10.1145/3168389 · Cited by 346
“Approximate differential privacy relaxes differential privacy by allowing an additional small additive constant δ [Dwork et al. 2006].”
BackgroundDifferential Privacy for Deep and Federated Learning: A Survey
Ouadrhiri, A. E., & Abdelhadi, A. (2022) · IEEE Access · doi:10.1109/access.2022.3151670 · Cited by 445
“LDP was implicitly introduced in [38], [50] and first formalized in [37].”
BackgroundMethodInfluentialCalibrating Noise to Sensitivity in Private Data Analysis
Dwork, C., McSherry, F., Nissim, K., & Smith, A. (2017) · Journal of Privacy and Confidentiality · doi:10.29012/jpc.v7i3.405 · Cited by 390
Self-citationProtection Against Reconstruction and Its Applications in Private Federated Learning
Bhowmick, A., Duchi, J. C., Freudiger, J., Kapoor, G., & Rogers, R. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1812.00984 · Cited by 240
“Nonetheless, we discuss three briefly in turn: R´enyi [59], concentrated [33, 21], and approximate differential privacy [34].”
BackgroundLDP-Fed: federated learning with local differential privacy
Truex, S., Liu, L., Chow, K.-H., Gursoy, M. E., & Wei, W. (2020) · Proceedings of the Third ACM International Workshop on Edge Systems, Analytics and Networking · doi:10.1145/3378679.3394533 · Cited by 435
“Additional protocols allow users to leverage such cryptographic techniques to decrease the scale of noise [7, 10, 23].”
BackgroundAiravat: security and privacy for MapReduce
Roy, I., Setty, S., Kilzer, A., Shmatikov, V., & Witchel, E. (2010) · doi:10.5555/1855711.1855731 · Cited by 393
Composition attacks and auxiliary information in data privacy
Ganta, S. R., Kasiviswanathan, S. P., & Smith, A. (2008) · Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1401890.1401926 · Cited by 395
“The proof that relaxed definitions (and hence the schemes of [13, 29, 25]) satisfy the Bayesian formulation is new.”
BackgroundMethodResultInfluentialExtremal mechanisms for local differential privacy
KairouzPeter, OhSewoong, & ViswanathPramod (2016) · Journal of Machine Learning Research · doi:10.5555/2946645.2946662 · Cited by 92
Yang, Q., Liu, Y., Cheng, Y., Kang, Y., Chen, T., & Yu, H. (2019) · Synthesis lectures on artificial intelligence and machine learning · doi:10.2200/s00960ed2v01y201910aim043 · Cited by 261
Measuring Large-Scale Social Networks with High Resolution
Stopczynski, A., Sekara, V., Sapiezynski, P., Cuttone, A., Madsen, M. M., Larsen, J. E., & Lehmann, S. (2014) · PLoS ONE · doi:10.1371/journal.pone.0095978 · Cited by 409
The composition theorem for differential privacy
Kairouz, P., Oh, S., & Viswanath, P. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2685505 · Cited by 408
Privacy preservation in federated learning: An insightful survey from the GDPR perspective
Truong, N., Sun, K., Wang, S., Guitton, F., & Guo, Y. (2021) · Computers & Security · doi:10.1016/j.cose.2021.102402 · Cited by 399
“onymity-based methods calls for different approaches that offer rigorous privacy-guarantee such as differential privacy. 2) Differential Privacy Proposed by Dwork et al. in 2006, differential privacy [38] is an advanced solution of the perturbation privacy/preserving technique in which random noise is added to true ou…”
BackgroundMethodInfluentialDong, J., Roth, A., & Su, W. J. (2019) · arXiv · doi:10.48550/arxiv.1905.02383 · Cited by 389
I Have a DREAM! (DiffeRentially privatE smArt Metering)
Ács, G., & Castelluccia, C. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-24178-9_9 · Cited by 388
“Three closely related works to ours are [17,20,6].”
BackgroundBroadening the Scope of Differential Privacy Using Metrics
Chatzikokolakis, K., Andrés, M. E., Bordenabe, N. E., & Palamidessi, C. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-39077-7_5 · Cited by 340
“An approximate version of d X -privacy can be defined, similarly to ( α, δ ) differential privacy [13].”
BackgroundcpSGD: Communication-efficient and differentially-private distributed SGD
Agarwal, N., Suresh, A. T., Yu, F., Kumar, S., & McMahan, H. B. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1805.10559 · Cited by 180
“Previous analysis of the Binomial mechanism (where you add noise Bin(N, p)) was due to [12], who analyzed the 1-dimensional case for p = 1/2 and showed that to achieve (", ) differential privacy, N needs to be 64 log(2/ )/"2.”
MethodKasiviswanathan, S. P., Lee, H. K., Nissim, K., Raskhodnikova, S., & Smith, A. (2008) · 2008 49th Annual IEEE Symposium on Foundations of Computer Science · doi:10.1109/focs.2008.27 · Cited by 334
On the geometry of differential privacy
Hardt, M., & Talwar, K. (2010) · Proceedings of the forty-second ACM symposium on Theory of computing · doi:10.1145/1806689.1806786 · Cited by 314
“When it comes to approximate privacy, the Gaussian mechanism [8] shows that for any mapping F : R → R of sensitivity d there exists a δ-approximate -differentially private mechanism M with err(M,F ) = O(d p log(1/δ)/ ).”
BackgroundDifferentially Private Filtering
Le Ny, J., & Pappas, G. J. (2014) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2013.2283096 · Cited by 341
Differentially Private Data Publishing and Analysis: A Survey
Zhu, T., Li, G., Zhou, W., & Yu, P. S. (2017) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2017.2697856 · Cited by 330
“[9] A randomized mechanism M gives ð ; dÞ-differential privacy for every set of outputs V, and for any neighbouring datasets of D and D0, if M satisfies”
BackgroundRényi Differential Privacy of the Sampled Gaussian Mechanism
Mironov, I., Talwar, K., & Zhang, L. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1908.10530 · Cited by 79
“The notion of approximate differential privacy, which includes an additive δ term, appeared in the work by Dwork et al. [DKM + 06] in order to support analysis of the Gaussian noise mechanism.”
MethodSelf-citationDifferential Privacy and Machine Learning: a Survey and Review
Ji, Z., Lipton, Z. C., & Elkan, C. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1412.7584 · Cited by 181
“Definition 3: a mechanism f̃ satisfies (ǫ, δ)-differential privacy [12, 13] for two non-negative numbers ǫ and δ iff for all neighbors d(D,D) = 1, and all subset S of f̃ ’s range, as long as the following probabilities are well-defined, there holds P (f̃(D) ∈ S) ≤ δ + eP (f̃(D) ∈ S)”
BackgroundAnalyzing Graphs with Node Differential Privacy
Kasiviswanathan, S. P., Nissim, K., Raskhodnikova, S., & Smith, A. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-36594-2_26 · Cited by 294
“Let G denote the set of unweighted, undirected finite labeled graphs, and let Gn denote the set of graphs on at most n nodes and Gn,D be the set of all graphs in Gn with maximum degree D.”
BackgroundLocal differential privacy and its applications: A comprehensive survey
Yang, M., Guo, T., Zhu, T., Tjuawinata, I., Zhao, J., & Lam, K.-Y. (2024) · Computer Standards & Interfaces · doi:10.1016/j.csi.2023.103827 · Cited by 229
Differentially Private Fine-tuning of Language Models
Yu, D., Naik, S., Backurs, A., Gopi, S., Inan, H. A., Kamath, G., Kulkarni, J., Lee, Y. T., Manoel, A., Wutschitz, L., et al. (2024) · Journal of Privacy and Confidentiality · doi:10.29012/jpc.880 · Cited by 87
The reusable holdout: Preserving validity in adaptive data analysis
Dwork, C., Feldman, V., Hardt, M., Pitassi, T., Reingold, O., & Roth, A. (2015) · Science · doi:10.1126/science.aaa9375 · Cited by 307
Self-citationDifferential Privacy: An Economic Method for Choosing Epsilon
Hsu, J., Gaboardi, M., Haeberlen, A., Khanna, S., Narayan, A., Pierce, B. C., & Roth, A. (2014) · 2014 IEEE 27th Computer Security Foundations Symposium · doi:10.1109/csf.2014.35 · Cited by 272
“A similar concern applies to the parameter δ in (ε,δ )-differential privacy, a standard generalization of differential privacy [7].”
BackgroundPufferfish: A framework for mathematical privacy definitions
Kifer, D., & Machanavajjhala, A. (2014) · ACM Transactions on Database Systems · doi:10.1145/2514689 · Cited by 267
“This version includes several important additions: an analysis of the semantics of (cid:6) - indistinguishability [Dwork et al. 2006b] (a variant of differential privacy) in Section 6.2; a detailed critique of neighboring-table semantics for privacy definitions with respect to Bayesian semantics in…”
BackgroundMethodInfluentialPreserving Statistical Validity in Adaptive Data Analysis
Dwork, C., Feldman, V., Hardt, M., Pitassi, T., Reingold, O., & Roth, A. L. (2015) · Proceedings of the forty-seventh annual ACM symposium on Theory of Computing · doi:10.1145/2746539.2746580 · Cited by 248
“[16, 15] A randomized algorithm A with domain X is (ε, δ)-differentially private if for all O ⊆ Range(A) and for all pairs of adjacent datasets S, S′ ∈ X: P[A(S) ∈ O] ≤ exp(ε)P[A(S) ∈ O] + δ,”
Self-citationA Practical Privacy-Preserving Data Aggregation (3PDA) Scheme for Smart Grid
Liu, Y., Guo, W., Fan, C.-I., Chang, L., & Cheng, C. (2019) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2018.2809672 · Cited by 290
“Another example using random numbers is the differential privacy [19], which adds the random noise obeying Laplace or other distribution to mask the original value.”
BackgroundDifferentially private sequential data publication via variable-length n-grams
Chen, R., Acs, G., & Castelluccia, C. (2012) · Proceedings of the 2012 ACM conference on Computer and communications security · doi:10.1145/2382196.2382263 · Cited by 274
Yang, Q., Zhang, Y., Dai, W., & Pan, S. J. (2020) · Cambridge University Press eBooks · doi:10.1017/9781139061773 · Cited by 254
Privacy-preserving statistical estimation with optimal convergence rates
Smith, A. (2011) · Proceedings of the forty-third annual ACM symposium on Theory of computing · doi:10.1145/1993636.1993743 · Cited by 251
Knock Knock, Who's There? Membership Inference on Aggregate Location Data
Pyrgelis, A., Troncoso, C., & Cristofaro, E. D. (2018) · Proceedings 2018 Network and Distributed System Security Symposium · doi:10.14722/ndss.2018.23183 · Cited by 210
A survey on IoT platforms: Communication, security, and privacy perspectives
Babun, L., Denney, K., Celik, Z. B., McDaniel, P., & Uluagac, A. S. (2021) · Computer Networks · doi:10.1016/j.comnet.2021.108040 · Cited by 245
“Homomorphic encryption [141], the addition of noise [142], and data aggregation [143] are some examples of established ways to preserve privacy on a traditional network [144,145].”
BackgroundAnalyzing Leakage of Personally Identifiable Information in Language Models
Lukas, N., Salem, A., Sim, R., Tople, S., Wutschitz, L., & Zanella-Béguelin, S. (2023) · 2023 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp46215.2023.10179300 · Cited by 154
“PII scrubbing and Differential Privacy (DP) protect the privacy of training data at the cost of degrading model utility.”
Distributed Differential Privacy via Shuffling
Cheu, A., Smith, A., Ullman, J., Zeber, D., & Zhilyaev, M. (2019) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-17653-2_13 · Cited by 268
“In principle, one could also use the powerful, general tools of modern cryptography, such as multiparty computation (MPC), or secure function evaluation, to simulate central model algorithms in a setting without a trusted server [13], but such algorithms currently impose bandwidth and liveness constraints that make th…”
BackgroundFederated learning for computational pathology on gigapixel whole slide images
Lu, M. Y., Chen, R. J., Kong, D., Lipkova, J., Singh, R., Williamson, D. F. K., Chen, T. Y., & Mahmood, F. (2022) · Medical Image Analysis · doi:10.1016/j.media.2021.102298 · Cited by 267
“Formally, it says (Dwork et al., 2006), given a deterministic function f , and two adjacent datasets D i , D i differing by exactly one example, i.e. , (cid:107) D i − D i 1 = 1, f satisfies ( (cid:15), δ )-differential privacy if for any subset of outputs S : where the introduction of the δ term…”
BackgroundDifferential Privacy for Statistics: What we Know and What we Want to Learn
Dwork, C., & Smith, A. (2010) · Journal of Privacy and Confidentiality · doi:10.29012/jpc.v1i2.570 · Cited by 264
Self-citationDifferentially Private Distributed Optimization
Huang, Z., Mitra, S., & Vaidya, N. (2015) · Proceedings of the 16th International Conference on Distributed Computing and Networking · doi:10.1145/2684464.2684480 · Cited by 266
Amplification by Shuffling: From Local to Central Differential Privacy via Anonymity
Erlingsson, Ú., Feldman, V., Mironov, I., Raghunathan, A., Talwar, K., & Thakurta, A. (2019) · Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms · doi:10.1137/1.9781611975482.151 · Cited by 264
Self-citationExposed! A Survey of Attacks on Private Data
Dwork, C., Smith, A., Steinke, T., & Ullman, J. (2017) · Annual Review of Statistics and Its Application · doi:10.1146/annurev-statistics-060116-054123 · Cited by 259
Self-citationA learning theory approach to noninteractive database privacy
Blum, A., Ligett, K., & Roth, A. (2013) · Journal of the ACM · doi:10.1145/2450142.2450148 · Cited by 242
Releasing search queries and clicks privately
Korolova, A., Kenthapadi, K., Mishra, N., & Ntoulas, A. (2009) · Proceedings of the 18th international conference on World wide web · doi:10.1145/1526709.1526733 · Cited by 248
Self-citationDifferentially private event sequences over infinite streams
Kellaris, G., Papadopoulos, S., Xiao, X., & Papadias, D. (2014) · Proceedings of the VLDB Endowment · doi:10.14778/2732977.2732989 · Cited by 250
Sharing graphs using differentially private graph models
Sala, A., Zhao, X., Wilson, C., Zheng, H., & Zhao, B. Y. (2011) · Proceedings of the 2011 ACM SIGCOMM conference on Internet measurement conference · doi:10.1145/2068816.2068825 · Cited by 240
“We obtain differential privacy guarantees by injecting a controlled level of statistical noise into D [16].”
Subsampled Rényi Differential Privacy and Analytical Moments Accountant
Wang, Y.-X., Balle, B., & Kasiviswanathan, S. (2020) · Journal of Privacy and Confidentiality · doi:10.29012/jpc.723 · Cited by 137
Computational Differential Privacy
Mironov, I., Pandey, O., Reingold, O., & Vadhan, S. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-03356-8_8 · Cited by 231
“[9] present a multi-party protocol run on top of a verifiable secret sharing scheme.”
BackgroundInfluentialSelf-citationFederated Learning for Healthcare Domain - Pipeline, Applications and Challenges
Joshi, M., Pal, A., & Sankarasubbu, M. (2022) · ACM Transactions on Computing for Healthcare · doi:10.1145/3533708 · Cited by 203
Conservative or liberal? Personalized differential privacy
Jorgensen, Z., Yu, T., & Cormode, G. (2015) · 2015 IEEE 31st International Conference on Data Engineering · doi:10.1109/icde.2015.7113353 · Cited by 225
PPFA: Privacy Preserving Fog-Enabled Aggregation in Smart Grid
Lyu, L., Nandakumar, K., Rubinstein, B., Jin, J., Bedo, J., & Palaniswami, M. (2018) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2018.2803782 · Cited by 240
“Dwork et al. [16] first introduced a distributed protocol with the aid of DDP.”
BackgroundPrivacy integrated queries: an extensible platform for privacy-preserving data analysis
McSherry, F. (2010) · Communications of the ACM · doi:10.1145/1810891.1810916 · Cited by 228
“Other weaker definitions with solid mathematical foundations do exist, but notably approximate differential privacy [ 14 ] also bases privacy on the differential notion of bounding change in behavior as a function of change in the input.”
BackgroundResultSelf-citationDifferentially Private Learning with Adaptive Clipping
Andrew, G., Thakkar, O. D., McMahan, H. B., & Ramaswamy, S. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1905.03871 · Cited by 80
“Differential privacy (DP) [8, 9] has been recently used as a gold standard to bound the privacy leakage of sensitive data when performing learning tasks.”
BackgroundInfluentialDP-ADMM: ADMM-Based Distributed Learning With Differential Privacy
Huang, Z., Hu, R., Guo, Y., Chan-Tin, E., & Gong, Y. (2020) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2019.2931068 · Cited by 190
Subsampled Rényi Differential Privacy and Analytical Moments Accountant
Wang, Y.-X., Balle, B., & Kasiviswanathan, S. (2018) · arXiv · doi:10.48550/arxiv.1808.00087 · Cited by 224
“Composition theorems for differential privacy allow a modular design of privacy preserving mechanisms based on mechanisms for simpler sub tasks: Theorem 12 (Naïve composition, Dwork et al. (2006a)) .”
BackgroundInfluentialByrd, D., & Polychroniadou, A. (2020) · Proceedings of the First ACM International Conference on AI in Finance · doi:10.1145/3383455.3422562 · Cited by 188
“Differential privacy [8, 15] can help prevent such reverse engineering by adding noise to the input data set, to intermediate calculations, or to the outputs.”
BackgroundOn significance of the least significant bits for differential privacy
Mironov, I. (2012) · Proceedings of the 2012 ACM conference on Computer and communications security · doi:10.1145/2382196.2382264 · Cited by 176
“Examples of such mechanisms include differ-entially private computations in a distributed setting [11], privacy-preserving billing and aggregation [5, 24].”
BackgroundSelf-citationGANobfuscator: Mitigating Information Leakage Under GAN via Differential Privacy
Xu, C., Ren, J., Zhang, D., Zhang, Y., Qin, Z., & Ren, K. (2019) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2019.2897874 · Cited by 210
DP-CGAN: Differentially Private Synthetic Data and Label Generation
Torkzadehmahani, R., Kairouz, P., & Paten, B. (2019) · 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW) · doi:10.1109/cvprw.2019.00018 · Cited by 193
“Differential privacy [10, 11] is a mathematical framework to express the level of privacy preservation of individuals in a statistical databases.”
BackgroundMethodInfluentialPublishing data from electronic health records while preserving privacy: A survey of algorithms
Gkoulalas-Divanis, A., Loukides, G., & Sun, J. (2014) · Journal of Biomedical Informatics · doi:10.1016/j.jbi.2014.06.002 · Cited by 202
“(1) [31] or (ii) considering attackers with limited computational resources (i.”
BackgroundPrivacy-Preserving Stream Aggregation with Fault Tolerance
Chan, T. H. H., Shi, E., & Song, D. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-32946-3_15 · Cited by 202
“[7] study distributed noise generation, however, their scheme requires interactions among all users.”
BackgroundDifferential Privacy as a Mutual Information Constraint
Cuff, P., & Yu, L. (2016) · Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2976749.2978308 · Cited by 184
“For various reasons it has since been relaxed [13] to have two parameters ǫ and δ playing multiplicative and additive roles in the likelihood constraint.”
BackgroundDecentralized Federated Learning: A Survey on Security and Privacy
Hallaji, E., Razavi-Far, R., Saif, M., Wang, B., & Yang, Q. (2024) · IEEE Transactions on Big Data · doi:10.1109/tbdata.2024.3362191 · Cited by 175
“The concept of distributed DP alludes to the notion that the required amount of noise is derived from several individuals [122].”
BackgroundPrio: Private, Robust, and Scalable Computation of Aggregate Statistics
Corrigan-Gibbs, H., & Boneh, D. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1703.06255 · Cited by 140
“Using existing techniques, the servers can add this noise in a distributed fashion to ensure that as long as at least one server is honest, no server sees the un-noised aggregate [55].”
MethodDynamic Differential Privacy for ADMM-Based Distributed Classification Learning
Zhang, T., & Zhu, Q. (2017) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2016.2607691 · Cited by 202
How Much Is Enough? Choosing ε for Differential Privacy
Lee, J., & Clifton, C. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-24861-0_22 · Cited by 201
“[2, 9, 10] The notion of differential privacy has received much theoretical attention in the privacy community and has been extensively studied in the literature [2, 3, 10,8,1]; a recent survey on differential privacy is provided in [7].”
BackgroundTan, B., Song, Y., Zhong, E., & Yang, Q. (2015) · Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2783258.2783295 · Cited by 184
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.