Cryptology ePrint Archive: Report 2013/036
Batch Fully Homomorphic Encryption over the Integers
Jean-Sébastien Coron and Tancrède Lepoint and Mehdi Tibouchi
Abstract: We extend the fully homomorphic encryption scheme over the integers of van Dijk et al. (DGHV) to batch fully homomorphic encryption, i.e. to a scheme that supports encrypting and homomorphically processing a vector of plaintext bits as a single ciphertext. Our variant remains semantically secure under the (error-free) approximate GCD problem. We also show how to perform arbitrary permutations on the underlying plaintext vector given the ciphertext and the public key. Our scheme offers competitive performance: we describe an implementation of the fully homomorphic evaluation of AES encryption, with an amortized cost of about 12 minutes per AES ciphertext on a standard desktop computer; this is comparable to the timings presented by Gentry et al. at Crypto 2012 for their implementation of a Ring-LWE based fully homomorphic encryption scheme.
Category / Keywords: public-key cryptography / Fully Homomorphic Encryption, Batch Encryption, Homomorphic AES
Publication Info: An extended abstract will appear at Eurocrypt 2013, merged with some independent but overlapping work from Cheon et al.
Date: received 25 Jan 2013
Contact author: jscoron at tranef com
Available format(s): PDF | BibTeX Citation
Version: 20130129:223708 (All versions of this report)
Short URL: ia.cr/2013/036
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]