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 条
[11]  
Goh Eu-Jin, 2003, IACR Cryptol. ePrint Arch.
[12]   Dynamic Multi-Keyword Ranked Search Based on Bloom Filter Over Encrypted Cloud Data [J].
Guo, Cheng ;
Zhuang, Ruhan ;
Chang, Chin-Chen ;
Yuan, Qiongqiong .
IEEE ACCESS, 2019, 7 :35826-35837
[13]   Efficient wildcard search over encrypted data [J].
Hu, Changhui ;
Han, Lidong .
INTERNATIONAL JOURNAL OF INFORMATION SECURITY, 2016, 15 (05) :539-547
[14]  
Sedghi S, 2010, LECT NOTES COMPUT SC, V6280, P138, DOI 10.1007/978-3-642-15317-4_10
[15]  
Song DXD, 2000, P IEEE S SECUR PRIV, P44, DOI 10.1109/SECPRI.2000.848445
[16]  
Suga Takanori, 2012, Provable Security. Proceedings of the 6th International Conference (ProvSec 2012), P235, DOI 10.1007/978-3-642-33272-2_15
[17]  
Wang B, 2014, IEEE INFOCOM SER, P2112, DOI 10.1109/INFOCOM.2014.6848153
[18]   A Secure and Dynamic Multi-Keyword Ranked Search Scheme over Encrypted Cloud Data [J].
Xia, Zhihua ;
Wang, Xinhui ;
Sun, Xingming ;
Wang, Qian .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2016, 27 (02) :340-352
[19]   Flexible Wildcard Searchable Encryption System [J].
Yang, Yang ;
Liu, Ximeng ;
Deng, Robert H. ;
Weng, Jian .
IEEE TRANSACTIONS ON SERVICES COMPUTING, 2020, 13 (03) :464-477
[20]   Toward Secure Multikeyword Top-k Retrieval over Encrypted Cloud Data [J].
Yu, Jiadi ;
Lu, Peng ;
Zhu, Yanmin ;
Xue, Guangtao ;
Li, Minglu .
IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2013, 10 (04) :239-250