Research Article
Privacy-Preserving Relevance Ranking Scheme and Its Application in Multi-keyword Searchable Encryption
@INPROCEEDINGS{10.1007/978-3-319-78813-5_7, author={Peisong Shen and Chi Chen and Xiaojie Zhu}, title={Privacy-Preserving Relevance Ranking Scheme and Its Application in Multi-keyword Searchable Encryption}, proceedings={Security and Privacy in Communication Networks. 13th International Conference, SecureComm 2017, Niagara Falls, ON, Canada, October 22--25, 2017, Proceedings}, proceedings_a={SECURECOMM}, year={2018}, month={4}, keywords={Searchable symmetric encryption Privacy-preserving relevance ranking Cloud storage}, doi={10.1007/978-3-319-78813-5_7} }- Peisong Shen
Chi Chen
Xiaojie Zhu
Year: 2018
Privacy-Preserving Relevance Ranking Scheme and Its Application in Multi-keyword Searchable Encryption
SECURECOMM
Springer
DOI: 10.1007/978-3-319-78813-5_7
Abstract
Searchable Symmetric Encryption (SSE) which enables keyword searches on encrypted data, has drawn a lot of research attention in recent years. However, many SSE schemes do not support privacy-preserving relevance ranking which is a necessary feature for users to quickly locate the needed documents in a large number of retrieved documents. In this paper, we proposed two Privacy-Preserving Relevance Ranking (PPRR) schemes based on RSA encryption and ElGamal encryption. The proposed PPRR schemes preserve rank privacy and reduce storage cost at server side. Furthermore, we integrate PPRR with current multi-keyword SSE algorithm to achieve multi-keyword ranked search on encrypted data. Computation complexity, storage complexity and security of composite schemes are verified with an experiment on real-world dataset.