Provided by: International Association for Cryptologic Research
Date Added: Jan 2013
Fully Homomorphic Encryption (FHE) allows a worker to perform implicit additions and multiplications on plaintext values while exclusively manipulating encrypted data. The authors extend the fully homomorphic encryption scheme over the integers of (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 cipher-text. Their variant remains semantically secure under the (error-free) approximate-GCD problem. They also show how to perform arbitrary permutations on the underlying plaintext vector given the cipher-text and the public key.