| 注册
首页|期刊导航|电子学报|基于NTRU的全同态加密方案

基于NTRU的全同态加密方案

李子臣 张卷美 杨亚涛 张峰娟

电子学报2018,Vol.46Issue(4):938-944,7.
电子学报2018,Vol.46Issue(4):938-944,7.DOI:10.3969/j.issn.0372-2112.2018.04.023

基于NTRU的全同态加密方案

A Fully Homomorphic Encryption Scheme Based on NTRU

李子臣 1张卷美 2杨亚涛 2张峰娟3

作者信息

  • 1. 北京印刷学院,北京102600
  • 2. 北京电子科技学院,北京100070
  • 3. 西安电子科技大学通信工程学院,陕西西安710071
  • 折叠

摘要

Abstract

A fully homomorphic encrgption scheme was presented based on number theory research unit (NTRU),which is provable security about indistinguishable chosen plaintext attack (IND-CPA).Firstly,to avoid the effective lattice attacks,we modified the key generation algorithm of NTRU by Gaussian abstraction algorithm of lattices,and the distribution of the key is not changed.Then,we proposed a new homomorphic encrypfion scheme based on the improved NTRU encryption algorithm by using the Flattening technique.Its IND-CPA security was proved strictly under the standard model.

关键词

全同态加密/公钥密码体制NTRU/高斯抽样算法/可证明安全

Key words

fully homomorphic encryption/number theory research unit/Gaussian abstraction algorithm/provable security

分类

信息技术与安全科学

引用本文复制引用

李子臣,张卷美,杨亚涛,张峰娟..基于NTRU的全同态加密方案[J].电子学报,2018,46(4):938-944,7.

基金项目

国家自然科学基金(No.61370188) (No.61370188)

“十三五”国家密码发展基金(No.MMJJ20170110) (No.MMJJ20170110)

电子学报

OA北大核心CSCDCSTPCD

0372-2112

访问量0
|
下载量0
段落导航相关论文