Enabling Secure and Efficient Ranked Keyword Search over Outsourced Cloud Data

• Published in: IEEE transactions on parallel and distributed systems Vol. 23; no. 8; pp. 1467 - 1479
• Main Authors: Wang, Cong, Cao, Ning, Ren, Kui, Lou, Wenjing
• Format: Journal Article
• Language: English
• Published: IEEE 01-08-2012
• Subjects: Cloud computing; confidential data; Encryption; Indexes; Keyword search; order-preserving mapping; Ranked search; searchable encryption; Servers
• ISSN: 1045-9219; 1558-2183
• DOI: 10.1109/TPDS.2011.282

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.