期刊文献+

全同态加密具体安全参数分析 被引量:4

Estimating Concert Security Parameters of Fully Homomorphic Encryption
下载PDF
导出
摘要 为了保证全同态加密的安全使用,以及衡量分析全同态加密方案的效率,提出一个计算分析LWE上全同态加密具体安全参数的通用方法,该方法同样适用于环LWE上的全同态加密.该方法分为两步:第一步,根据同态计算的电路深度L,以及全同态加密方案解密正确性条件与噪音增长关系,计算出所需的模q;第二步,在给定安全等级下,我们引入了敌手的优势,根据区分攻击获得LWE问题维数n与模q之间的函数关系,计算出满足第一步中模q的最小维数n.从而分析计算出全同态加密的具体安全参数.该方法具有模块化特征,可以根据最新的格密码攻击进展替换相应的内容,从而获得最新的全同态加密具体安全参数.最后利用提出的方法对两个全同态加密的代表方案进行了具体安全参数的分析与比较,这也是首次给出这两个方案的具体安全参数.数据显示目前LWE上的全同态加密参数尺寸过大,与实际应用还有距离. In order to ensure the security of fully homomorphic encryption (FHE) and analyze the efficiency of fully homomorphic encryption, we present a general method to estimate the concert security parameters of fully homomorphic encryption scheme based on learning with errors problem (LWE). Note that this method is also applicable to the FHE on the ring LWE. The proposed method has two steps. In the first step, according to the circuit depthL, the modulusq can be estimated by the condition of correct decryption among noise growth. In the second step, we introduce the advantage of adversary. Given the security level, the minimal dimensionn can be derived from modulusq according to the distinguishing attack. Thus the concert security parameters of a fully homomorphic encryption scheme are obtained. The proposed method has the feature of modularization. We obtain the new concert security parameters of a fully homomorphic encryption scheme by replacing the old lattice attack with the new one. We use the method to analyze the concert security parameters of two fully homomorphic encryption schemes. The results show that the size of the concert security parameters is large, which means that fully homomorphic encryption scheme on learning with errors problem cannot be used in practical applications.
出处 《密码学报》 CSCD 2016年第5期-,共12页 Journal of Cryptologic Research
基金 浙江省自然科学基金资助(LY17F020002) NSFC-浙江两化融合联合基金(U1509219) 密码科学技术国家重点实验室开放课题 宁波市自然科学基金(2016A610226)
关键词 全同态加密 具体安全参数 区分攻击 学习错误问题 fully homomorphic encryption concert security parameters distinguishing attack learning with errors problem
  • 相关文献

参考文献3

二级参考文献23

  • 1陈智罡, 王 箭, 王梅娟. 整数上的全同态加密分析[C]// 2012中国密码年会论文集. 合肥: [出版者不详], 2012.
  • 2Craig Gentry. Fully Homomorphic Encryption Using Ideal Lattices [M]. Proceedings of the 41st annual ACM symposium on Theory of comput- ing. Bethesda, MD, USA; ACM. 2009: 169-178.
  • 3Marten van Dijk, Craig Gentry, Shai Halevi, Vinod Vaikuntanathan. Fully Homomorphic Encryption over the Integers [M]//GILBERT H. Advances in Cryptology - Eurocrypt 2010. Springer Berlin / Heidelberg. 2010: 24-43.
  • 4Z. Brakerski, V. Vaikuntanathan. Efficient Fully Homomorphic Encryption from (Standard} Lwe [M]//OSTROVSKY R. 2011 Ieee 52nd An- nual Symposium on Foundations of Computer Science. Los Alamitos; IEEE Computer Society. 2011: 97-106.
  • 5Zvika Brakerski, Craig Gentry, Vinod Vaikun- tanathan. (Leveled) Fully Homomorphic Encryp- tion without Bootstrapping [M], Proceedings of the 3rd Innovations in Theoretical Computer Science Conference. Cambridge, Massachusetts; ACM. 2012: 309-325.
  • 6Zvika Brakerski. Fully Homomorphic Encryp- tion without Modulus Switching from Classical Gapsvp [M]//SAFAVI-NAINI R, CANETTI R. Ad- vances in Cryptology - Crypto 2012. Springer Berlin Heidelberg. 2012: 868-886.
  • 7Adriana L6pez-Alt, Eran Tromer, Vinod Vaikun- tanathan. On-the-Fly Multiparty Computation on the Cloud Via Multikey Fully Homomorphic Encryption [M]. Proceedings of the 44th sym- posium on Theory of Computing. New York, New York, USA; ACM. 2012: 1219-1234.
  • 8Craig Gentry, Amit Sahai, Brent Waters. Homo- morphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster,Attribute-Based [M]//CANETTI R, GARAY J. Ad- vances in Cryptology - Crypto 2023. Springer Berlin Heidelberg. 2013: 75-92.
  • 9Craig Gentry, Shai Halevi, Nigel Smart. Fully Ho- momorphic Encryption with Polylog Overhead [M]//POINTCHEVAL D, JOHANSSON T. Advanc- es in Cryptology- Eurocrypt 2012. Springer Ber- lin / Heidelberg. 2012: 465-482.
  • 10Zvika Brakerski, Craig Gentry, Shai Halevi. Packed Ciphertexts in Lwe-Based Homomorphic Encryption [M]//KUROSAWA K, HANAOKA G. Public-Key Cryptography - Pkc 2013. Springer Berlin Heidelberg. 2013: 1-13.

共引文献43

同被引文献11

引证文献4

二级引证文献22

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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