Research Article
Privacy-Preserving Ranked Searchable Encryption Based on Differential Privacy
@INPROCEEDINGS{10.1007/978-3-030-91424-0_19, author={Yu Zhao and Chungen Xu and Lin Mei and Pan Zhang}, title={Privacy-Preserving Ranked Searchable Encryption Based on Differential Privacy}, proceedings={Quality, Reliability, Security and Robustness in Heterogeneous Systems. 17th EAI International Conference, QShine 2021, Virtual Event, November 29--30, 2021, Proceedings}, proceedings_a={QSHINE}, year={2021}, month={11}, keywords={Differential privacy Ranked search Laplace distribution Order-preserving encryption}, doi={10.1007/978-3-030-91424-0_19} }- Yu Zhao
Chungen Xu
Lin Mei
Pan Zhang
Year: 2021
Privacy-Preserving Ranked Searchable Encryption Based on Differential Privacy
QSHINE
Springer
DOI: 10.1007/978-3-030-91424-0_19
Abstract
Ranked search allows the cloud server to search the top-kmost relevant documents according to the relevance score between query keyword and documents, which has been recognized as the most promising way to realize secure search over encrypted database. However, recent studies show that some privacy protection methods commonly used in ranked search, like order-preserving encryption (OPE), have some security problems. In this paper, we first propose a scheme, called privacy-preserving ranked searchable encryption based on differential privacy (DP-RSE). Specifically, we add noise drawn from a Laplace distribution into the relevance score to disturb its value. In this way, no matter how much background the adversary has, he (or she) cannot obtain the true relevance score or ranked order. Moreover, our scheme ensures the correctness of search results with high probability. The experiment results show that our scheme can achieve sub-linear efficiency and the accuracy of search results can reach 94%.
