Publication Type

Journal Article

Version

acceptedVersion

Publication Date

12-2017

Abstract

Multi-keyword rank searchable encryption (MRSE) returns the top-k results in response to a data user's request of multi-keyword search over encrypted data, and hence provides an efficient way for preserving data privacy in cloud storage systems while without loss of data usability. Many existing MRSE systems are constructed based on an algorithm which we term as k-nearest neighbor for searchable encryption (KNN-SE). Unfortunately, KNN-SE has a number of shortcomings which limit its practical applications. In this paper, we propose a new MRSE system which overcomes almost all the defects of the KNN-SE based MRSE systems. Specifically, our new system does not require a predefined keyword set and supports keywords in arbitrary languages, is a multi-user system which supports flexible search authorization and time-controlled revocation, and it achieves better data privacy protection since even the cloud server is not able to tell which documents are the top-k results returned to a data user. We also conduct extensive experiments to demonstrate the efficiency of the new system.

Keywords

top-k, searchable encryption, Servers, Algorithm design and analysis, Encryption, Cloud computing, multiple keyword, Indexes, rank, privacy-preserving

Discipline

Information Security

Research Areas

Cybersecurity

Publication

IEEE Transactions on Dependable and Secure Computing

Volume

17

Issue

2

First Page

320

Last Page

334

ISSN

1545-5971

Identifier

10.1109/TDSC.2017.2787588

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Copyright Owner and License

Authors

Additional URL

https://doi.org/10.1109/TDSC.2017.2787588

Download

Share

COinS