Enabling Secure and Efficient Ranked Keyword Search over Outsourced Cloud Data

被引:333
作者
Wang, Cong [1 ]
Cao, Ning [2 ]
Ren, Kui [1 ]
Lou, Wenjing [3 ]
机构
[1] IIT, Dept Elect & Comp Engn, Chicago, IL 60616 USA
[2] Worcester Polytech Inst, Dept Elect & Comp Engn, Worcester, MA 01609 USA
[3] Virginia Polytech Inst & State Univ, Dept Comp Sci, Falls Church, VA 22043 USA
基金
美国国家科学基金会;
关键词
Ranked search; searchable encryption; order-preserving mapping; confidential data; cloud computing;
D O I
10.1109/TPDS.2011.282
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Cloud computing economically enables the paradigm of data service outsourcing. However, to protect data privacy, sensitive cloud data have to be encrypted before outsourced to the commercial public cloud, which makes effective data utilization service a very challenging task. Although traditional searchable encryption techniques allow users to securely search over encrypted data through keywords, they support only Boolean search and are not yet sufficient to meet the effective data utilization need that is inherently demanded by large number of users and huge amount of data files in cloud. In this paper, we define and solve the problem of secure ranked keyword search over encrypted cloud data. Ranked search greatly enhances system usability by enabling search result relevance ranking instead of sending undifferentiated results, and further ensures the file retrieval accuracy. Specifically, we explore the statistical measure approach, i.e., relevance score, from information retrieval to build a secure searchable index, and develop a one-to-many order-preserving mapping technique to properly protect those sensitive score information. The resulting design is able to facilitate efficient server-side ranking without losing keyword privacy. Thorough analysis shows that our proposed solution enjoys "as-strong-as-possible" security guarantee compared to previous searchable encryption schemes, while correctly realizing the goal of ranked keyword search. Extensive experimental results demonstrate the efficiency of the proposed solution.
引用
收藏
页码:1467 / 1479
页数:13
相关论文
共 34 条
[1]  
[Anonymous], 2012, REQ COMM DAT
[2]  
[Anonymous], 2009, SEC GUID CRIT AR FOC
[3]  
[Anonymous], 2001, IEEE Data Eng. Bull.
[4]  
Armbrust M, 2009, UCBEECS200928
[5]  
Ballard L., 2005, P INT C INF COMM SEC
[6]  
Bao F., 2008, P INT C INF SEC PRAC
[7]  
Bellare M., 2007, P ANN INT CRYPT C AD
[8]  
Boldyreva A., 2009, P INT C ADV CRYPT EU
[9]  
Boneh D., 2004, P INT C ADV CRYPT EU
[10]  
Boneh D, 2007, LECT NOTES COMPUT SC, V4392, P535