Authors

M.D.Kulkarni

Department of Electronics and Telecommunication Engineering, Vishwakarma Institute of Information Technology, Pune, India

Shweta Anagunde

Department of Electronics and Telecommunication Engineering, Vishwakarma Institute of Information Technology, Pune, India

Varsha Sri

Department of Electronics and Telecommunication Engineering, Vishwakarma Institute of Information Technology, Pune, India

Abstract

This paper focuses on the analysis of cryptographic protocols that allow two or more parties to compute functions of their shared inputs without exposing those inputs in their original form. This is a fundamental element of SMPC. Thanks to the security achieved by protecting data during computations, SMPC allows participants to perform computations while protecting the data. It is used in areas such as finance, healthcare, and data analytics, where sensitive data is involved. The study focuses on approaches for introducing security into the studied protocols to ensure their correctness while preserving user privacy. This is done through the use of tools such as homomorphic encryption, secret sharing, and zero-knowledge technology. We consider different security configurations, such as semi-honest and malicious security, to understand the vulnerability of these protocols to potential attacks or data disclosure. Furthermore, important topics such as scaling and computational complexity are addressed, proposing solutions to minimize communication costs and time in the context of Big Data applications. The result demonstrates that it is possible to implement a secure and practical SMPC with strong security guarantees, regardless of the performance requirements of various real-world application scenarios. This work is relevant to the current state of cryptography and proposes new protocols that enable sensitive computations for real-world applications while preserving privacy in the modern digital environment.

Keywords

Multi-Party Computation Homomorphic Encryption Privacy Cryptography MPC Cryptographic protocols Secure Protocols

Citation of this Article

M.D.Kulkarni, Shweta Anagunde, & Varsha Sri. (2025). Privacy-Preserving Computing Protocols that Protect the Inputs of All Participants. Current Journal of Engineering and Science Research. 2(1), 1-8. Article DOI: https://doi.org/10.47001/CJESR/2025.201001

Licence Copyright (c) 2026 Current Journal of Engineering and Science Research. This work is licensed under a Creative Commons Attribution Non Commercial 4.0 International Licence.

References

  1. Peter, A., Tews, E. and Katzenbeisser, S., 2013. Efficiently outsourcing multiparty computation under multiple keys. IEEE transactions on information forensics and security, 8(12), pp.2046-2058.
  2. Goldwasser, S., 1997, August. Multi party computations: past and present. In Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing (pp. 1-6).
  3. Brandt, F., 2005, December. Efficient cryptographic protocol design based on distributed El Gamal encryption. In International Conference on Information Security and Cryptology (pp. 32-47). Berlin, Heidelberg: Springer Berlin Heidelberg.
  4. Smart, N.P., 2003. Cryptography: an introduction (Vol. 3, p. 433). New York: McGraw-Hill.
  5. Canetti, R., 2000. Security and composition of multiparty cryptographic protocols. Journal of CRYPTOLOGY, 13, pp.143-202.
  6. Goldreich, O., 2003. Cryptography and cryptographic protocols. Distributed Computing, 16, pp.177-199.
  7. Demmler, D., Schneider, T. and Zohner, M., 2015, February. ABY-A framework for efficient mixed-protocol secure two-party computation. In NDSS.
  8. Chaum, D., Damgård, I.B. and Van de Graaf, J., 1988. Multiparty computations ensuring privacy of each party’s input and correctness of the result. In Advances in Cryptology—CRYPTO’87: Proceedings 7 (pp. 87-119)..
  9. Naor, M. and Nissim, K., 2001, July. Communication preserving protocols for secure function Springer Berlin Heidelberg evaluation. In Proceedings of the thirty-third annual ACM symposium on Theory of computing (pp. 590-599).
  10. Canetti, R., Lindell, Y., Ostrovsky, R. and Sahai, A., 2002, May. Universally composable two-party and multi-party secure computation. In Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (pp.494-503).
  11. Lindell, Yehuda, and Benny Pinkas. “An efficient protocolfor secure two-party computation in the presence of malicious adversaries.” In Advances in Cryptology-EUROCRYPT 2007: 26th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Barcelona, Spain, May 20-24, 2007. Proceedings 26, pp. 52-78. Springer Berlin Heidelberg, 2007.