Fully Homomorphic symmetric scheme without bootstrapping

Capability of operating over encrypted data makes Fully Homomorphic Encryption(FHE)the Holy Grail for secure data processing applications. Though many applications need only secret keys, FHE has not been achieved properly through symmetric cryptography. Major hurdle is the need to refresh noisy ciphertexts which essentially requires public key and bootstrapping. We introduce a refreshing procedure to make a somewhat homomorphic scheme, fully homomorphic without requiring bootstrapping. Our scheme uses symmetric keys and has performance superior to existing public-key schemes.

[1]  G. Vijaya Kumari,et al.  Efficient Public Key Generation for Homomorphic Encryption over the Integers , 2012 .

[2]  Iti Sharma,et al.  A fully homomorphic encryption scheme with symmetric keys with application to private data processing in clouds , 2013, 2013 Fourth International Conference on the Network of the Future (NoF).

[3]  Joan Feigenbaum,et al.  Proceedings of the forty-fifth annual ACM symposium on Theory of computing , 2013, STOC 2013.

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

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

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

[7]  Cao Yunfei.  Faster fully homomorphic encryption scheme over integer , 2012 .

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

[9]  Josep Domingo.  A new privacy homomorphism and applications , 1996 .

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

[11]  I-Ling Yen,et al.  An Efficient Homomorphic Encryption Protocol for Multi-User Systems , 2012, IACR Cryptol. ePrint Arch..

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

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

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

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

[16]  Jung Hee Cheon,et al.  A Cryptanalysis of the Original Domingo-Ferrer's Algebraic Privacy Homomophism , 2003, IACR Cryptol. ePrint Arch..

[17]  Vinod Vaikuntanathan,et al.  Attribute-based encryption for circuits , 2013, STOC '13.