Homomorphic Encryption Property Algorithms

Krishna K. Wadiwala, Hetal N. Patel

Abstract


The demand for privacy of digital data increased over the last decade. The new invention in cryptography world is Homomorphic Encryption (HE). HE enables operation on cipher text without knowing the plaintext and private key. When receiver decrypts the result of any operation, it is the same as if the receiver carried out the calculation on the plain text. HE has some specific property. There are two properties in homomorphic encryption, Additive HE and Multiplicative HE. Homomorphic encryption is divided into three parts, Partially Homomorphic Encryption (PHE), Somewhat Homomorphic Encryption (SWHE), Fully Homomorphic Encryption (FHE). In partially homomorphic encryption carried out only one operation on the cipher text either additive or multiplicative. In case of fully homomorphic encryption, allow arbitrary computation on the cipher text in somewhat homomorphic encryption system, only one multiplication operation and any number of additions are allowed. Cloud computing is an ever-growing field in today‘s era. HE specially used for cloud computing where user store the data in encrypted form, so the cloud provider is unable to recognize the data.

Cite this Article
Krishna K. Wadiwala, Hetal N. Patel. Homomorphic Encryption Property Algorithms. Research & Reviews: A Journal of Embedded System & Applications. 2017; 5(3): 7–11p.


Keywords


Homomorphic encryption, cryptography, algorithm

Full Text:

PDF

Refbacks

  • There are currently no refbacks.


Copyright (c) 2018 Journal of Embedded System & Applications