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. |
Year | DOI | Venue |
---|---|---|
2013 | 10.1109/TDSC.2013.9 | IEEE Trans. Dependable Sec. Comput. |
Keywords | Field | DocType |
ranking,cloud,similarity relevance,data privacy leakage elimination,vector space model,data privacy,data encryption,cryptography,trse scheme,high-quality data service,encrypted data,homomorphic encryption,ope,encrypted cloud data retrieval,data security,sse,information retrieval,server-side ranking,encrypted cloud data,ciphertext,searchable symmetric encryption,secure multikeyword top-k retrieval,data outsourcing,order-preserving encryption,sensitive information,leaks data privacy,relevance feedback,top-k multikeyword retrieval security,cloud computing,high-quality data services,two-round searchable encryption scheme,data privacy issue,performance analysis,servers,vectors,encryption | Client-side encryption,Computer security,Computer science,Attribute-based encryption,Encryption,Probabilistic encryption,40-bit encryption,Link encryption,On-the-fly encryption,56-bit encryption | Journal |
Volume | Issue | ISSN |
10 | 4 | 1545-5971 |
Citations | PageRank | References |
35 | 1.10 | 16 |
Authors | ||
5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Jiadi Yu | 1 | 371 | 57.86 |
Peng Lu | 2 | 126 | 17.62 |
Yanmin Zhu | 3 | 1767 | 142.50 |
Guangtao Xue | 4 | 456 | 52.52 |
Ming-lu Li | 5 | 2584 | 235.94 |