Efficient Fully Homomorphic Encryption with Circularly Secure Key Switching Process
Fully homomorphic encryption (FHE) has important applications in cloud computing.However,almost all of the fully homomorphic encryption schemes share two common flaws that they all use secret keys of large scales and some operations are inefficient.In this paper,the ”special b” variant of the Learning With Errors (LWE) 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 et al”s scheme,our scheme reduces the 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.
circular security fully homomorphic encryption LWE problem
国内会议
湖北恩施
英文
1-6
2014-09-13（万方平台首次上网日期，不代表论文的发表时间）