Cryptology ePrint Archive: Report 2015/466

Efficient Fully Homomorphic Encryption with Circularly Secure Key Switching Process

Zhou Tanping*, Yang Xiaoyuan, Zhang Wei and Wu Liqiang

Abstract: Fully homomorphic encryption (FHE) has important applications in cloud computing. However, almost all fully homomorphic encryption schemes share two common flaws that they all use large-scale secret keys and some operations inefficient. In this paper, the “special b” variant of the Learning With Errors problem (bLWE) is presented, and helps us construct the first circularly secure key switching process which can replace the key switching process and similar re-linearization process used by the existing FHE schemes. Then, we present an efficient FHE. Compared with Brakerski’s scheme, our scheme reduces L secret keys to one and is more efficient. Finally, we prove the chosen-plaintext attack (CPA) security of the fully homomorphic scheme and the circular security of key switching process in standard model under the learning with errors problem (LWE) assumption.

Category / Keywords: public-key cryptography / circular security; fully homomorphic encryption; LWE problem

Date: received 16 May 2015

Contact author: 850301775 at qq com

Available format(s): PDF | BibTeX Citation

Note: no

Version: 20150517:090653 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]