Privacy-Preserving and Dynamic Multi-Attribute Conjunctive Keyword Search Over Encrypted Cloud Data

被引:23
作者
Zhang, Lili [1 ,2 ]
Zhang, Yuqing [1 ,3 ,4 ]
Ma, Hua [1 ,4 ]
机构
[1] Xidian Univ, Natl Key Lab Integrated Serv Networks, Xian 710071, Shaanxi, Peoples R China
[2] Henan Univ Sci & Technol, Informat Engn Coll, Luoyang 471023, Peoples R China
[3] Univ Chinese Acad Sci, Natl Comp Network Intrus Protect Ctr, Beijing 100049, Peoples R China
[4] Chinese Acad Sci, Inst Informat Engn, State Key Lab Informat Secur, Beijing 100093, Peoples R China
基金
中国国家自然科学基金;
关键词
Conjunctive keyword search; cloud computing; multiple attribute tree; privacy-preserving search; tree-based index; PUBLIC-KEY ENCRYPTION; PREDICATE ENCRYPTION; SECURE;
D O I
10.1109/ACCESS.2018.2823718
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
With the increasing popularity of cloud computing, a growing data owners are motivated to outsource their huge data to cloud servers in order to facilitate access and save data management cost. To protect user privacy and data security, sensitive data should be encrypted before outsourced to the cloud server, which obsoletes data utilization like efficient search over encrypted data. In this paper, we present a privacy-preserving conjunctive keyword search scheme over encrypted cloud data, which simultaneously supports dynamic update operations. Specifically, we construct an index structure based on multi-attribute tree (MAT) and present an efficient search algorithm over the index tree, named as the searchMAT algorithm. We propose a multi-attribute conjunctive keyword search scheme based on MAT, named as the MCKS-MAT scheme, which can achieve equality conjunction, subset conjunction and range conjunction, as well as satisfy privacy requirements under the known background attack model. In addition, this paper is accompanied by an adequate of experiments for evaluating the effectiveness of the proposed scheme. Experiments demonstrate that, compared to the linear search, the proposed scheme needs the slightly higher preprocessing cost on account of constructing the tree-based index, however, it achieves lower computational overhead in initialization, trapdoor generation and queries.
引用
收藏
页码:34214 / 34225
页数:12
相关论文
共 32 条
[1]   Security in cloud computing: Opportunities and challenges [J].
Ali, Mazhar ;
Khan, Samee U. ;
Vasilakos, Athanasios V. .
INFORMATION SCIENCES, 2015, 305 :357-383
[2]  
[Anonymous], P INT WORKSH INF SEC
[3]  
Ballard L, 2005, LECT NOTES COMPUT SC, V3783, P414
[4]  
Boneh D, 2004, LECT NOTES COMPUT SC, V3027, P506
[5]  
Boneh D, 2007, LECT NOTES COMPUT SC, V4392, P535
[6]  
Brinkman R., P WORKSH SEC DAT MAN, V2011, P114
[7]  
Cao N, 2011, IEEE INFOCOM SER, P829, DOI 10.1109/INFCOM.2011.5935306
[8]   Searchable symmetric encryption: Improved definitions and efficient constructions [J].
Curtmola, Reza ;
Garay, Juan ;
Kamara, Seny ;
Ostrovsky, Rafail .
JOURNAL OF COMPUTER SECURITY, 2011, 19 (05) :895-934
[9]   Fully Homomorphic Encryption Using Ideal Lattices [J].
Gentry, Craig .
STOC'09: PROCEEDINGS OF THE 2009 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2009, :169-178
[10]   Secure conjunctive keyword search over encrypted data [J].
Golle, P ;
Staddon, J ;
Waters, B .
APPLIED CRYPTOGRAPHY AND NETWORK SECURITY, PROCEEDINGS, 2004, 3089 :31-45