Cryptology ePrint Archive: Report 2015/468

Practical Fully Homomorphic Encryption without Noise Reduction

Dongxi Liu

Abstract: We present a new fully homomorphic encryption (FHE) scheme that is efficient for practical applications. The main feature of our scheme is that noise reduction considered essential in current FHE schemes, such as boot strapping and modulus switching, is not needed in our scheme, because it allows arbitrarily large noises in its ciphertexts. A ciphertext in our scheme is a vector with its dimension specified as a security parameter of the encryption key. The dimension of ciphertexts does not change with homomorphic operations and all ciphertext elements are in a finite domain, so our scheme is compact. In addition, our scheme can directly encrypt big integers, rather than only bit messages.

We proved the hardness of recovering encryption keys from any number of ciphertexts with chosen plaintexts and then the semantic security of our scheme. The hardness of recovering keys from ciphertexts is based on the approximate greatest common divisors problem. We implemented a prototype of our scheme and evaluated its concrete performance extensively from the aspects of encryption, decryption, homomorphic operations, and bitwise operators over ciphertexts. The efficiency of our scheme is confirmed by the evaluation result.

Category / Keywords: foundations / Fully Homomorphic Encryption, Implementation, Practical Efficiency

Date: received 17 May 2015

Contact author: dongxi liu at csiro au

Available format(s): PDF | BibTeX Citation

Version: 20150518:074818 (All versions of this report)

Short URL: ia.cr/2015/468

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]