Privacy-preserving multi-keyword text search in the cloud supporting similarity-based ranking
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
Secure k-NN computation on encrypted cloud data without sharing key with query users
Proceedings of the 2013 international workshop on Security in cloud computing
Searching private data in a cloud encrypted domain
Proceedings of the 10th Conference on Open Research Areas in Information Retrieval
Secure k-NN query on encrypted cloud database without key-sharing
International Journal of Electronic Security and Digital Forensics
Search pattern leakage in searchable encryption: Attacks and new construction
Information Sciences: an International Journal
| Hi-index | 0.00 |
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.