Contact : 9561854529 Email : submitpaper@ijaea.com editorinchief.ijaea@gmail.com Working Hours: 9am to 9PM

International Journal of Advanced Engineering Application

ISSN: 3048-6807

Submit Paper Apply for Reviewer

Homomorphic Encryption for Privacy-Preserving Cloud Computing: Opportunities and Challenges

Author(s):Rohit V. Kulkarni1, Meera S. Raghavan2, Aniket P. Deshpande3

Affiliation: 1,2,3Department of Computer Science and Engineering, Manipal University Jaipur, India

Page No: 19-24

Volume issue & Publishing Year: Volume 2 Issue 6,June-2025

Journal: International Journal of Advanced Engineering Application (IJAEA)

ISSN NO: 3048-6807

DOI: https://doi.org/10.5281/zenodo.17657599

Download PDF

Article Indexing:

Abstract:
The rapid adoption of cloud computing has transformed the way organizations store, process, and share data. However, outsourcing sensitive data to third-party cloud providers raises major security and privacy concerns, particularly in domains such as healthcare, finance, and government services. Traditional encryption schemes, while effective for secure storage and transmission, require data decryption for computation, exposing sensitive information to potential breaches. Homomorphic Encryption (HE) offers a promising solution by allowing computations to be performed directly on encrypted data without revealing its contents. This paper explores the principles of homomorphic encryption, its classification into partial, somewhat, and fully homomorphic schemes, and its application in enabling privacy-preserving cloud services. A conceptual framework is proposed for integrating HE with cloud-based data analytics and machine learning workflows, ensuring both functionality and confidentiality. Furthermore, we highlight current challenges such as computational overhead, key management, and scalability, while identifying future directions for efficient and practical deployment.

Keywords: Homomorphic Encryption, Cloud Computing, Privacy-Preserving Computation, Data Security, Fully Homomorphic Encryption, Cryptographic Protocols

Reference:

  • 1. Rivest, R.L., Adleman, L., & Dertouzos, M.L. (1978). On data banks and privacy homomorphisms. Foundations of Secure Computation, 169–180.
  • 2. Gentry, C. (2009). A fully homomorphic encryption scheme. Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC), 169–178.
  • 3. Brakerski, Z., & Vaikuntanathan, V. (2011). Efficient fully homomorphic encryption from (standard) LWE. IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS), 97–106.
  • 4. Brakerski, Z., Gentry, C., & Vaikuntanathan, V. (2014). (Leveled) fully homomorphic encryption without bootstrapping. ACM Transactions on Computation Theory, 6(3), 1–36.
  • 5. Fan, J., & Vercauteren, F. (2012). Somewhat practical fully homomorphic encryption. IACR Cryptology ePrint Archive, 2012/144.
  • 6. Cheon, J.H., Kim, A., Kim, M., & Song, Y. (2017). Homomorphic encryption for arithmetic of approximate numbers. Advances in Cryptology—ASIACRYPT 2017, 409–437.
  • 7. Paillier, P. (1999). Public-key cryptosystems based on composite degree residuosity classes. Advances in Cryptology—EUROCRYPT ’99, 223–238.
  • 8. Craig, S., Lauter, K., & Naehrig, M. (2013). Can homomorphic encryption be practical? Proceedings of the 3rd ACM Cloud Computing Security Workshop, 113–124.
  • 9. Halevi, S., & Shoup, V. (2014). Algorithms in HElib. Advances in Cryptology—CRYPTO 2014, 554–571.
  • 10. Bos, J.W., Lauter, K., Loftus, J., & Naehrig, M. (2013). Improved security for a ring-based fully homomorphic encryption scheme. Cryptography and Coding, 45–64.
  • 11. Chillotti, I., Gama, N., Georgieva, M., & Izabachène, M. (2016). Faster fully homomorphic encryption: Bootstrapping in less than a second. Advances in Cryptology—ASIACRYPT 2016, 3–33.
  • 12. Kim, M., & Lauter, K. (2015). Private genome analysis through homomorphic encryption. BMC Medical Informatics and Decision Making, 15(1), S3.
  • 13. Dowlin, N., Gilad-Bachrach, R., Laine, K., Lauter, K., Naehrig, M., & Wernsing, J. (2016). Manual for using homomorphic encryption for bioinformatics. Proceedings of the IEEE, 105(3), 552–567.
  • 14. Acar, A., Aksu, H., Uluagac, A.S., & Conti, M. (2018). A survey on homomorphic encryption schemes: Theory and implementation. ACM Computing Surveys, 51(4), 1–35.
  • 15. Polyakov, Y., Rohloff, K., & Ryan, G. (2017). PALISADE lattice cryptography library. Cybersecurity Research Center, NJIT.
  • 16. Microsoft SEAL. (2020). Simple Encrypted Arithmetic Library. Microsoft Research. Available at: https://www.microsoft.com/en-us/research/project/microsoft-seal/
  • 17. Chillotti, I., Ligier, D., & Paillier, P. (2018). An overview of lattice-based homomorphic encryption and its applications. Future Generation Computer Systems, 79, 951–967.
  • 18. Smart, N.P., & Vercauteren, F. (2010). Fully homomorphic encryption with relatively small key and ciphertext sizes. Public Key Cryptography—PKC 2010, 420–443.
  • 19. Vaikuntanathan, V. (2011). Computing blindfolded: New developments in fully homomorphic encryption. Proceedings of the 52nd IEEE Symposium on Foundations of Computer Science (FOCS), 5–16.