基于Paillier和PSI的多关键字可搜索加密方案
|
摘要
围绕多关键字的高效密文搜索和数据安全性保障问题,展开分析与研究,基于同态加密和私有集合交集技术,提出一种面向多关键字的高效的保护搜索模式的可搜索加密方案.该方案使用随机数填充和Paillier同态加密方法构造安全索引和陷门,保护了索引隐私和陷门隐私,进而保护了搜索模式;该方案通过私有集合交集技术进行连接多关键字搜索,搜索中只使用到了乘法和指数运算,与其他方案相比大大提高了效率;安全性和性能分析表明,该方案具有可搜索加密的语义安全性,可以高效地实现对密文的多关键字搜索,且具有良好的计算代价.
Efficient multi-keyword ciphertext search and problems of data security protection were researched. Based on Paillier homomorphic encryption and private set intersection( PSI) technique,a multi-keyword searchable encryption scheme was provided,which can search over encrypted files efficiently and protect the search pattern. First,through random number padding and Paillier homomorphic encryption the index privacy and the trapdoor privacy were protected,and the search pattern was further protected. Then,the scheme supports conjunctive multi-keyword search by using PSI. Because only multiplications and exponentiations were used in searching,the proposed scheme is more efficient than others. Security and performance analysis showed that the scheme has the semantic security of searchable encryption and can perform multi-keyword search efficiently with a good computational cost.
Efficient multi-keyword ciphertext search and problems of data security protection were researched. Based on Paillier homomorphic encryption and private set intersection( PSI) technique,a multi-keyword searchable encryption scheme was provided,which can search over encrypted files efficiently and protect the search pattern. First,through random number padding and Paillier homomorphic encryption the index privacy and the trapdoor privacy were protected,and the search pattern was further protected. Then,the scheme supports conjunctive multi-keyword search by using PSI. Because only multiplications and exponentiations were used in searching,the proposed scheme is more efficient than others. Security and performance analysis showed that the scheme has the semantic security of searchable encryption and can perform multi-keyword search efficiently with a good computational cost.
引文
[1]董晓蕾,周俊,曹珍富.可搜索加密研究进展[J].计算机研究与发展,2017,54(10):2107-2120.(Dong Xiao-lei,Zhou Jun,Cao Zhen-fu.Research advances on secure searchable encryption[J].Journal of Computer Research and Development,2017,54(10):2107-2120.)
[2]Song D X,Wagner D,Perrig A.Practical techniques for searches on encrypted data[C]//IEEE Symposium on Security and Privacy.Washington D C:IEEE Computer Society,2000:44.
[3]Dan B,Crescenzo G D,Ostrovsky R,et al.Public key encryption with keyword search[M].Berlin:Springer,2004:506-522.
[4]Goh E J.Secure indexes[EB/OL].(2004-03-16)[2017-12-17].https://eprint.iacr.org/2003/216.pdf.
[5]Cao N,Wang C,Li M,et al.Privacy-preserving multi-keyword ranked search over encrypted cloud data[J].IEEETransactions on Parallel&Distributed Systems,2013,25(1):222-233.
[6]Li M,Yu S,Lou W,et al.Toward privacy-assured cloud data services with flexible search functionalities[C]//International Conference on Distributed Computing Systems Workshops.Washington D C:IEEE,2012:466-470.
[7]Sun W,Yu S,Lou W,et al.Protecting your right:verifiable attribute-based keyword search with fine-grained ownerenforced search authorization in the cloud[J].IEEETransactions on Parallel and Distributed Systems,2014,27(4):1187-1198.
[8]Curtmola R,Garay J,Kamara S,et al.Searchable symmetric encryption:improved definitions and efficient constructions[J].Journal of Computer Security,2011,19(5):895-934.
[9]Gentry C.Fully homomorphic encryption using ideal lattices[C]//Proceedings of the Annual ACM Symposium on Theory of Computing.New York:ACM,2009:169-178.
[10]Paillier P.Public-key cryptosystems based on composite degree residuosity classes[C]//International Conference on Theory and Application of Cryptographic Techniques.Berlin:SpringerVerlag,1999:223-238.
[11]Freedman M J,Nissim K,Pinkas B.Efficient private matching and set intersection[C]//Advances in CryptologyEUROCRYPT 2004.Berlin:Springer,2004:1-19.
[12]Kolesnikov V,Matania N,Pinkas B,et al.Practical multi-party private set intersection from symmetric-key techniques[C]//ACM SIGSAC Conference on Computer and Communications Security.New York:ACM,2017:1257-1272.
[2]Song D X,Wagner D,Perrig A.Practical techniques for searches on encrypted data[C]//IEEE Symposium on Security and Privacy.Washington D C:IEEE Computer Society,2000:44.
[3]Dan B,Crescenzo G D,Ostrovsky R,et al.Public key encryption with keyword search[M].Berlin:Springer,2004:506-522.
[4]Goh E J.Secure indexes[EB/OL].(2004-03-16)[2017-12-17].https://eprint.iacr.org/2003/216.pdf.
[5]Cao N,Wang C,Li M,et al.Privacy-preserving multi-keyword ranked search over encrypted cloud data[J].IEEETransactions on Parallel&Distributed Systems,2013,25(1):222-233.
[6]Li M,Yu S,Lou W,et al.Toward privacy-assured cloud data services with flexible search functionalities[C]//International Conference on Distributed Computing Systems Workshops.Washington D C:IEEE,2012:466-470.
[7]Sun W,Yu S,Lou W,et al.Protecting your right:verifiable attribute-based keyword search with fine-grained ownerenforced search authorization in the cloud[J].IEEETransactions on Parallel and Distributed Systems,2014,27(4):1187-1198.
[8]Curtmola R,Garay J,Kamara S,et al.Searchable symmetric encryption:improved definitions and efficient constructions[J].Journal of Computer Security,2011,19(5):895-934.
[9]Gentry C.Fully homomorphic encryption using ideal lattices[C]//Proceedings of the Annual ACM Symposium on Theory of Computing.New York:ACM,2009:169-178.
[10]Paillier P.Public-key cryptosystems based on composite degree residuosity classes[C]//International Conference on Theory and Application of Cryptographic Techniques.Berlin:SpringerVerlag,1999:223-238.
[11]Freedman M J,Nissim K,Pinkas B.Efficient private matching and set intersection[C]//Advances in CryptologyEUROCRYPT 2004.Berlin:Springer,2004:1-19.
[12]Kolesnikov V,Matania N,Pinkas B,et al.Practical multi-party private set intersection from symmetric-key techniques[C]//ACM SIGSAC Conference on Computer and Communications Security.New York:ACM,2017:1257-1272.