Secure conjunctive multi-keyword ranked search over encrypted cloud data for multiple data owners

被引:34
作者
Yin, Hui [1 ]
Qin, Zheng [2 ]
Zhang, Jixin [2 ]
Ou, Lu [2 ]
Li, Fangmin [1 ]
Li, Keqin [3 ]
机构
[1] Changsha Univ, Coll Comp Engn & Appl Math, Changsha 410022, Hunan, Peoples R China
[2] Hunan Univ, Coll Comp Sci & Elect Engn, Changsha 410082, Hunan, Peoples R China
[3] SUNY Coll New Paltz, Dept Comp Sci, New Paltz, NY 12561 USA
来源
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE | 2019年 / 100卷
基金
中国国家自然科学基金;
关键词
Cloud computing; Conjunctive keyword query; Multiple data owners; Query results ranking; Secure search; PUBLIC-KEY ENCRYPTION; EFFICIENT; DEDUPLICATION; SCHEME;
D O I
10.1016/j.future.2019.05.001
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Recently, secure search over encrypted cloud data has become a hot research spot and challenging task. A number of secure search schemes have been proposed to try to meet this challenge. However, most of them only consider the single data owner model. In this paper, we propose a conjunctive multi-keyword ranked secure search scheme for multiple data owners. To guarantee data security and system flexibility in the multiple data owners environment, we design an ingenious secure query scheme that allows each data owner to adopt randomly chosen temporary keys to build secure indexes for different data files. An authorized data user does not need to know these temporary keys of constructing indexes and can instead randomly choose another temporary query keys to encrypt query keywords, while the cloud server can correctly perform keywords matching over encrypted data files. To rank the query results of a conjunctive multi-keyword query, the cloud server computes the similarity scores between the query and its query results according to encrypted relevance scores of keywords without obtaining any sensitive information. Extensive experiments demonstrate the correctness and practicality of the proposed scheme. (C) 2019 Elsevier B.V. All rights reserved.
引用
收藏
页码:689 / 700
页数:12
相关论文
共 37 条
[1]  
[Anonymous], COMPUTING DISCRETE L
[2]  
[Anonymous], ACM ASIACCS
[3]  
[Anonymous], HERM WORD FREQ COUNT
[4]  
[Anonymous], ACM STOC
[5]  
[Anonymous], TECH REP
[6]  
Ballard L, 2005, LECT NOTES COMPUT SC, V3783, P414
[7]  
Bellare M, 2007, LECT NOTES COMPUT SC, V4622, P535
[8]  
Boldyreva A, 2009, LECT NOTES COMPUT SC, V5479, P224, DOI 10.1007/978-3-642-01001-9_13
[9]  
Boneh D, 2005, LECT NOTES COMPUT SC, V3378, P325
[10]  
Boneh D, 2004, LECT NOTES COMPUT SC, V3027, P506