Call for Paper - January 2023 Edition
IJCA solicits original research papers for the January 2023 Edition. Last date of manuscript submission is December 20, 2022. Read More

Homomorphic Encryption Techniques for securing Data in Cloud Computing: A Survey

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Year of Publication: 2017
V. Biksham, D. Vasumathi

V Biksham and D Vasumathi. Homomorphic Encryption Techniques for securing Data in Cloud Computing: A Survey. International Journal of Computer Applications 160(6):1-5, February 2017. BibTeX

	author = {V. Biksham and D. Vasumathi},
	title = {Homomorphic Encryption Techniques for securing Data in Cloud Computing: A Survey},
	journal = {International Journal of Computer Applications},
	issue_date = {February 2017},
	volume = {160},
	number = {6},
	month = {Feb},
	year = {2017},
	issn = {0975-8887},
	pages = {1-5},
	numpages = {5},
	url = {},
	doi = {10.5120/ijca2017913063},
	publisher = {Foundation of Computer Science (FCS), NY, USA},
	address = {New York, USA}


Cloud computing is an arising computational model, where data and its several services associated with its scalable data centers in the cloud and can be obtained from the Internet. Computing gives an added amount of risk as vital services which are usually deployed to any third party, which creates the difficulty to enable data security, privacy factor, confidentiality, integrity, and authentication. Most of the users prefer to store their data inside the cloud in an encrypted/unoriginal format to decrease the security concerns. However, to perform any operation on data at server, cloud needs to first decrypt the data. This operation might cause the challenging issues like - confidentiality along with privacy of confidential data, stored inside the cloud. Here, This paper presents state of the art in this Homomorphic Encryption (HE) domain, and solve the problems of confidentiality and privacy of stored data in a cloud. HE is a kind of encryption mechanism that give ability to users for computations to be prosecuted on cipher text itself, thus producing an unoriginal/encrypted result when decrypted it shows similarity on the result of operations prosecuted on the plain text. Homomorphic Encryption is generally of two types i.e. Partial Homomorphic encryption (PHE) and Fully Homomorphic Encryption (FHE). FHE considered to be as more secure and efficient in the form of third party computations, since it gains the advantage of both properties - Additive as well as multiplicative homomorphism. Based on the research done in past years, identification of the problem in the existing system is also presented in this paper and have given our future research directions.


  1. Manish M Poteya, Dr C A Dhoteb, Mr Deepak H Sharmac, ”Homomorphic Encryption for Security of Cloud Data, Computing and Virtualization, 7th International Conference on Communication, Procedia Computer Science volume 79 pages 175 181 (2016).
  2. Maha TEBAA, Said EL HAJII, ”Secure Cloud Computing through Homomorphic Encryption”, International Journal of Advancements in Computing Technology(IJACT), Volume-5, Number-16, December 2013.
  3. Reem Alattas, Khaled Elleithy, ”Cloud Computing Algebra Homomorphic Encryption Scheme Based on Fermat’s Little Theorem”, The American Society of Engineering Education, ASEE 2013, Northfield, VT, USA, 09 December 2016.
  4. Ryan Hayward, Chia-Chu Chiangb, ”Parallelizing fully homomorphic encryption for a cloud environment”, Journal of Applied Research and Technology 13 (2015), 245-252.
  5. Frederik Armknecht et. al., ”A Guide to Fully Homomorphic Encryption”, iacr, 2015.
  6. Rivest, Ronald L., Len Adleman, Michael L. Dertouzos, ”On data banks and privacy homomorphisms.”, Foundations of secure computation 4.11 (1978): 169-180.
  7. Rivest, Ronald L., Adi Shamir and Len Adleman, ”A method for obtaining digital signatures and public-key cryptosystems.”, Communications of the ACM 21.2 (1978): 120- 126.
  8. A. C. Yao, ”Protocols for secure computations” (extended abstract). In 23rd Annual Symposium on Foundations of Computer Science (FOCS ’82), pages 160-164. IEEE, 1982.
  9. Goldwasser, Shafi and Silvio Micali, ”Probabilistic encryption”, Journal of computer and system sciences 28.2 (1984): 270-299.
  10. ElGamal, Taher, ”A public key cryptosystem and a signature scheme based on discrete logarithms”, Advances in cryptology. Springer Berlin Heidelberg, 1985.
  11. Paillier, Pascal, ”Public-key cryptosystems based on composite degree residuosity classes”, Advances Heidelberg, 1999, in cryptology-EUROCRYPT99.
  12. Fontaine, Caroline, Fabien Galand, ”A survey of homomorphic encryption for nonspecialists”, EURASIP Journal on Information Security (2007).
  13. Craig G., ”Fully homomorphic encryption using ideal lattices”, STOC. Vol. 9. 2009.
  14. Smart, Nigel P., Frederik Vercauteren, ”Fully homomorphic encryption with relatively small key and ciphertext sizes”, Public Key Cryptography-PKC, Springer Berlin Heidelberg, 2010, P-(420-443).
  15. Van Dijk, Marten, ”Fully homomorphic encryption over the integers”, Advances in cryptology-EUROCRYPT 2010. Springer Berlin Heidelberg, 2010. 24-43.
  16. Stehle, Damien, Ron Steinfeld, ”Faster fully homomorphic encryption”, Advances in Cryptology-ASIACRYPT 2010. Springer Berlin Heidelberg, 2010. 377-394.
  17. Ramaiah, Y. Govinda and G. Vijaya Kumari, ”Efficient public key homomorphic encryption over integer plaintexts”, Information Security and Intelligence Control (ISIC), 2012 International Conference on. IEEE, 2012.
  18. Shafi Goldwasser, Yael Kalai, ”Introduction to Homomorphic Encryption”, (6.889), New Developments in Cryptography, MIT CSAIL: February 1, 2011.


Cloud Environment, Data security, Homomorphic encryption, Privacy