作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程

• 安全技术 • 上一篇    下一篇

基于LWE的BGN类CPA安全加密方案设计与应用

毋光先 1,刘年义 1,刘博雅 2   

  1. (1.焦作师范高等专科学校 数学学院,河南 焦作 454150; 2.北京电子科技学院,北京 100070)
  • 收稿日期:2015-12-10 出版日期:2016-12-15 发布日期:2016-12-15
  • 作者简介:毋光先(1972—),男,副教授,主研方向为数据安全、数论;刘年义,副教授;刘博雅,硕士研究生。
  • 基金资助:
    国家自然科学基金(61370188)。

Design and Application of BGN-type CPA Secure Encryption Scheme Based on LWE

WU Guangxian  1,LIU Nianyi  1,LIU Boya  2   

  1. (1.School of Mathematics,Jiaozuo Teachers College,Jiaozuo,Henan 454150,China;2.Beijing Electronic Science and Technology Institute,Beijing 100070,China)
  • Received:2015-12-10 Online:2016-12-15 Published:2016-12-15

摘要: 针对GHV方案对二元明文矩阵加密导致密文扩展率较高的缺陷,提出一种针对p元明文矩阵的BGN类公钥加密方案。给出不可区分性选择明文攻击的安全性证明和Somewhat同态性分析,并应用于隐私信息检索协议的构造。分析结果表明,与原始GHV方案相比,该方案不但具有多次加法同态和一次乘法同态性质,而且在明文空间上做出了一定的编码修改,将密文扩展率从logq降低至logq/logp。

关键词: 错误学习, BGN类公钥加密, 不可区分性选择明文攻击, Somewhat同态, 隐私信息检索

Abstract: Aiming at the awful encryption expansion rate while encrypting a binary plaintext matrix in GHV scheme,a BGN-type public cryptosystem is proposed for p plaintext matrix.It gives the security proof and analyzes the Somewhat homomorphism of Indistinguishability under Chosen Plaintext Attack(IND-CPA),and the new scheme is applied to the construction of privacy information retrieval protocol.Compared with the original GHV scheme,analysis results show that the proposed scheme not only supports multiple homomorphic addition and a single homomorphic multiplication,but also makes some encoding modification in the plaintext space.The ciphertext extension rate is reduced to logq/logp from logq.

Key words: Learning with Error(LWE), BGN-type public cryptosystem, Indistinguishability under Chosen Plaintext Attack(IND-CPA), Somewhat homomorphism, Privacy Information Retrieval(PIR)

中图分类号: