Cryptology ePrint Archive: Report 2014/697

A Fully Homomorphic Encryption Scheme with Better Key Size

Zhigang Chen, Jian Wang, ZengNian Zhang , Xinxia Song

Abstract: Fully homomorphic encryption is faced with two problems now. One is candidate fully homomorphic encryption schemes are few. Another is that the efficiency of fully homomorphic encryption is a big question. In this paper, we propose a fully homomorphic encryption scheme based on LWE, which has better key size. Our main contributions are: (1) According to the binary-LWE recently, we choose secret key from binary set and modify the basic encryption scheme proposed in Linder and Peikert in 2010. We propose a fully homomorphic encryption scheme based on the new basic encryption scheme. We analyze the correctness and give the proof of the security of our scheme. The public key, evaluation keys and tensored ciphertext have better size in our scheme. (2) Estimating parameters for fully homomorphic encryption scheme is an important work. We estimate the concert parameters for our scheme. We compare these parameters between our scheme and Bra12 scheme. Our scheme have public key and private key that smaller by a factor of about logq than in Bra12 scheme. Tensored ciphertext in our scheme is smaller by a factor of about log2q than in Bra12 scheme. Key switching matrix in our scheme is smaller by a factor of about log3q than in Bra12 scheme.

Category / Keywords: public-key cryptography / Fully Homomorphic Encryption; public key encryption; Learning with error; concert parameters

Date: received 4 Sep 2014

Contact author: chzg99 at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20140905:190835 (All versions of this report)

Short URL: ia.cr/2014/697

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]