A Comprehensive Comparison of Multiparty Secure Additions with Differential Privacy
Open accessThe DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Abstract
This paper considers the problem of secure data aggregation (mainly summation) in a distributed setting, while ensuring differential privacy of the result. We study secure multiparty addition protocols using well known security schemes: Shamir's secret sharing, perturbation-based, and various encryptions. We supplement our study with our new enhanced encryption scheme EFT, which is efficient and fault tolerant. Differential privacy of the final result is achieved by either distributed Laplace or Geometric mechanism (respectively DLPA or DGPA), while approximated differential privacy is achieved by diluted mechanisms. Distributed random noise is generated collectively by all participants, which draw random variables from one of several distributions: Gamma, Gauss, Geometric, or their diluted versions. We introduce a new distributed privacy mechanism with noise drawn from the Laplace distribution, which achieves smaller redundant noise with efficiency. We compare complexity and security characteristics of the protocols with different differential privacy mechanisms and security schemes. More importantly, we implemented all protocols and present an experimental comparison on their performance and scalability in a real distributed environment. Based on the evaluations, we identify our security scheme and Laplace DLPA as the most efficient for secure distributed data aggregation with 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
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756 · cited 2×
“As an example of secret sharing schemes, we describe the Shamir scheme [49].”
MethodA method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462
A public key cryptosystem and a signature scheme based on discrete logarithms
Elgamal, T. (1985) · IEEE Transactions on Information Theory · doi:10.1109/tit.1985.1057074 · Cited by 8,059 · cited 2×
“However, a few partially homomorphic schemes are efficient enough to achieve both security and performance goals, e.g., multiplicatively homomorphic ElGamal [25] and RSA [48] schemes.”
BackgroundCalibrating 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
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
Paillier, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48910-x_16 · Cited by 7,250
Fully homomorphic encryption using ideal lattices
Gentry, C. (2009) · Proceedings of the forty-first annual ACM symposium on Theory of computing · doi:10.1145/1536414.1536440 · Cited by 6,806 · cited 1×
“The price for such flexibility in choosing f is high complexity of computations [28], [53].”
BackgroundGoldreich, 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
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 · cited 3×
“A common mechanism to achieve a-differential privacy is the Laplace perturbation algorithm [21].”
BackgroundOur 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 · cited 8×
“Privacy of data subjects is protected if any data recipient does not learn anything about them including their participation in the data collection.”
BackgroundMethodInfluentialPrivacy-preserving data publishing: A survey of recent developments
Fung, B. C. M., Wang, K., Chen, R., & Yu, P. S. (2010) · ACM Computing Surveys · doi:10.1145/1749603.1749605 · Cited by 1,704 · cited 1×
“Traditional approaches such as removing identifying attributes, generalizing, or perturbing individual attribute values, are susceptible to various attacks [26].”
Background
Research works printed but not linked: 42
- lindell, 2008, Secure multiparty computation for privacy-preserving data mining, IACR Cryptology ePrint, 197
- lindell, 0, An efficient protocol for secure two-party computation in the presence of malicious adversaries, Proc 26th Annu Int Conf Theory Appl Cryptograph Techn, 52
- hazay, 0, Efficient RSA key generation and threshold Paillier in the two-party setting, Proc 12th Conf Topics Cryptol, 313
- 10.1145/2457317.2457343 · DOI · Paper page
- 10.1017/CBO9780511721656 · DOI · Paper page
- kotz, 0, The Laplace Distribution and Generalizations A Revisit With Applications to Communications Economics Engineering and Finance
- 10.1145/1989323.1989345 · DOI · Paper page
- kang, 2012, Self-surveillance privacy, Iowa Law Rev, 97, 809
- johnson, 2005, Univariate Discrete Distributions, 10.1002/0471715816 · DOI · Paper page
- 10.1145/1536414.1536464 · DOI · Paper page
- 0, Report of the August 2010 Multi-Agency Workshop on InfoSymbiotics/DDDAS The Power of Dynamic Data Driven Applications Systems
- dwork, 0, Differential privacy, Proc 33rd Int Conf Automata Languages Program – Volume Part II, 1
- 10.1145/1866739.1866758 · DOI · Paper page
- shi, 0, Privacy-preserving aggregation of time-series data, Proc of the NDSS Symposium, 489
- 10.1145/1592761.1592778 · DOI · Paper page
- 10.1109/SFCS.1986.25 · DOI · Paper page
- wagner, 2006, Handbook of biosurveillance
- dijk, 0, Fully homomorphic encryption over the integers, Proc Int Conf Theory Appl Cryptographic Techn, 24
- 10.1109/MSP.2004.108 · DOI
- 10.1186/1472-6947-10-14 · DOI
- 10.18637/jss.v005.i08 · DOI · Paper page
- 10.1145/1525856.1525858 · DOI · Paper page
- 10.1109/MOBIQUITOUS.2005.25 · DOI · Paper page
- catrina, 0, Secure computation with fixed-point numbers, 14th International Conference on Financial Cryptography and Data Security, 35
- 10.1007/s12394-010-0046-y · DOI · Paper page
- 10.1145/1966913.1966943 · doi:10.1145/1966913.1966943
- cramer, 0, Multiparty computation from threshold homomorphic encryption, Proc Int Conf Theory Appl Cryptographic Techn, 280
- damgård, 0, A generalisation, a simplification and some applications of Paillier’s probabilistic Public-key system, Proc Sixth Int l Workshop Theory and Practice in Public Key Cryptography Public Key Cryptography, 119
- damgård, 0, Efficient, robust and Constant-round distributed RSA key generation, Proc 7th Int Conf Theory Cryptography, 183
- alhadidi, 0, Secure distributed framework for achieving $\epsilon$ -differential privacy, Proc 12th Priv Enhancing Technol Symp, 120
- 10.1007/BF02293108 · doi:10.1007/bf02293108
- 10.1214/aoms/1177706645 · DOI · Paper page
- 10.1145/62212.62213 · DOI · Paper page
- burke, 0, Participatory sensing, Proc Workshop World-Sensor-Web Mobile Device Centric Sen Netw Appl
- 10.1109/TDSC.2013.13 · DOI
- burkhart, 0, SEPIA: Privacy-preserving aggregation of multi-domain network events and statistics, Proc 19th USENIX Security Symp
- 10.2139/ssrn.1370731 · DOI · Paper page
- pedersen, 0, Secret sharing vs. Encryption-based techniques for privacy preserving data mining, Proc UNECE/EuroSTAT Work Session SDC, 33
- 10.1145/1807167.1807247 · DOI · Paper page
- 10.1145/1555816.1555823 · DOI · Paper page
- 10.1109/FOCS.2007.66 · DOI · Paper page
- 10.1007/978-3-642-17955-6_4 · DOI
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
“There is a rich literature exploring secure aggregation in both the single-server setting (via pairwise additive masking [12, 188, 73], via threshold homomorphic encryption [356, 193, 92], and via generic secure multi-party computation [86]) as well as in the multiple non-colluding servers setting [71, 29, 113].”
BackgroundPractical 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
A Survey on Federated Learning Systems: Vision, Hype and Reality for Data Privacy and Protection
Li, Q., Wen, Z., Wu, Z., Hu, S., Wang, N., Li, Y., Liu, X., & He, B. (2023) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2021.3124599 · Cited by 1,407
“other, and an FLS can adopt multiple methods to enhance the privacy guarantees [60], [78], [189].”
BackgroundA 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
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
“Besides, SMC-based protocols can enable multiple participants to collaboratively compute an agreed-upon function without leaking input information from any participant except for what can be inferred from the outcomes of the computation [101], [102].”
Background
Metadata
- Authors
- Goryczka, S., & Xiong, L.
- Venue
- IEEE Transactions on Dependable and Secure Computing
- Published
- 2017-09-01
- Volume
- 14
- Issue
- 5
- Pages
- 463-477
- ISSN
- 1545-5971 (ISSN-L)
- OpenAlex
- W2525846285
- Cited by
- 139
- References
- 12
- FWCI
- 3.13
- Type
- journal article
- Language
- en
- Open access
- green
- Funders
- AFOSR DDDAS program (FA9550-12-1-0240)
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Comprehensive Comparison of Multiparty Secure Additions with Differential Privacy. https://app.cochat.ai/papers/10.1109/tdsc.2015.2484326
- The paper
- Goryczka, S., & Xiong, L. (2017). A Comprehensive Comparison of Multiparty Secure Additions with Differential Privacy. IEEE Transactions on Dependable and Secure Computing. https://doi.org/10.1109/tdsc.2015.2484326
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.