通信学报 ›› 2014, Vol. 35 ›› Issue (2): 111-117.doi: 10.3969/j.issn.1000-436x.2014.02.015

• 学术论文 • 上一篇    下一篇

利用容错学习问题构造基于身份的全同态加密体制

光焱1,2,祝跃飞1,费金龙1,2,顾纯祥1,2,郑永辉1,2   

  1. 1 解放军信息工程大学 四院,河南 郑州 450002;
    2 解放军信息工程大学 数学工程与先进计算国家重点实验室,河南 郑州 450002
  • 出版日期:2014-02-25 发布日期:2017-07-25
  • 基金资助:
    国家自然科学基金资助项目;河南省科技攻关计划基金资助项目;郑州市科技创新团队基金资助项目

Identity-based fully homomorphic encryption from learning with error problem

Yan GUANG1,2,Yue-fei ZHU1,Jin-long FEI1,2,Chun-xiang GU1,2,Yong-hui ZHENG1,2   

  1. 1 Fourth Institute, PLA Information Engineering University, Zhengzhou 450002, China;
    2 State Key Laboratory of Mathematical Engineering and Advanced Computing, PLA Information Engineering University, Zhengzhou 450002, China
  • Online:2014-02-25 Published:2017-07-25
  • Supported by:
    The National Natural Science Foundation of China;The Key Scientific and Technological Project of Henan Province;The Municipal Science and Technology Innovation Team Project of Zhengzhou

摘要:

基于容错学习问题构造的一类全同态加密体制在云计算安全领域具有重要的潜在应用价值,但同时普遍存在着公钥尺寸较大的缺陷,严重影响其身份认证与密钥管理的效率。将基于身份加密的思想与基于容错学习问题的全同态加密相结合,提出一种基于身份的全同态加密体制,能够有效克服公钥尺寸对于全同态加密应用效率的影响。在随机喻示模型下,体制的安全性归约到容错学习问题难解性和陷门单向函数单向性,并包含严格的安全性证明。

关键词: LWE问题, 全同态加密, 基于身份加密, 随机喻示模型

Abstract:

The fully homomorphic encryption schemes based on learning with errors problem own a great potential value in the cloud computing security. However, the existing schemes share a common flaw of large sized public keys, which may cause inefficiency of such schemes in the key and identity management. An identity-based fully homomorphic en-cryption scheme was presented. The scheme compromises the merits of both identity-based and fully homomorphic en-cryption schemes, and it overcomes the above mentioned flaw. The security of the proposed scheme reduces to the hard-ness of learning with errors problem and the one-wayness of trapdoor function in the random oracle model.

Key words: learning with error problem, fully homomorphic encryption, identity-based encryption, random oracle model

No Suggested Reading articles found!