期刊文献+

针对全同态加密体制的反馈攻击 被引量:5

Feedback Attack Against Fully Homomorphic Encryption System
下载PDF
导出
摘要 全同态加密体制能够在不解密的条件下对密文进行任意的函数运算,是解决云计算中数据隐私保护难题的关键技术。构造全同态加密方案的核心是有效控制密文同态运算中的噪声增长,稀疏子集和问题是实现该目标所需的基本困难性问题。针对基于该问题困难性的全同态加密方案,提出一种改进的反馈攻击方法,使攻击者可以对公钥中的部分数据进行特定计算,通过访问解密谕示得到完整的私钥。分析结果表明,该方法能够充分利用预计算提高攻击效率,对基于稀疏子集和问题的全同态加密方案具有良好的适用性。 Fully Homomorphic Encryption(FHE) allows one to compute arbitrary functions over encrypted data without the decryption key. It is an important technology for private data protection in cloud computing. The highlight of constructing a FHE scheme is to successfully control the noise produced during the homomorphic operations ofciphertexts. The Sparse Subset Sum Problem(SSSP) is one of the basic hard problems used for the noise control. An improved reaction attack against FHE schemes based on the hardness of SSSP is proposed. The adversary can take special computation for the public key, and get the whole decryption key through access to the decryption oracle. Analysis result shows that compared with the known similar attacks, the advantage of the attack is the full use of pre-computing, which improves the efficiency and gains better applicability.
出处 《计算机工程》 CAS CSCD 2014年第6期79-84,共6页 Computer Engineering
关键词 全同态加密 云计算 稀疏子集和问题 解密谕示 反馈攻击 预计算 Fully Homomorphic Encryption(FHE) cloud computing Sparse Subset Sum Problem(SSSP) decryption oracle feedback attack pre-computing
  • 相关文献

参考文献24

  • 1Rivest R, Adleman L, Dertouzos M. On Data Banks and Privacy Homomorphisms[C]//Proc. of IEEE Conference on Foundations of Secure Computation. [S. l.]: Academic Press, 1978: 169-177.
  • 2Gentry C. Fully Homomorphic Encryption Using Ideal Latt- ices[C]//Proc. of the 41th ACM Symposium on Theory of Computing. Annapolis, USA: [s. n.], 2009: 259-306.
  • 3van Dijk M, Gentry C, Halevi S, et al. Fully Homomorphic Encryption over the Integers[C]//Proc. of EUROCRYPT’10. Riviera, France: [s. n.], 2010: 551-559.
  • 4Smart N P, Vercauteren F. Fully Homomorphic Encryption with Relatively Small key and Ciphertext Sizes[C]//Proc. of the 13th IACR International Conference on Practice and Theory of Public-key Cryptography. Paris, France: [s. n.], 2010: 456-465.
  • 5Gentry C, Halevi S. Implementing Gentry’s Fully Homo- morphic Encryption Scheme[C]//Proc. of EUROCRYPT’11. Tallinn, Estonia: [s. n.], 2011: 333-342.
  • 6Coron J S, Mandal A, Naccache D, et al. Fully Homomorphic Encryption over the Integers with Shorter Public Keys[C]// Proc. of CRYPTO’11. Los Angeles, USA: [s. n.], 2011: 441-448.
  • 7Brakerski Z, Vaikuntanathan V. Efficient Fully Homomorphic Encryption From(Standard) Lwe[C]//Proc. of the 52nd Annual IEEE Symposium on Foundations of Computer Science. Los Angeles, USA: [s. n.], 2011: 321-326.
  • 8Gentry C, Halevi S, Smart N P. Fully Homomorphic Encryption with Polylog Overhead[C]//Proc. of EUROCRYPT’12. Cam- bridge, UK: [s. n.], 2012: 123-128.
  • 9Gentry C, Halevi S, Smart N P. Better Bootstrapping in Fully Homomorphic Encryption[C]//Proc. of the 15th IACR International Conference on Practice and Theory of Public- key Cryptography. Darmstadt, Germany: [s. n.]: 2012: 213- 219.
  • 10Hofheinz D, Unruh D. Towards Key-dependent Message Security in the Standard Model[C]//Proc. of EUROCRYPT’08. Istanbul, Turkey: [s. n.], 2008: 412-419.

二级参考文献9

  • 1Mesenne Research Inc..The Great Internet Mersenne Prime Search,Project[EB/OL].[2011-12-20].http://www.mersenne.org/.
  • 2Gennaro R,Gentry C,Parno B.Non-interactive VerifiableComputing:Outsourcing Computation to Untrusted Workers[C]//Proc.of the 30th Annual Cryptology Conference.Santa Barbara,USA:[s.n.],2010.
  • 3Chung Kai-Min,Kalai Y T,Vadhan S P.Improved Delegation ofComputation Using Fully Homomorphic Encryption[C]//Proc.ofthe 30th Annual Cryptology Conference.Santa Barbara,USA:[s.n.],2010.
  • 4Helios A B.Web-based Open-audit Voting[C]//Proc.of the 17thUSENIX Security Symposium.[S.l.]:USENIX Association,2008:335-348.
  • 5Jin Fangyuan,Zhu Yanqin,Luo Xizhao.Verifiable FullyHomomorphic Encryption Scheme[C]//Proc.of the InternationalConference on Consumer Electronics,Communications andNetworks.Three Gorges,China:[s.n.],2012.
  • 6Damgard I,Faust S,Hazay C.Secure Two-party Computation withLow Communication[EB/OL].[2011-12-20].http://eprint.iacr.org/.
  • 7van Dijk M,Gentry C,Halevi S,et al.Fully HomomorphicEncryption over the Integers[C]//Proc.of EUROCRYPT’10.[S.l.]:Springer,2010.
  • 8Goldwasser S,Kalai Y T,Rothblum G N.Delegating Computation:Interactive Proofs for Muggles[C]//Proc.of the 40th Annual ACMSymposium on Theory of Computing.New York,USA:ACMPress,2008:113-122.
  • 9张彩云,罗永龙,石磊.关于安全判定点和区间包含关系的解决方法[J].计算机工程与应用,2010,46(17):107-109. 被引量:5

共引文献6

同被引文献23

引证文献5

二级引证文献19

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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