期刊文献+

新的格上基于身份的全同态加密方案 被引量:5

Novel identity-based fully homomorphic encryption scheme from lattice
下载PDF
导出
摘要 分析以往格上基于身份的全同态加密方案,指出方案效率低的根本原因在于陷门生成和原像采样过程的复杂度过高,为此提出一种新的解决方案。先将新型陷门函数与对偶容错学习(LWE,learning with errors)算法有机结合,构造一种新的格上基于身份的加密方案;再利用特征向量方法转化为格上基于身份的全同态加密方案。对比分析表明,所提方案的陷门生成复杂度显著降低,原像采样复杂度约降低为以往方案的1/3,SIVP近似因子缩小为以往方案的1/m^(1/2)。在标准模型下,方案安全性归约至判定性LWE的难解性,并包含严格的安全性证明。 The previous identity-based homomorphic encryption schemes from lattice was analyzed. That the high com- plexity in previous schemes was mainly caused by trapdoor generation and preimage sampling was pointed out. A new solution was proposed. A novel identity-based encryption scheme from lattice by combining new trapdoor function and dual-LWE algorithm organically was constructed, and it was transformed to an identity-based fully homomorphic encryp- tion scheme from lattice by employing the idea of eigenvector. Comparative analysis shows that the scheme's complexity of trapdoor generation has a significant reduction, the complexity of preimage sampling has a nearly three-fold reduction, and the SIVP approximation factor has a a√m times reduction. The security of the proposed scheme strictly reduces to the hardness of decisional learning with errors problem in the standard model.
出处 《通信学报》 EI CSCD 北大核心 2017年第5期39-47,共9页 Journal on Communications
基金 国家自然科学基金资助项目(No.61300216) 河南省科技厅基金资助项目(No.142300410147) 河南省教育厅基金资助项目(No.12A520021 No.16A520013) 河南理工大学博士基金资助项目(No.B2014-044 No.B2013-043)~~
关键词 全同态加密 基于身份加密 标准模型 密码学 lattice, fully homomorphic encryption, identity-based encryption, standard model, cryptography
  • 相关文献

参考文献2

二级参考文献16

  • 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.

共引文献25

同被引文献30

引证文献5

二级引证文献12

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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