Efficient multi-keyword ranked query over encrypted data in cloud computing

被引:70
作者
Li, Ruixuan [1 ]
Xu, Zhiyong [2 ]
Kang, Wanshang [1 ]
Yow, Kin Choong [3 ]
Xu, Cheng-Zhong [3 ,4 ]
机构
[1] Huazhong Univ Sci & Technol, Sch Comp Sci & Technol, Wuhan 430074, Hubei, Peoples R China
[2] Suffolk Univ, Dept Math & Comp Sci, Boston, MA 02114 USA
[3] Chinese Acad Sci, Shenzhen Inst Adv Technol, Shenzhen 518055, Guangdong, Peoples R China
[4] Wayne State Univ, Dept Elect & Comp Engn, Detroit, MI 48202 USA
来源
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE | 2014年 / 30卷
基金
中国国家自然科学基金; 美国国家科学基金会;
关键词
Cloud computing; Multi-keyword query; Ranked query; Top-k query; Data encryption; Privacy preserving; PUBLIC-KEY ENCRYPTION; SEARCH; PRIVACY;
D O I
10.1016/j.future.2013.06.029
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Cloud computing infrastructure is a promising new technology and greatly accelerates the development of large scale data storage, processing and distribution. However, security and privacy become major concerns when data owners outsource their private data onto public cloud servers that are not within their trusted management domains. To avoid information leakage, sensitive data have to be encrypted before uploading onto the cloud servers, which makes it a big challenge to support efficient keyword-based queries and rank the matching results on the encrypted data. Most current works only consider single keyword queries without appropriate ranking schemes. In the current multi-keyword ranked search approach, the keyword dictionary is static and cannot be extended easily when the number of keywords increases. Furthermore, it does not take the user behavior and keyword access frequency into account. For the query matching result which contains a large number of documents, the out-of-order ranking problem may occur. This makes it hard for the data consumer to find the subset that is most likely satisfying its requirements. In this paper, we propose a flexible multi-keyword query scheme, called MKQE to address the aforementioned drawbacks. MKQE greatly reduces the maintenance overhead during the keyword dictionary expansion. It takes keyword weights and user access history into consideration when generating the query result. Therefore, the documents that have higher access frequencies and that match closer to the users' access history get higher rankings in the matching result set. Our experiments show that MKQE presents superior performance over the current solutions. (C) 2013 Elsevier B.V. All rights reserved.
引用
收藏
页码:179 / 190
页数:12
相关论文
共 34 条
[1]  
Abdalla M, 2005, LECT NOTES COMPUT SC, V3621, P205
[2]  
[Anonymous], 2003, CRYPTOLOGY EPRINT AR
[3]  
[Anonymous], 2010, 2010 IEEE International Symposium on Parallel Distributed Processing (IPDPS), DOI DOI 10.1109/INFCOM.2010.5462196
[4]  
[Anonymous], 2005, APPL CRYPTOGRAPHY NE
[5]  
Ballard L, 2005, LECT NOTES COMPUT SC, V3783, P414
[6]  
Boneh D, 2004, LECT NOTES COMPUT SC, V3027, P506
[7]  
Boneh D, 2007, LECT NOTES COMPUT SC, V4392, P535
[8]  
Brinkman, 2007, THESIS U TWENTE
[9]  
Cao N, 2011, IEEE INFOCOM SER, P829, DOI 10.1109/INFCOM.2011.5935306
[10]  
Chaudhuri Surajit, 2007, 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, P663, DOI 10.1145/1277741.1277855