Authors M.D.KulkarniDepartment of Electronics and Telecommunication Engineering, Vishwakarma Institute of Information Technology, Pune, IndiaSumit KadamDepartment of Electronics and Telecommunication Engineering, Vishwakarma Institute of Information Technology, Pune, India Abstract This paper examines the analysis of cryptographic protocols that enable two or more parties to compute functions based on their shared inputs without revealing those inputs in their original format. This aspect is a crucial component of Secure Multi-Party Computation (SMPC). The security provided by safeguarding data during computations allows participants to execute calculations while maintaining data confidentiality. SMPC finds applications in sectors such as finance, healthcare, and data analytics, where sensitive information is prevalent. The research emphasizes methods for integrating security into the analyzed protocols to guarantee their accuracy while safeguarding user privacy. This is achieved through the implementation of techniques such as homomorphic encryption, secret sharing, and zero-knowledge proofs. We explore various security configurations, including semi-honest and malicious security, to assess the susceptibility of these protocols to potential attacks or data breaches. Additionally, significant issues such as scalability and computational complexity are discussed, offering solutions to reduce communication expenses and processing time in the context of Big Data applications. The findings indicate that it is feasible to realize a secure and practical SMPC with robust security assurances, irrespective of the performance demands of diverse real-world application scenarios. This research is pertinent to the contemporary landscape of cryptography and introduces novel protocols that facilitate sensitive computations for practical applications while ensuring privacy in today's digital landscape. Keywords Multi-Party Computation Homomorphic Encryption Privacy Cryptography MPC Cryptographic protocols Secure Protocols Citation of this Article M.D.Kulkarni, & Sumit Kadam. (2025). Protocols for Privacy-Preserving Computing that Safeguard the Inputs of All Participants. Current Journal of Engineering and Science Research. 2(10), 5-12. Article DOI: https://doi.org/10.47001/CJESR/2025.210002 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 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.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).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.Smart, N.P., 2003. Cryptography: an introduction (Vol. 3, p. 433). New York: McGraw-Hill.Canetti, R., 2000. Security and composition of multiparty cryptographic protocols. Journal of CRYPTOLOGY, 13, pp.143-202.Goldreich, O., 2003. Cryptography and cryptographic protocols. Distributed Computing, 16, pp.177-199.Demmler, D., Schneider, T. and Zohner, M., 2015, February. ABY-A framework for efficient mixed-protocol secure two-party computation. In NDSS.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)..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).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).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.