Authors

Priyanka A. Patil

M. E. Electronics, Department of Electronics Engg; KBP college of Engg., Satara Dist-SATARA; Maharashtra, India

Mohan Kulkarni

M. E. Electronics, Department of Electronics Engg; KBP college of Engg., Satara Dist-SATARA; Maharashtra, India

Abstract

This study delves into the examination of cryptographic protocols that permit two or more parties to compute functions based on their shared inputs without disclosing those inputs in their original state. This is a vital aspect of Secure Multi-Party Computation (SMPC). The security attained by safeguarding data during computations enables participants to carry out calculations while ensuring data protection. SMPC is utilized in fields such as finance, healthcare, and data analytics, where sensitive information is at stake. The investigation centers on strategies for embedding security into the examined protocols to confirm their accuracy while maintaining user privacy. This is accomplished through the application of methodologies such as homomorphic encryption, secret sharing, and zero-knowledge proofs. We analyze different security configurations, including semi-honest and malicious security, to evaluate the vulnerability of these protocols to possible attacks or data exposure. Moreover, critical topics such as scalability and computational complexity are tackled, proposing strategies to lessen communication costs and processing time in the realm of Big Data applications. The results indicate that it is achievable to implement a secure and practical SMPC with strong security guarantees, regardless of the performance requirements of various real-world application contexts. This work is significant to the current state of cryptography and suggests new protocols that facilitate sensitive computations for real-world applications while ensuring privacy in the modern digital landscape.

Keywords

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

Citation of this Article

Priyanka A. Patil, & Mohan Kulkarni. (2025). Protocols for Computing that Ensure Privacy and Safeguard the Inputs of All Involved Participants. International Current Journal of Engineering and Science (ICJES), 4(8), 25-32. Article DOI: https://doi.org/10.47001/ICJES/2025.408005

Licence Copyright (c) 2026 International Current Journal of Engineering and Science. 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.