The Community for Technology Leaders
Green Image
Issue No. 04 - July-Aug. (2013 vol. 10)
ISSN: 1545-5971
pp: 239-250
Minglu Li , Shanghai Jiao Tong University, Shanghai
Yanmin Zhu , Shanghai Jiao Tong University, Shanghai
Peng Lu , Shanghai Jiao Tong University, Shanghai
Jiadi Yu , Shnaghai Jiaotong University, Shanghai
Guangtao Xue , Shanghai Jiao Tong University, Shanghai
ABSTRACT
Cloud computing has emerging as a promising pattern for data outsourcing and high-quality data services. However, concerns of sensitive information on cloud potentially causes privacy problems. Data encryption protects data security to some extent, but at the cost of compromised efficiency. Searchable symmetric encryption (SSE) allows retrieval of encrypted data over cloud. In this paper, we focus on addressing data privacy issues using SSE. For the first time, we formulate the privacy issue from the aspect of similarity relevance and scheme robustness. We observe that server-side ranking based on order-preserving encryption (OPE) inevitably leaks data privacy. To eliminate the leakage, we propose a two-round searchable encryption (TRSE) scheme that supports top-$(k)$ multikeyword retrieval. In TRSE, we employ a vector space model and homomorphic encryption. The vector space model helps to provide sufficient search accuracy, and the homomorphic encryption enables users to involve in the ranking while the majority of computing work is done on the server side by operations only on ciphertext. As a result, information leakage can be eliminated and data security is ensured. Thorough security and performance analysis show that the proposed scheme guarantees high security and practical efficiency.
INDEX TERMS
Encryption, Data privacy, Vectors, Servers, Cloud computing, vector space model, Cloud, data privacy, ranking, similarity relevance, homomorphic encryption
CITATION
Minglu Li, Yanmin Zhu, Peng Lu, Jiadi Yu, Guangtao Xue, "Toward Secure Multikeyword Top-k Retrieval over Encrypted Cloud Data", IEEE Transactions on Dependable and Secure Computing, vol. 10, no. , pp. 239-250, July-Aug. 2013, doi:10.1109/TDSC.2013.9
97 ms
(Ver )