Survey of Various Homomorphic Encryption algorithms and Schemes

  • V.Parmar P
  • B. Padhar S
  • N. Patel S
  • et al.
N/ACitations
Citations of this article
125Readers
Mendeley users who have this article in their library.

Abstract

Homomorphic encryption is the encryption scheme which means the operations on the encrypted data. Homomorphic encryption can be applied in any system by using various public key algorithms. When the data is transferred to the public area, there are many encryption algorithms to secure the operations and the storage of the data. But to process data located on remote server and to preserve privacy, homomorphic encryption is useful that allows the operations on the cipher text, which can provide the same results after calculations as the working directly on the raw data. In this paper, the main focus is on public key cryptographic algorithms based on homomorphic encryption scheme for preserving security. The case study on various principles and properties of homomorphic encryption is given and then various homomorphic algorithms using asymmetric key systems such as RSA, ElGamal, Paillier algorithms as well as various homomorphic encryption schemes such as Brakerski-Gentry-Vaikuntanathan (BGV), Enhanced homomorphic Cryptosystem (EHC), Algebra homomorphic encryption scheme based on updated ElGamal (AHEE), Non-interactive exponential homomorphic encryption scheme (NEHE) are investigated.

Cite

CITATION STYLE

APA

V.Parmar, P., B. Padhar, S., N. Patel, S., I. Bhatt, N., & H. Jhaveri, R. (2014). Survey of Various Homomorphic Encryption algorithms and Schemes. International Journal of Computer Applications, 91(8), 26–32. https://doi.org/10.5120/15902-5081

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free