基于LWE问题的关键词可搜索公钥加密方案
|
摘要
针对现有体制中用户生成关键词密文时的计算开销问题,引入全同态加密的思想,提出一种基于LWE问题,具备密文同态运算属性的关键词可搜索公钥加密方案,实现了计算开销由用户端向服务器端的转移。在随机谕示模型下,将体制的安全性归约到LWE问题难解性,并给出证明。
Aiming at the problem of computing costs of users when they encrypting the keywords, the fully homomorphic encryption is introduced into the design of the scheme with ciphertext calculating property. The scheme, which is based on LWE problem, can transfer the computing costs from the users to the servers. The security of the scheme has been reduced to the hardness assumption of LWE problem under the random oracle model.
Aiming at the problem of computing costs of users when they encrypting the keywords, the fully homomorphic encryption is introduced into the design of the scheme with ciphertext calculating property. The scheme, which is based on LWE problem, can transfer the computing costs from the users to the servers. The security of the scheme has been reduced to the hardness assumption of LWE problem under the random oracle model.
引文
[1]Dan B,Crescenzo G D,Ostrovsky R,et al.Public Key Encryption with Keyword Search[M]//Advances in Cryptology-EUROCRYPT 2004.Springer Berlin Heidelberg:2004:506-522.
[2]Shamir A.Identity-Based Cryptosystems and Signature Schemes[M]//Advances in Cryptology.Springer Berlin Heidelberg:1984:47-53.
[3]Cao N,Wang C,Li M,et al.Privacy-Preserving Multi-Keyword Ranked Search over Encrypted Cloud Data[J].Parallel&Distributed Systems IEEE Transactions on.2014,25(01):222-233.
[4]Li J,Wang Q,Wang C,et al.Fuzzy keyword search over encrypted data in cloud computing[J].Infocom,2010,2009(09):1-5.
[5]Kamara S,Papamanthou C.Parallel and Dynamic Searchable SymmetricEncryption[M]//Financial Cryptography and Data Security.Springer Berlin Heidelberg:2013:258-274.
[6]Dong Jin Park,Kihyun Kim,Pil Joong Lee.Public key encryption with conjunctive field keyword search[C]//International Conference on Information Security Applications.SpringerVerlag:2004:73-86.
[7]Yong H H,Lee P J.Public Key Encryption with Conjunctive Keyword Search and Its Extension to a Multi-user System[C]//InternationalConference on Pairing-Based Cryptography.Springer-Verlag:2007:2-22.
[8]Regev,Oded.New lattice based cryptographic constructions[J].Journal of the Acm,2002,51(06):407-416.
[9]Gentry C,Peikert C,Vaikuntanathan V.Trapdoors for hard lattices and new cryptographic constructions.[J].Electronic Colloquium on Computational Complexity,2015(14):197-206.
[2]Shamir A.Identity-Based Cryptosystems and Signature Schemes[M]//Advances in Cryptology.Springer Berlin Heidelberg:1984:47-53.
[3]Cao N,Wang C,Li M,et al.Privacy-Preserving Multi-Keyword Ranked Search over Encrypted Cloud Data[J].Parallel&Distributed Systems IEEE Transactions on.2014,25(01):222-233.
[4]Li J,Wang Q,Wang C,et al.Fuzzy keyword search over encrypted data in cloud computing[J].Infocom,2010,2009(09):1-5.
[5]Kamara S,Papamanthou C.Parallel and Dynamic Searchable SymmetricEncryption[M]//Financial Cryptography and Data Security.Springer Berlin Heidelberg:2013:258-274.
[6]Dong Jin Park,Kihyun Kim,Pil Joong Lee.Public key encryption with conjunctive field keyword search[C]//International Conference on Information Security Applications.SpringerVerlag:2004:73-86.
[7]Yong H H,Lee P J.Public Key Encryption with Conjunctive Keyword Search and Its Extension to a Multi-user System[C]//InternationalConference on Pairing-Based Cryptography.Springer-Verlag:2007:2-22.
[8]Regev,Oded.New lattice based cryptographic constructions[J].Journal of the Acm,2002,51(06):407-416.
[9]Gentry C,Peikert C,Vaikuntanathan V.Trapdoors for hard lattices and new cryptographic constructions.[J].Electronic Colloquium on Computational Complexity,2015(14):197-206.