Enhancing Secure Multi-Party Computation with Damgård–Jurik and NIZK Proofs: A Lightweight Protocol for Scalable Aggregation
Source abstract
Abstract
Privacy-preserving secure multi-party computation protocols are known to face scalability and efficiency challenges in environments where participants hold distinct attributes of the same records (vertical partitioning) or controls a subset of complete records (horizontal partitioning), as in cross-institutional health data analysis or federated IoT analytics, mostly because of communication overhead and the need to address adaptability to large scale or heterogeneous settings. This work introduces a novel MPC protocol based on the Damgård–Jurik cryptosystem and Schnorr zero-knowledge proofs (ZKP), designed to securely aggregate private data distributed across a number of parties. By combining homomorphic encryption with non-interactive ZKP’s, the protocol ensures privacy, correctness, and scalability, aligning with the principles of privacy-enhancing technologies (PETs). Our approach minimizes data exposure, allowing participants to audit results, and achieves linear O(N) communication complexity, thus making it suitable for large-scale applications in secure data analytics and collaborative computing.
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Cryptography and Data Security · Complexity and Algorithms in Graphs · graph theory and CDMA systems
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
Departamento Ciencias de la Computación e Informática, Universidad de La Frontera, Temuco 4811230, Chile
Tecnologico de Monterrey, School of Engineering and Sciences, Monterrey 64849, Mexico
Funding
Dirección de Investigación, Universidad de La Frontera
References (30)
Show source-provided references
1. Communication-Efficient Hybrid Federated Learning for E-Health with Horizontal and Vertical Data Partitioning10.1109/TNNLS.2024.3383748 ↗
2. A federated learning approach for smart healthcare systems10.1007/s40012-023-00382-1 ↗
3. DEEP-FEL: Decentralized, Efficient and Privacy-Enhanced Federated Edge Learning for Healthcare Cyber Physical Systems10.1109/TNSE.2022.3175945 ↗
4. FedSL: Federated Split Learning for Collaborative Healthcare Analytics on Resource-Constrained Wearable IoMT Devices10.1109/JIOT.2024.3370985 ↗
5. Privacy-Preserving Edge Federated Learning for Intelligent Mobile-Health Systems10.1016/j.future.2024.07.035 ↗
6. Armknecht, F., Boyd, C., Carr, C., Gjøsteen, K., Jäschke, A., Reuter, C.A., and Strand, M. (2015). A guide to fully homomorphic encryption. Cryptol. ePrint Arch., Available online: https://eprint.iacr.org/2015/1192.
7. Fan, J., and Vercauteren, F. (2025, June 24). Somewhat practical fully homomorphic encryption. Cryptol. ePrint Arch., Available online: https://eprint.iacr.org/2012/144.
8. Damgård, I., and Jurik, M. (2001). A generalization, a simplification and some applications of Paillier’s probabilistic public-key system. Public Key Cryptography: 4th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2001, Cheju Island, Korea, February 13–15, 2001 Proceedings 4, Springer.10.1007/3-540-44586-2_9 ↗
9. Paillier, P. (2005). Paillier Encryption and Signature Schemes. Encyclopedia of Cryptography and Security, Springer.10.1007/0-387-23483-7_293 ↗
10. Kleinjung, T., Aoki, K., Franke, J., Lenstra, A.K., Thomé, E., Bos, J.W., Gaudry, P., Kruppa, A., Montgomery, P.L., and Osvik, D.A. (2010). Factorization of a 768-bit RSA modulus. Advances in Cryptology—CRYPTO 2010: 30th Annual Cryptology Conference, Santa Barbara, CA, USA, August 15–19, 2010. Proceedings 30, Springer.10.1007/978-3-642-14623-7_18 ↗
11. An image encryption method based on elliptic curve elgamal encryption and chaotic systems10.1109/ACCESS.2019.2906052 ↗
12. Cross-Silo Federated Learning for Multi-Tier Networks with Vertical and Horizontal Data Partitioning
13. MOTION—A Framework for Mixed-Protocol Multi-Party Computation10.1145/3490390 ↗
14. Abascal, J., Sereshgi, M.H.F., Hazay, C., Ishai, Y., and Venkitasubramaniam, M. (2020, January 9–13). Is the Classical GMW Paradigm Practical? The Case of Non-Interactive Actively Secure 2PC. Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, Online.10.1145/3372297.3423366 ↗
15. Efficient Constant-Round Multi-party Computation Combining BMR and SPDZ10.1007/s00145-019-09322-2 ↗
16. Mehnaz, S., Bellala, G., and Bertino, E. (2017, January 21–23). A secure sum protocol and its application to privacy-preserving multi-party analytics. Proceedings of the 22nd ACM on Symposium on Access Control Models and Technologies, Indianapolis, IN, USA.10.1145/3078861.3078869 ↗
17. Hao, F. (2017). Schnorr Non-Interactive Zero-Knowledge Proof, Newcastle University. RFC 8235.10.17487/RFC8235 ↗
18. Dimitoglou, G., and Jim, C. (2022, January 14–16). Performance Evaluation of Partially Homomorphic Encryption Algorithms. Proceedings of the 2022 International Conference on Computational Science and Computational Intelligence (CSCI), Las Vegas, NV, USA.10.1109/CSCI58124.2022.00163 ↗
19. Cryptosystem Conversion, Packing and Matrix Processing of Homomorphically Encrypted Data: Application to IOT Devices10.1109/ACCESS.2021.3058849 ↗
20. User Collusion Avoidance CP-ABE With Efficient Attribute Revocation for Cloud Storage10.1109/JSYST.2017.2667679 ↗
21. Non-transitive and collusion resistant quorum controlled proxy re-encryption scheme for resource constrained networks
22. Shorter Quasi-Adaptive NIZK Proofs for Linear Subspaces10.1007/s00145-016-9243-7 ↗
23. Secure multi-party summation protocols: Are they secure enough under collusion?
24. A survey on homomorphic encryption schemes: Theory and implementation10.1145/3214303 ↗
25. Koç, Ç.K., Özdemir, F., and Ödemiş Özger, Z. (2021). Damgård-Jurik Algorithm. Partially Homomorphic Encryption, Springer.10.1007/978-3-030-87629-6 ↗
26. On the Improvement Attack Upon Some Variants of RSA Cryptosystem via the Continued Fractions Method10.1109/ACCESS.2020.2991048 ↗
27. Security Issues of Novel RSA Variant10.1109/ACCESS.2022.3175519 ↗
28. Agal, M., Kishan, K., Shashidhar, R., Vantmuri, S.S., and Honnavalli, P. (2021, January 24–25). Non-interactive zero-knowledge proof based authentication. Proceedings of the 2021 IEEE Mysore Sub Section International Conference (MysuruCon), Hassan, India.10.1109/MysuruCon52639.2021.9641514 ↗
29. Multiple Encryption using ECC and its Time Complexity Analysis10.22362/ijcert/2016/v3/i11/48907 ↗
30. Escobar Jara, F.A., and Fenner Lopez, J.E. (ESMC_Damgard-Juric, 2025). ESMC_Damgard-Juric.