Public key compression and modulus switching for fully homomorphic encryption over the integers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7237 LNCS, Issue , 2012, Pages 446-464

  Coron, Jean Sébastien ^a   Naccache, David ^b   Tibouchi, Mehdi ^c  

^a UNIVERSITY OF LUXEMBOURG   (Luxembourg)

^b ECOLE NORMALE SUPÉRIEURE   (France)

^c NTT CORPORATION   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE GCD; COMPRESSION TECHNIQUES; ENCRYPTION TECHNIQUE; FULLY HOMOMORPHIC ENCRYPTION; HOMOMORPHIC SCHEME; PUBLIC KEYS; RANDOM ORACLE MODEL; SWITCHING TECHNIQUES;

IMAGE QUALITY;

CRYPTOGRAPHY;

EID: 84859990706     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-29011-4_27     Document Type: Conference Paper

References (17)

1. Bernstein, D.J.: How to Find Smooth Parts of Integers (2004), http://cr.yp.to/papers.html#smoothparts
2. Brakerski, Z., Vaikuntanathan, V.: Efficient Fully Homomorphic Encryption from (Standard) LWE. In: Proceedings of FOCS 2011 (2011); Full version available at IACR eprint
3. Brakerski, Z., Vaikuntanathan, V.: Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 505-524. Springer, Heidelberg (2011)
4. Brakerski, Z., Gentry, C., Vaikuntanathan, V.: Fully Homomorphic Encryption without Bootstrapping. Cryptology ePrint Archive, Report 2011/277
5. Chen, Y., Nguyen, P.Q.: Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers. Cryptologye Print Archive, Report 2011/436
6. Coron, J.S., Naccache, D., Tibouchi, M.: Public-key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers. Full version of this paper. Cryptology ePrint Archive, Report 2011/440
7. Coron, J.-S., Mandal, A., Naccache, D., Tibouchi, M.: Fully Homomorphic Encryption over the Integers with Shorter PublicKeys. In:Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 487-504. Springer, Heidelberg (2011); Full version available at IACR eprint
8. Van Dijk, M., Gentry, C., Halevi, S., Vaikuntanathan, V.: Fully Homomorphic Encryption over the Integers. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 24-43. Springer, Heidelberg (2010)
9. Gentry, C.: A fully homomorphic encryption scheme. Ph.D. thesis, Stanford University (2009), http://crypto.stanford.edu/craig
10. Gentry, C., Halevi, S.: Implementing Gentry's Fully-Homomorphic Encryption Scheme. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 129-148. Springer, Heidelberg (2011)
11. Lauter, K., Naehrig, M., Vaikuntanathan, V.: Can Homomorphic Encryption be Practical? Cryptologye Print Archive, Report 2011/405
12. Lenstra, A.K.: Generating RSA Moduli with a Predetermined Portion. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol. 1514, pp. 1-10. Springer, Heidelberg (1998)
13. Lenstra, H.W.: Factoring integers with elliptic curves. Annals of Mathematics 126(3), 649-673 (1987)
14. Smart, N.P., Vercauteren, F.: Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol. 6056, pp. 420-443. Springer, Heidelberg (2010)
15. Stein, W.A., et al.: Sage Mathematics Software (Version 4.7.2), The Sage Development Team (2011), http://www.sagemath.org
16. Stehĺe, D., Steinfeld, R.: Faster Fully Homomorphic Encryption. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 377-394. Springer, Heidelberg (2010)
17. https://github.com/coron/fhe