期刊文献+

NTRU格上高效的基于身份的全同态加密体制 被引量:13

Efficient identity-based fully homomorphic encryption over NTRU
下载PDF
导出
摘要 全同态加密是目前解决云计算网络数据隐私保护问题的最佳方案,但目前的体制的公钥尺寸普遍较大。首先,通过引入Kullback-Leibler散度的概念,构造一种NTRU格上的基于身份公钥的加密体制,参数分析表明体制具有较小的密钥和密文尺寸,实验数据表明体制具有较高的加解密效率。其次,利用近似特征向量技术,给出一种方法,将基于身份的公钥加密体制转换为基于身份的全同态加密体制,可以进一步减小密文尺寸。和现有体制相比,除了不需要计算密钥,实现真正意义上的基于身份特性以外,还减小了密钥和密文尺寸,提高了计算和传输效率。 Fully homomorphic encryption is the best solution for solving privacy concerns for data over cloud so far, while large public key size is a general shortcoming for existing schemes. First, by introducing the concept of Kull- back-Leibler divergence, an identity-based public key scheme over NTRU lattice with modified ciphertext form was proposed. Analysis on parameter setting showed its small key size and ciphertext size, and experiments revealed its high computational efficiency. Second, with the idea of approximate eigenvector, an improved method to convert the scheme into an identity-based fully homomorphic encryption one was put forward to further reduce ciphertext size. Compared with existing schemes, the converted scheme not only abandons evaluation keys to make it fully identity-based, but also has smaller keys and ciphertext, which results in higher computational and transmission efficiency.
出处 《通信学报》 EI CSCD 北大核心 2017年第1期66-75,共10页 Journal on Communications
基金 国家科技支撑计划基金资助项目(No.2012BAH47B01) 国家自然科学基金资助项目(No.61170234 No.61309007 No.61502533) 河南省科技创新杰出青年基金资助项目(No.134100510002) 河南省基础与前沿技术研究基金资助项目(No.142300410002) 河南省高校科技创新人才支持计划基金资助项目(No.13HASTIT043)~~
关键词 全同态加密 基于身份加密 NTRU格 随机谕示模型 近似特征向量 fully homomorphic encryption, identity-based encryption, NTRU lattice, random oracle model, approximate eigenvector
  • 相关文献

参考文献2

二级参考文献34

  • 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

同被引文献85

引证文献13

二级引证文献44

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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