An Improved Leveled Fully Homomorphic Encryption Scheme over the Integers

A scale-invariant leveled fully homomorphic encryption (FHE) scheme over the integers is proposed by Coron et al. in PKC 2014, where the ciphertext noise increases linearly after each homomorphic multiplication. Then based on Coron’s variant of the approximate greatest common divisor problem, we construct a more efficient leveled FHE scheme over the integers without the modulus switching technique, which could resist chosen plaintext attacks. The inner product operation in our homomorphic multiplication is eliminated by multiplying the multiplication key directly. The homomorphic multiplication in our scheme is realized by the more simplified multiplication key, in which the number of integers is decreased from \(O(\varTheta \cdot \eta )\) to O(1) compared with Coron’s scheme. Simulation results and analysis show that our scheme’s performance of multiplication key and homomorphic multiplication is much more efficient than that of Coron’s scheme.

[1]  Jean-Sébastien Coron,et al.  Fully Homomorphic Encryption over the Integers with Shorter Public Keys , 2011, IACR Cryptol. ePrint Arch..

[2]  Jung Hee Cheon,et al.  CRT-based fully homomorphic encryption over the integers , 2015, Inf. Sci..

[3]  Brent Waters,et al.  Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based , 2013, CRYPTO.

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

[5]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[6]  Leonid A. Levin,et al.  A Pseudorandom Generator from any One-way Function , 1999, SIAM J. Comput..

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

[8]  Jean-Sébastien Coron,et al.  Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers , 2012, EUROCRYPT.

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

[10]  Jung Hee Cheon,et al.  Fully Homomophic Encryption over the Integers Revisited , 2015, EUROCRYPT.

[11]  Chris Peikert,et al.  Faster Bootstrapping with Polynomial Error , 2014, CRYPTO.

[12]  Jean-Sébastien Coron,et al.  Scale-Invariant Fully Homomorphic Encryption over the Integers , 2014, Public Key Cryptography.

[13]  Léo Ducas,et al.  FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second , 2015, EUROCRYPT.

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

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

[16]  Jung Hee Cheon,et al.  Batch Fully Homomorphic Encryption over the Integers , 2013, EUROCRYPT.

[17]  Craig Gentry,et al.  (Leveled) fully homomorphic encryption without bootstrapping , 2012, ITCS '12.