Analysis and Comparison of Various Fully Homomorphic Encryption Techniques

Calculations can be carried out on encrypted form of data- is the essence of homomorphic encryption. Homomorphic encryption has resolved the security issues for storing data on the third-party systems (e.g. cloud or untrusted computer, service providers etc.). Most significant category of homomorphic encryption is fully homomorphic encryption. It permits unbounded number of operations on the encrypted form of data and output by system is within the ciphertext space. This paper provides the essentials of Homomorphic encryption and its various classifications i.e. partially homomorphic encryption, somewhat homomorphic encryption and fully homomorphic encryption. Mainly emphasizes on full homomorphic encryption and an investigation of different full homomorphic encryption schemes that uses the hardness of Ideal-lattice, integers, learning with error, elliptic curve cryptography based.

[1]  Mauro Conti,et al.  A Survey on Homomorphic Encryption Schemes , 2017, ACM Comput. Surv..

[2]  Frederik Vercauteren,et al.  Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes , 2010, Public Key Cryptography.

[3]  Nick Howgrave-Graham,et al.  Approximate Integer Common Divisors , 2001, CaLC.

[4]  Peng-Yu Wang,et al.  Homomorphic Encryption Scheme Based on Elliptic Curve Cryptography for Privacy Protection of Cloud Computing , 2016, 2016 IEEE 2nd International Conference on Big Data Security on Cloud (BigDataSecurity), IEEE International Conference on High Performance and Smart Computing (HPSC), and IEEE International Conference on Intelligent Data and Security (IDS).

[5]  Frederik Vercauteren,et al.  Fully homomorphic SIMD operations , 2012, Designs, Codes and Cryptography.

[6]  Taher ElGamal,et al.  A public key cyryptosystem and signature scheme based on discrete logarithms , 1985 .

[7]  Craig Gentry,et al.  Fully Homomorphic Encryption over the Integers , 2010, EUROCRYPT.

[8]  Dan Boneh,et al.  Evaluating 2-DNF Formulas on Ciphertexts , 2005, TCC.

[9]  Craig Gentry,et al.  Implementing Gentry's Fully-Homomorphic Encryption Scheme , 2011, EUROCRYPT.

[10]  S. Halevi,et al.  Design and Implementation of a Homomorphic-Encryption Library , 2012 .

[11]  Pascal Paillier,et al.  Public-Key Cryptosystems Based on Composite Degree Residuosity Classes , 1999, EUROCRYPT.

[12]  B. Barak.  Fully Homomorphic Encryption and Post Quantum Cryptography , 2010 .

[13]  Vinod Vaikuntanathan,et al.  Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages , 2011, CRYPTO.

[14]  Oded Regev,et al.  On lattices, learning with errors, random linear codes, and cryptography , 2009, JACM.

[15]  Craig Gentry,et al.  A fully homomorphic encryption scheme , 2009 .

[16]  Konstantin G. Kogos,et al.  Research of homomorphic encryption algorithms over integers , 2017, 2017 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering (EIConRus).

[17]  Rutvij H. Jhaveri,et al.  Survey of Various Homomorphic Encryption algorithms and Schemes , 2014 .

[18]  Craig Gentry,et al.  Fully homomorphic encryption using ideal lattices , 2009, STOC '09.

[19]  Ronald L. Rivest,et al.  ON DATA BANKS AND PRIVACY HOMOMORPHISMS , 1978 .