CRT-based fully homomorphic encryption over the integers

Information Sciences

Volumn 310, Issue , 2015, Pages 149-162

  Cheon, Jung Hee ^a   Kim, Jinsu ^a   Lee, Moon Sung ^a   Yun, Aaram ^b  

^a Seoul National University   (South Korea)

^b Ulsan National Institute of Science and Technology   (South Korea)

Author keywords

Approximate gcd; Chinese remainder theorem; DGHV; Homomorphic encryption; Privacy homomorphism

Indexed keywords

COMPUTATION THEORY; SECURITY OF DATA;

APPROXIMATE GCD; CHINESE REMAINDER THEOREM; DGHV; HO-MOMORPHIC ENCRYPTIONS; PRIVACY HOMOMORPHISM;

CRYPTOGRAPHY;

EID: 84926687996     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2015.03.019     Document Type: Article

References (28)

1. Z. Brakerski Fully homomorphic encryption without modulus switching from classical gapsvp R. Safavi-Naini, R. Canetti, Advances in Cryptology - CRYPTO 2012 Lecture Notes in Comput. Sci. vol. 7417 2012 Springer Berlin, Heidelberg 868 886
2. Z. Brakerski, and V. Vaikuntanathan Fully homomorphic encryption from ring-lwe and security for key dependent messages P. Rogaway, Advances in Cryptology - CRYPTO 2011 Lecture Notes in Comput. Sci. vol. 6841 2011 Springer Berlin, Heidelberg 505 524
3. E.F. Brickell, and Y. Yacobi On privacy homomorphisms (extended abstract) D. Chaum, W. Price, Advances in Cryptology - EUROCRYPT 1987 Lecture Notes in Comput. Sci. vol. 304 1988 Springer Berlin, Heidelberg 117 125
4. Y. Chen, and P. Nguyen Faster algorithms for approximate common divisors: breaking fully-homomorphic-encryption challenges over the integers D. Pointcheval, T. Johansson, Advances in Cryptology - EUROCRYPT 2012 Lecture Notes in Comput. Sci. vol. 7237 2012 Springer Berlin, Heidelberg 502 519
5. J.H. Cheon, J.-S. Coron, J. Kim, M.S. Lee, T. Lepoint, M. Tibouchi, and A. Yun Batch fully homomorphic encryption over the integers T. Johansson, P. Nguyen, Advances in Cryptology - EUROCRYPT 2013 Lecture Notes in Comput. Sci. vol. 7881 2013 Springer Berlin, Heidelberg 315 335
6. H. Cohn, N. Heninger, Approximate common divisors via lattices, in: ANTS X, 2012, THE OPEN BOOK SERIES 1, MSP, 2013. < http://msp.org/obs/2013/1-1/obs-v1-n1-p14-p.pdf >.
7. J.H. Cheon, J. Kim, An Approach to Reduce Storage for Homomorphic Computations, Cryptology ePrint Archive, Report 2013/710, 2013. < http://eprint.iacr.org/ >.
8. J.H. Cheon, W.-H. Kim, and H.S. Nam Known-plaintext cryptanalysis of the Domingo-Ferrer algebraic privacy homomorphism scheme Inf. Process. Lett. 97 2006 118 123
9. J.-S. Coron, T. Lepoint, M. Tibouchi, Batch Fully Homomorphic Encryption Over the Integers, Cryptology ePrint Archive, Report 2013/036, 2013.
10. J.-S. Coron, T. Lepoint, and M. Tibouchi Scale-Invariant Fully Homomorphic Encryption Over the Integers H. Krawczyk, Public-Key Cryptography - PKC 2014 Lecture Notes in Comput. Sci. vol. 8383 2014 Springer Berlin, Heidelberg 311 328
11. J.-S. Coron, A. Mandal, D. Naccache, and M. Tibouchi Fully homomorphic encryption over the integers with shorter public keys P. Rogaway, Advances in Cryptology - CRYPTO 2011 Lecture Notes in Comput. Sci. vol. 6841 2011 Springer Berlin, Heidelberg 487 504
12. J.-S. Coron, D. Naccache, and M. Tibouchi Public key compression and modulus switching for fully homomorphic encryption over the integers D. Pointcheval, T. Johansson, Advances in Cryptology - EUROCRYPT 2012 Lecture Notes in Comput. Sci. vol. 7237 2012 Springer Berlin, Heidelberg 446 464
13. M. van Dijk, C. Gentry, S. Halevi, and V. Vaikuntanathan Fully homomorphic encryption over the integers H. Gilbert, Advances in Cryptology - EUROCRYPT 2010 Lecture Notes in Comput. Sci. vol. 6110 2010 Springer Berlin, Heidelberg 24 43
14. C. Gentry Fully homomorphic encryption using ideal lattices Proceedings of the 41st Annual ACM Symposium on Theory of Computing STOC '09 2009 ACM New York, NY, USA 169 178
15. C. Gentry Toward basing fully homomorphic encryption on worst-case hardness T. Rabin, Advances in Cryptology - CRYPTO 2010 Lecture Notes in Comput. Sci. vol. 6223 2010 Springer Berlin, Heidelberg 116 137
16. C. Gentry, and S. Halevi Fully homomorphic encryption without squashing using depth-3 arithmetic circuits Proceedings of the 2011 IEEE 52Nd Annual Symposium on Foundations of Computer Science FOCS '11 2011 IEEE Computer Society Washington, DC, USA 107 109
17. C. Gentry, and S. Halevi Implementing gentry's fully-homomorphic encryption scheme K. Paterson, Advances in Cryptology - EUROCRYPT 2011 Lecture Notes in Comput. Sci. vol. 6632 2011 Springer Berlin, Heidelberg 129 148
18. C. Gentry, S. Halevi, and N. Smart Fully homomorphic encryption with polylog overhead D. Pointcheval, T. Johansson, Advances in Cryptology - EUROCRYPT 2012 Lecture Notes in Computer Science vol. 7237 2012 Springer Berlin, Heidelberg 465 482
19. C. Gentry, S. Halevi, and N. Smart Homomorphic evaluation of the AES circuit R. Safavi-Naini, R. Canetti, Advances in Cryptology - CRYPTO 2012 Lecture Notes in Comput. Sci. vol. 7417 2012 Springer Berlin, Heidelberg 850 867
20. N. Howgrave-Graham, Approximate integer common divisors, in: CaLC, 2001, pp. 51-66.
21. J.C. Lagarias The computational complexity of simultaneous diophantine approximation problems SIAM J. Comput. 14 1985 196 209
22. H.W. Lenstra Jr. Factoring integers with elliptic curves Ann. Math. 126 1987 649 673
23. Memoirs of the 6th Cryptology Paper Contest, Arranged by Korea Communications Commission, 2012.
24. R. Rivest, L. Adleman, and M. Dertouzos On data banks and privacy homomorphism Found. Secure Comput. 1978 168 177
25. D. Stehlé, and R. Steinfeld Faster fully homomorphic encryption M. Abe, Advances in Cryptology - ASIACRYPT 2010 Lecture Notes in Comput. Sci. vol. 6477 2010 Springer Berlin, Heidelberg 377 394
26. P. Scholl, and N. Smart Improved key generation for gentry's fully homomorphic encryption scheme L. Chen, Cryptography and Coding Lecture Notes in Comput. Sci. vol. 7089 2011 Springer Berlin, Heidelberg 10 22
27. N. Smart, and F. Vercauteren Fully homomorphic encryption with relatively small key and ciphertext sizes P. Nguyen, D. Pointcheval, Public Key Cryptography - PKC 2010 Lecture Notes in Computer Science vol. 6056 2010 Springer Berlin, Heidelberg 420 443
28. D. Wagner, Cryptanalysis of an algebraic privacy homomorphism, in: ISC, 2003, pp. 234-239.