Fully homomorphic SIMD operations
- 1.2k Downloads
At PKC 2010 Smart and Vercauteren presented a variant of Gentry’s fully homomorphic public key encryption scheme and mentioned that the scheme could support SIMD style operations. The slow key generation process of the Smart–Vercauteren system was then addressed in a paper by Gentry and Halevi, but their key generation method appears to exclude the SIMD style operation alluded to by Smart and Vercauteren. In this paper, we show how to select parameters to enable such SIMD operations. As such, we obtain a somewhat homomorphic scheme supporting both SIMD operations and operations on large finite fields of characteristic two. This somewhat homomorphic scheme can be made fully homomorphic in a naive way by recrypting all data elements separately. However, we show that the SIMD operations can be used to perform the recrypt procedure in parallel, resulting in a substantial speed-up. Finally, we demonstrate how such SIMD operations can be used to perform various tasks by studying two use cases: implementing AES homomorphically and encrypted database lookup.
KeywordsFully homomorphic encryption Implementation SIMD operations
Mathematics Subject Classification (2010)94A60
Unable to display preview. Download preview PDF.
- 2.Brakerski Z., Gentry C., Vaikuntanathan V.: Fully homomorphic encryption without bootstrapping. Innovations in Theoretical Computer Science, ITCS 2012, 309–325, ACM (2012);Google Scholar
- 8.Damgård I., Keller M.: Secure multiparty AES. Financial Cryptography, FC 2010(Lecture Notes in Computer Science 6052), 367–374 (2010)Google Scholar
- 9.Damgård I., Pastro V., Smart N.P., Zakarias S.: Multiparty computation from somewhat homomorphic encryption. Adv. Cryptol. Crypto (2012, in press).Google Scholar
- 10.Gentry C.: Fully homomorphic encryption using ideal lattices. Symposium on Theory of Computing, STOC 2009, ACM, 169–178, (2009).Google Scholar
- 11.Gentry C.: A fully homomorphic encryption scheme. Manuscript (2009).Google Scholar
- 15.Gentry C., Halevi S., Smart N.P.: Homomorphic evaluation of the AES circuit. Adv. Cryptol. Crypto (2012, in press).Google Scholar
- 16.Gentry C., Halevi S., Smart N.P.: Ring switching in BGV-style homomorphic encryption. IACR ePrint 2012/240, http://eprint.iacr.org/2012/240/.
- 18.Kushilevitz E., Ostrovsky R.: Replication is not needed: single database, computationally-private information retrieval. Foundations of Computer Science, FoCS ’97, pp. 364–373 (1997).Google Scholar
- 19.Lauter K., Naehrig M., Vaikuntanathan V.: Can homomorphic encryption be practical? Cloud Computing Security Workshop, CCSW 2011, pp. 113–124, ACM, (2011).Google Scholar
- 20.Pinkas B., Schneider T., Smart N.P., Williams S.C.: Secure two-party computation is practical. Advances in Cryptology, Asiacrypt 2009. Lecture Notes in Computer Science 5912(250–267), 5912–250267 (2009)Google Scholar
- 22.Scholl P., Smart N.P.: Improved key generation for Gentry’s fully homomorphic encryption scheme. Cryptography and Coding, IMACC 2011. Lecture Notes in Computer Science 7089, 10–22 (2011).Google Scholar
- 25.Thomas L.H.: Using a computer to solve problems in physics. Application of Digital Computers, Ginn, Boston (1963).Google Scholar