期刊文献+

一种NTRU格上基于身份全同态加密体制设计 被引量:5

An Identity-Based Fully Homomorphic Encryption Over NTRU Lattice
下载PDF
导出
摘要 全同态加密可以用来解决云计算环境中的隐私保护问题,然而现有体制具有系统参数大、效率低的缺点.针对现有攻击技术,首先设计了一种高效的NTRU格上的基于身份公钥加密体制,无需借助额外的安全性假设,具有更高的安全性和更小的系统参数.之后,基于近似特征向量技术,构造了一种高效的全同态加密转化方式.通过将以上两种方法结合,给出了一种高效的基于身份全同态加密体制.和现有体制相比,除了不需要计算密钥、实现了真正意义上的基于身份特性以外,还减小了密钥、密文尺寸,提高了计算和传输效率. Fully homomorphic encryption can be used to solve privacy concerns for data over cloud,while large parameters and low efficiency are the universal issues for present schemes.To oppose mainstream attacks,an identity-based public key scheme over NTRU lattice with smaller parameters,higher security level,and without additional security assumptions is put forward.Take advantage of the approximate eigenvector technique,an efficient fully homomorphic encryption transformation method is raised.And by combining the two skills above,an efficient identity-based fully homomorphic encryption scheme is proposed.Compared with existing schemes,the schemes is fully identity-based without evaluation key,and has smaller keys and ciphertext sizes,leading to higher transmission and computational efficiency.
作者 段然 顾纯祥 祝跃飞 郑永辉 陈莉 DUAN Ran;GU Chun-xiang;ZHU Yue-fei;ZHENG Yong-hui;CHEN Li(Fourth Department,PLA Information Engineering University,Zhengzhou,Henan 450002,China;State Key Laboratory of Mathematical Engineering and Advanced Computing,Wuxi,Jiangsu 214125,China;Institute of Network Information Security,Henan University of Economics and Law,Zhengzhou,Henan 450046,China)
出处 《电子学报》 EI CAS CSCD 北大核心 2018年第10期2410-2417,共8页 Acta Electronica Sinica
基金 国家自然科学基金(No.61502533) 河南省科技创新杰出青年基金(No.134100510002) 河南省高校科技创新人才支持计划(No.13HASTIT043) 河南省基础与前沿技术研究(No.142300410002) 河南省自然科学基金(No.162300410335)
关键词 全同态加密 基于身份加密 环上带错学习问题 NTRU格 近似特征向量 fully homomorphic encryption identity-based encryption learning with errors over rings number theory research unit(NTRU)lattice approximate eigenvector
  • 相关文献

参考文献7

二级参考文献38

  • 1REGEY O. On lattices, learning with errors, random linear codes, and cryptography[A]. Proceeding of the 37th ACM Symposium on Theory of Computing (STOC2005) [C]. Baltimore, MD, USA, 2005.84-93.
  • 2LYUBASHEYSKY Y, PEIKERT C, REGEY O. On ideal lattices and learning with errors over rings[A]. Proceeding of the 29th Annual Eurocrypt Conference[C]. Riviera, French, 2010.1-23.
  • 3GENTRY C. Fully homomorphic encryption using ideal lattices[A]. Proceeding of the 40st ACM Symposium on Theory of Computing (STOC2009)[C]. Bethesda, Maryland, USA, 2009.169-178.
  • 4DIJK M Y, GENTRY C, HALEYI S, et al. Fully homomorphic encryption over the integers[A]. Proceeding of the 29th Annual Eurocrypt Conference[C]. Riviera, French, 2010.24-43.
  • 5SMART N P, YERCAUTEREN F. Fully homomorphic encryption with relatively small key and ciphertext sizes[A]. Proceeding of the 13th International Conference on Practice and Theory in Public Key Cryptography (PKC2010)[C]. Paris, France, 2010.420-443.
  • 6GENTRY C, HALEYI S. Implementing gentry's fully homomorphic encryption scheme[A]. Proceeding the 30th Annual Eurocrypt Conference[C]. Tallinn, Estonia, 2011.129-148.
  • 7STEHL'E D, STEINFELD R. Faster fully homomorphic encryption [A]. Proceeding of the 16th Annual Asiacrypt Conference [C]. Singapore, 2010.377-394.
  • 8BRAKERSKJ Z, YAIKUNTANATHAN V. Efficient fully homomorphic encryption from (standard) LWE[A]. Proceeding of IEEE 52nd Annual Symposium on Foundations of Computer Science(FOCS2011)[C]. Palm Springs, CA, USA, 20/1.97-106.
  • 9BRAKERSKJ Z, GENTRY C, YAlKUNTANATHAN Y. Fully homomorphic encryption without bootstrapping[A]. Proceeding of Innovations in Theoretical Computer Science 2012[C]. Cambridge, MA, USA,2012.309-325.
  • 10GENTRY C, HALEY1 S, SMARTN P. Fully homomorphic encryption with polylog overhead[A]. Proceeding of the 31st Annual Eurocrypt Conference[C]. Canbridge, UK, 2012.465-482.

共引文献51

同被引文献33

引证文献5

二级引证文献9

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部