期刊文献+

A Fully Homomorphic Encryption Scheme with Better Key Size 被引量:5

A Fully Homomorphic Encryption Scheme with Better Key Size
下载PDF
导出
摘要 Fully homomorphic encryption is faced with two problems now. One is candidate fully homomorphic encryption schemes are few. Another is that the efficiency of fully homomorphic encryption is a big question. In this paper, we propose a fully homomorphic encryption scheme based on LWE, which has better key size. Our main contributions are: (1) According to the binary-LWE recently, we choose secret key from binary set and modify the basic encryption scheme proposed in Linder and Peikert in 2010. We propose a fully homomorphic encryption scheme based on the new basic encryption scheme. We analyze the correctness and give the proof of the security of our scheme. The public key, evaluation keys and tensored ciphertext have better size in our scheme. (2) Estimating parameters for fully homomorphic encryption scheme is an important work. We estimate the concert parameters for our scheme. We compare these parameters between our scheme and Bral2 scheme. Our scheme have public key and private key that smaller by a factor of about logq than in Bral2 scheme. Tensored ciphertext in our scheme is smaller by a factor of about log2q than in Bral2 scheme. Key switching matrix in our scheme is smaller by a factor of about log3q than in Bra12 scheme. Fully homomorphic encryption is faced with two problems now.One is candidate fully homomorphic encryption schemes are few.Another is that the efficiency of fully homomorphic encryption is a big question.In this paper,we propose a fully homomorphic encryption scheme based on LWE,which has better key size.Our main contributions are:(1) According to the binary-LWE recently,we choose secret key from binary set and modify the basic encryption scheme proposed in Linder and Peikert in 2010.We propose a fully homomorphic encryption scheme based on the new basic encryption scheme.We analyze the correctness and give the proof of the security of our scheme.The public key,evaluation keys and tensored ciphertext have better size in our scheme.(2) Estimating parameters for fully homomorphic encryption scheme is an important work.We estimate the concert parameters for our scheme.We compare these parameters between our scheme and Bra 12 scheme.Our scheme have public key and private key that smaller by a factor of about logq than in Bra12 scheme.Tensored ciphertext in our scheme is smaller by a factor of about log2 q than in Bra 12 scheme.Key switching matrix in our scheme is smaller by a factor of about log3 q than in Bra 12 scheme.
出处 《China Communications》 SCIE CSCD 2014年第9期82-92,共11页 中国通信(英文版)
基金 The first author would like to thank for the Fund of Jiangsu Innovation Program for Graduate Education,the Fundamental Research Funds for the Central Universities,and Ningbo Natural Science Foundation,the Chinese National Scholarship fund,and also appreciate the benefit to this work from projects in science and technique of Ningbo municipal.The third author would like to thank for Ningbo Natural Science Foundation
关键词 fully homomorphic encryption public key encryption learning with error concert parameters 加密方案 同态加密 主要尺寸 交换矩阵 二进制 组密钥 安全性 音乐会
  • 相关文献

参考文献20

  • 1Craig 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.
  • 2Marten 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.
  • 3Z. 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.
  • 4Zvika 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.
  • 5Zvika 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.
  • 6Adriana 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.
  • 7Craig 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.
  • 8Craig 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.
  • 9Zvika 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.
  • 10Zvika Brakerski, Adeline Langlois, Chris Peikert, Oded Regev, Damien Stehl, #233. Classical Hardness of Learning with Errors [M]. Proceed- ings of the 45th annual ACM symposium on Symposium on theory of computing. Palo Alto, California, USA; ACM 2013: 575-584.

同被引文献10

引证文献5

二级引证文献57

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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