Practical private-key fully homomorphic encryption in rings

Abstract We describe a practical fully homomorphic encryption (FHE) scheme based on homomorphisms between rings and show that it enables very efficient computation on encrypted data. Our encryption though is private-key; public information is only used to operate on encrypted data without decrypting it. Still, we show that our method allows for a third party search on encrypted data.

[1]  Dima Grigoriev,et al.  Homomorphic public-key cryptosystems over groups and rings , 2003, ArXiv.

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

[3]  Shai Halevi,et al.  Algorithms in HElib , 2014, CRYPTO.

[4]  R. Stephenson.  A and V , 1962, The British journal of ophthalmology.

[5]  Léo Ducas,et al.  FHE Bootstrapping in less than a second , 2014, IACR Cryptol. ePrint Arch..

[6]  Vinod Vaikuntanathan,et al.  Efficient Fully Homomorphic Encryption from (Standard) LWE , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

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

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