ISSN 1000-1239 CN 11-1777/TP

计算机研究与发展 ›› 2015, Vol. 52 ›› Issue (6): 1389-1393.doi: 10.7544/issn1000-1239.2015.20131952

• 信息安全 • 上一篇    下一篇



  1. (武警工程大学网络与信息安全武警部队重点实验室 西安 710086) (武警工程大学电子技术系 西安 710086) (
  • 出版日期: 2015-06-01
  • 基金资助: 

Application of a Circular Secure Variant of LWE in the Homomorphic Encryption

Yang Xiaoyuan, Zhou Tanping, Zhang Wei, Wu Liqiang   

  1. (Network and Information Security Key Laboratory, Engineering University of the Armed Police Force, Xi’an 710086) (Electronics Department, Engineering University of the Armed Police Force, Xi’an 710086)
  • Online: 2015-06-01

摘要: 同态加密在云计算等领域具有重要的应用价值,针对现有同态加密方案中私钥个数多和需要预设乘法同态次数的缺陷,基于一个具有特殊b的误差学习问题(learning with errors problem, LWE)变种bLWE(the “special b” variant of the learning with errors problem),得到具有循环安全性的重线性化过程,据此构造了一个较高效的同态加密方案.与Brakerski等人的方案相比,方案的构造者不需要事先知道服务器中乘法同态次数,且私钥个数由原来的L+1个大幅度地缩小为1个.最后,在标准模型下对重线性化过程的循环安全性和方案的CPA安全性进行了严格证明.

关键词: 循环安全, 同态加密, LWE问题, 格, 标准模型

Abstract: Homomorphic encryption scheme is a powerful cryptographic system which allows for a variety of applications. Fully homomorphic encryption(FHE) permits arbitrary computations on encrypted data. The recent breakthrough work in 2009 by Craig Gentry has shown the possibility of FHE schemes, and has provided the first construction. Consequently, during the past five years, numerous FHE involving novel mathematical techniques and a number of application schemes have appeared. Indeed, the construction and application of homomorphic encryption schemes have great theoretic and practical meaning. Homomorphic encryption has important applications in cloud computing. However, almost all of the homomorphic encryption schemes share two common flaws that the multiplication depth must be set in advance and they all use secret keys of large scales. We construct a circularly secure re-linearization process based on the “special b” variant of the learning with errors problem(bLWE). Then, we present an efficient homomorphic encryption scheme. Compared with Brakerski et al’s scheme, our scheme reduces the L+1 secret keys to one and doesn’t need to know the multiplication depth in advance. Finally, we prove the chosen-plaintext attack(CPA) security of the homomorphic scheme and the circular security of the re-linearization process in standard model by reducing them into learning with errors problem(LWE) assumption.

Key words: circular security, homomorphic encryption, learning with errors problem(LWE), lattice, standard model