期刊文献+

FHE-CF:基于密文展缩的全同态密码体制设计

FHE-CF: designing of fully homomorphic encryption scheme based on ciphertext flattening technique
下载PDF
导出
摘要 为了解决云环境下密文处理的问题,构造了一个基于LWE问题的全同态加密体制FHE-CF。该体制没有采用传统的基于LWE问题的全同态密码体制设计中的重线性化技术,而是利用一种新的密文展缩技术来实现噪声的有效控制。在不引入新的未经论证的安全假设的前提下,可以获得KDM安全的自举加密体制,其安全性有了突破性提高。由于其KDM安全性,可以构造循环的密钥链,实现从分层全同态到全同态的过渡。还证明了所构造的全同态密码体制是RO模型下IND-CPA安全的。除了安全性上的优势外,该密码体制效率与当前最好的全同态密码体制相当。 In order to solve the problem of ciphertext operation in the cloud, this paper presented a new fully homomorphie encryption scheme based on LWE problem. It applied a novel ciphertext flattening technique in this scheme to control the noise efficiently instead of relinearization technique which was applied by other traditional LWE-based fully homomorphic eneryption schemes. Without introducing new assumptions whose security had not been confirmed, it constructed a KDM secure bootstrappable encryption scheme, which leaded to a breakthough in the security of FHE-CF. Because of its KDM secuity, a cyclic keychain could be designed properly to transform a leveled fully homomorphic eneryption scheme into a fully homomorphic encryption scheme. This paper has also been proved the FHE-CF scheme' s IND-CPA security under the random oracle model. Besides,the FHE-CF scheme has the same efficiency with these previous fully homomorphie encryption schemes.
出处 《计算机应用研究》 CSCD 北大核心 2015年第2期498-502,共5页 Application Research of Computers
基金 国家自然科学基金资助项目(61370188 61070219) 中央高校基本科研业务费专项资金资助课题(2014CLJH09)
关键词 错误学习 密文展缩 全同态 线性同态 LWE ciphertext flattening fully homomorphic encryption linear homomorphic
  • 相关文献

参考文献20

  • 1GENTRY C. Fully homomorphic encryption using ideal lattices [ C ]// Proc of the 41st Annual ACM Symposium on Theory of Computing. New York : ACM Press,2009 : 169-178.
  • 2GENTRY C. A Fully homomorphie encryption scheme [ D ]. Califor- nia : Stanford University,2009.
  • 3LEE M S. On the sparse subset sum problem from Gentry-Halevi' s implementation of fully homomorphic encryption [ EB/OL]. 2011. ht- tp ://eprint. iacr. org/2011/567, pdf.
  • 4Van DHK M, GENTRY C, HALEVI S, et al, Fully homomorphic encryption over the integers [ C ]//Advances in Cryptology-EURO- CRYPT. Berlin : Springer,2010:24-43.
  • 5CHEON J H, CORON J S, KIM J S,et al. Batch fully homomorphic encryption over the integers [ C ]//Advances in Cryptology-EURO- CRYPT . Berlin:Springer,2013:315-335.
  • 6BRAKERSKI Z, GENTRY C, VAIKUNTANATHAN V. Fully homo- morphic encryption without bootstrapping[ EB/OL]. ( 2011 ). http :// eprint, iacr. org/2011/277.
  • 7STEHLE D, STEINFELD R. Faster fully homomorphic encryption [C]//Advances in Cryptology-ASIACRYPT. Berlin:Springer,2011: 487 - 504.
  • 8CORON J S, MANDAL A, NACCACHE D, et al. Fully homomor- phie eneryptian over the integers with shorter public keys [ C ] //Ad- vances in Cryptology-CRYPTO . Berlin : Springer,2011:487- 504.
  • 9GU Chun-sheng. New fully homom0rphic encryption over the integers [ EB/OL]. (2011). http ://eprint. iacr. org/2011/118, pdf.
  • 10SMART N P, VERCAUTEREN F. Fully homomorphic encryption with relatively small key and ciphertext sizes[ C ]//Prec of the 13th Inter- national Conference on Practice and Theory in Public Key Cryptogra- phy. Berlin: Springer-Verlag,2010:420-443.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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