CRT-based fully homomorphic encryption over the integers
In 1978, Rivest, Adleman and Dertouzos introduced the basic concept of privacy homomorphism that allows computation on encrypted data without decryption. It was an interesting work whose idea precedes the recent development of fully homomorphic encryption, although actual example schemes proposed in the paper are all susceptible to simple known-plaintext attacks. In this paper, we revisit one of their proposals, in particular the third scheme which is based on the Chinese Remainder Theorem and is ring homomorphic. It is known that only a single pair of known plaintext/ciphertext is needed to break this scheme. However, by exploiting the standard technique to insert an error to a message before encryption, we can cope with this problem. We present a secure modification of their proposal by showing that the proposed scheme is fully homomorphic and secure against the chosen plaintext attacks under the approximate GCD assumption and the sparse subset sum assumption when the message space is restricted to Z 2 k . Interestingly, the proposed scheme can be regarded as a generalization of the DGHV scheme with larger plaintext space. Our scheme has O ? ( ? 5 ) ciphertext expansion overhead while the DGHV has O ? ( ? 8 ) for the security parameter ? ? . When restricted to the homomorphic encryption scheme with depth of O(log?) O ( log ? ) , the overhead is reduced to O ? ( ? ) . Our scheme can be used in applications requiring a large message space ZQ Z Q for logQ=O(?4) log Q = O ( ? 4 ) , or SIMD style operations on Z Q k for log Q = O ( ? ) , k = O ( ? 3 ) , with O ? ( ? 5 ) ciphertext size as in the DGHV.
94a60 94a15 14g50