Multi-Keyword Ranked Searchable Encryption with the Wildcard Keyword for Data Sharing in Cloud Computing

被引:14
作者
Liu, Jinlu [1 ]
Zhao, Bo [1 ]
Qin, Jing [1 ,2 ]
Zhang, Xi [1 ]
Ma, Jixin [3 ]
机构
[1] Shandong Univ, Sch Math, Jinan 250100, Shandong, Peoples R China
[2] Chinese Acad Sci, Inst Informat Engn, State Key Lab Informat Secur, Beijing 100093, Peoples R China
[3] Univ Greenwich, Sch Comp & Math Sci, London, England
基金
中国国家自然科学基金;
关键词
searchable encryption; bloom filter; hierarchical clustering; TF-IDF; multi-keyword ranked; wildcard keyword;
D O I
10.1093/comjnl/bxab153
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Multi-keyword ranked searchable encryption (MRSE) supports multi-keyword contained in one query and returns the top-k search results related to the query keyword set. It realized effective search on encrypted data. Most previous works about MRSE can only make the complete keyword search and rank on the server-side. However, with more practice, users may not be able to express some keywords completely when searching. Server-side ranking increases the possibilities of the server inferring some keywords queried, leading to the leakage of the user's sensitive information. In this paper, we propose a new MRSE system named 'multi-keyword ranked searchable encryption with the wildcard keyword (MRSW)'. It allows the query keyword set to contain a wildcard keyword by using Bloom filter (BF). Using hierarchical clustering algorithm, a clustering Bloom filter tree (CBF-Tree) is constructed, which improves the efficiency of wildcard search. By constructing a modified inverted index (MII) table on the basis of the term frequency-inverse document frequency (TF-IDF) rule, the ranking function of MRSW is performed by the user. MRSW is proved secure under adaptive chosen-keyword attack (CKA2) model, and experiments on a real data set from the web of science indicate that MRSW is efficient and practical.
引用
收藏
页码:184 / 196
页数:13
相关论文
共 21 条
[1]   SPACE/TIME TRADE/OFFS IN HASH CODING WITH ALLOWABLE ERRORS [J].
BLOOM, BH .
COMMUNICATIONS OF THE ACM, 1970, 13 (07) :422-&
[2]  
Bosch Christoph, 2011, Secure Data Management. Proceedings 8th VLDB Workshop (SDM2011), P114, DOI 10.1007/978-3-642-23556-6_8
[3]  
Cao J., 2019, ARXIV PREPRINT ARXIV
[4]   Privacy-Preserving Multi-Keyword Ranked Search over Encrypted Cloud Data [J].
Cao, Ning ;
Wang, Cong ;
Li, Ming ;
Ren, Kui ;
Lou, Wenjing .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2014, 25 (01) :222-233
[5]  
Cao N, 2011, IEEE INFOCOM SER, P829, DOI 10.1109/INFCOM.2011.5935306
[6]  
Chang YC, 2005, LECT NOTES COMPUT SC, V3531, P442
[7]   Structured Encryption and Controlled Disclosure [J].
Chase, Melissa ;
Kamara, Seny .
ADVANCES IN CRYPTOLOGY - ASIACRYPT 2010, 2010, 6477 :577-594
[8]   An Efficient Privacy-Preserving Ranked Keyword Search Method [J].
Chen, Chi ;
Zhu, Xiaojie ;
Shen, Peisong ;
Hu, Jiankun ;
Guo, Song ;
Tari, Zahir ;
Zomaya, Albert Y. .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2016, 27 (04) :951-963
[9]   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
[10]   Toward Efficient Multi-Keyword Fuzzy Search Over Encrypted Outsourced Data With Accuracy Improvement [J].
Fu, Zhangjie ;
Wu, Xinle ;
Guan, Chaowen ;
Sun, Xingming ;
Ren, Kui .
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2016, 11 (12) :2706-2716