Paper 2018/433
Achieving Fine-grained Multi-keyword Ranked Search over Encrypted Cloud Data
Guowen Xu and Hongwei Li
Abstract
With the advancement of Cloud computing, people now store their data on remote Cloud servers for larger computation and storage resources. However, users’ data may contain sensitive information of users and should not be disclosed to the Cloud servers. If users encrypt their data and store the encrypted data in the servers, the search capability supported by the servers will be significantly reduced because the server has no access to the data content. In this paper, we propose a Fine-grained Multi-keyword Ranked Search (FMRS) scheme over encrypted Cloud data. Specifically, we leverage novel techniques to realize multikeyword ranked search, which supports both mixed “AND”, “OR” and “NO” operations of keywords and ranking according to the preference factor and relevance score. Through security analysis, we can prove that the data confidentiality, privacy protection of index and trapdoor, and the unlinkability of trapdoor can be achieved in our FMRS. Besides, Extensive experiments show that the FMRS possesses better performance than existing schemes in terms of functionality and efficiency.
Metadata
- Available format(s)
-
PDF
- Category
- Secret-key cryptography
- Publication info
- Preprint. MAJOR revision.
- Keywords
- secret-key cryptography
- Contact author(s)
- guowen xu @ foxmail com
- History
- 2019-05-26: last of 2 revisions
- 2018-05-14: received
- See all versions
- Short URL
- https://ia.cr/2018/433
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2018/433,
author = {Guowen Xu and Hongwei Li},
title = {Achieving Fine-grained Multi-keyword Ranked Search over Encrypted Cloud Data},
howpublished = {Cryptology ePrint Archive, Paper 2018/433},
year = {2018},
note = {\url{https://eprint.iacr.org/2018/433}},
url = {https://eprint.iacr.org/2018/433}
}
