期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

破解较快速的整数上的全同态加密方案 被引量：3

Breaking faster fully homomorphic encryption scheme over integer
在线阅读 下载PDF
导出
摘要 研究分析优化的全同态加密方案的安全性十分重要。针对汤等人设计的全同态加密方案,使用格归约攻击方法直接获取密文中的明文比特,从而破解了该较快速的全同态加密方案。 It is very important to analyze the security of optimizing fully homomorphic encryption scheme. For the fully homo- morphic encryption scheme designed by Tang et al., this paper directly obtains the plaintext bit from a ciphertext by applying lat- tice reduction attack. Thus, this faster fully homomorphic encryption scheme is broken.
作者 古春生 景征骏 于志敏
机构地区 江苏技术师范学院计算机工程学院 中国科学技术大学计算机科学与技术学院 南京邮电大学计算机学院
出处 《计算机工程与应用》 CSCD 2013年第21期101-105,共5页 Computer Engineering and Applications
基金 国家自然科学基金(No.70671096) 江苏技术师范学院基金(No.KYY11055)
关键词 全同态加密 近似最大公约数(GCD)问题 密码分析 格归约攻击 fully homomorphic encryption approximate Greatest Common Divisor（GCD） cryptanalysis lattice reduction attack
分类号 TN918.4 [电子电信—通信与信息系统]
  • 相关文献

参考文献10

  • 1Rivest R,Adleman L,Dertouzos M.On data banks and pri-vacy homomorphisms[C]//Foundations of Secure Computation,1978:169-180.
  • 2Gentry C.Fully homomorphic encryption using ideal IatticesfC]//STOC 2009,2009:169-178.
  • 3Smart N P,Vercauteren F.Fully homomorphic encryption withrelatively small key and ciphertext sizes[C]//LNCS 6056:PublicKey Cryptography-PKC 2010,2010:420-443.
  • 4van Dijk M,Gentry C,Halevi S,et al.Fully homomorphicencryption over the integers[C]//LNCS 6110:Eurocrypt 2010,2010:24-43.
  • 5Stehle D,Steinfeld R.Faster fully homomorphic encryption[C]//LNCS 6477:Asiacrypt 2010,2010:377-394.
  • 6Gentry C,Halevi S.Implementing Gentry's fully-homomor-phic encryption scheme[C]//LNCS 6632:Eurocrypt 2011,2011:129-148.
  • 7汤殿华,祝世雄,曹云飞.一个较快速的整数上的全同态加密方案[J].计算机工程与应用,2012,48(28):117-122. 被引量：35
  • 8Lenstra H W,Lenstra A K,Lovasz L.Factoring polynomialswith rational coefFicients[J].Mathematische Annalen,1982,261:515-534.
  • 9Nguyen P Q,Vallee B.The LLL algorithm:survey and appli-cations[M]//Infoimation Security and Cryptography.[S.l.]:Springer,2009:33-35.
  • 10Shoup V.NTL:a library for doing number theory[EB/OL].[2011-11-20].http://shoup.net/ntl/.

二级参考文献7

  • 1Rivest R L, Adleman L, Dertouzos M L.On data banks and privacy homomorphisms[Z].Foundations of Secure Computation, 1978.
  • 2Gentry C.Fully homomorphic encryption using ideal lattices[C]//STOC' 09,2009 : 169-178.
  • 3Gentry C.A fully homomorphic encryption scheme[D/OL]. Stanford University , 2009.http : //crypto.stanford.edu/craig.
  • 4van Dijk M, Gentry C, Halevi S, et al.Fully homomorphic encryption over the integers[C]//Volume 6110 of LNCS : Proc of Eurocrypt, 2010 : 24-43.
  • 5Smart N P, Vercauteren F.Fully homomorphic encryption with relatively small key and ciphertext sizes[C]// Volume 6056 of Lecture Notes in Computer Science: Public Key Cryptography-PKC' 10, Springer, 2010.
  • 6Stehle D, Steinfeld R.Faster fully homomorphic encryption, Cryptology ePrint Archive, Report 2010/299[EB/OL]. (2010).http://eprint.iacr.org/.
  • 7Howgrave-Graham N.Approximate integer common divisors[C]//Volume 2146 of Lecture Notes in Computer Science: CaLC' 01.[S.l.] : Springer, 2001 : 51-66.

共引文献34

同被引文献33

  • 1Van DIJK M, GENTRY C, HALEVI S, et al. Fully homomorphic encryption over the integers [ C ]//LNCS, vol 6110. Berlin : Springer, 2010:24-43.
  • 2REGEV O. New lattice-based cryptographic constructions[ J]. Jour- nal of the ACM ,2004,51 (6) :899-942.
  • 3RIVEST R,ADLEMAN L,DERTOUZOS M. On data banks and pri- vacy homomorphisms [ J ]. Foundations of Secure Computation, 1978,7( 1 ) :169-177.
  • 4GENTRY C. A fully homomorphic encryption scheme[ D ]. Stanford: Stanford University, 2009.
  • 5GENTRY C. Fully homomorphic encryption using ideal lattices [ C ]// Proc of STOC. New York:ACM Press,2009:169-178.
  • 6GENTRY C, HALEVI S. Implementing gentry' s fully-homomorphic encryption scheme [ C ]//LNCS, vol 6632. Berlin :Springer,2011 : 129- 148.
  • 7SMART N P, VERCAUTEREN F. Fully homomorphic encryption with relatively small key and ciphertext sizes [ C ]//LNCS, vol 6056. Ber- lin : Springer, 2010:420 - 443.
  • 8BRAKERSKI Z, VAIKUNTANATHAN V. Efficient fully homomor- phic encryption from (standard) LWE[ EB/OL]. (2011-08-04). ht- tp ://eprint. iacr. org/2011/344.
  • 9REGEV O. On lattices, learning with errors, random linear codes, and cryptography[ C ]//Proc of STOC. New York : ACM Press ,2005 : 84-93.
  • 10GENTRY C, HALEVI S. Fully homomorphic encryption without squashing using depth- 3 arithmetic circuits [ EB/OL ]. ( 2011- 09- 14). http ://eprint. iacr. org/2011/279.

引证文献3

二级引证文献10

计算机工程与应用
2013年 第21期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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