Lightweight and Privacy-Preserving Multi-Keyword Search over Outsourced Data
Applied Sciences · 22.02.2023 · 13 (5) · 2847
DOI: 10.3390/app13052847 ↗Kurz gefasst
Fachartikel in der Zeitschrift Applied Sciences, online erschienen am 22.02.2023. Verfasst von Meng Zhao und 6 weiteren Autor:innen. Die Arbeit wurde bisher 5-mal zitiert (Crossref) und nennt 42 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Guangxi Natural Science Foundation, National Natural Science Foundation of China, Scientific Research Project of Hunan Provincial Department of Education.
Abstract (Originalsprache)
In cloud computing, documents can be outsourced to the cloud server to achieve flexible access control and efficient sharing among multiple users. The outsourced documents can be intelligently searched according to some keywords with the help of cloud server. During the search process, some private information of outsourced documents may be leaked since the keywords may contain sensitive information of users. However, existing privacy-preserving keyword search schemes have high computation complexity, which are not suitable for resource-constrained end devices—that is, the data processing and search trapdoor generation procedures require users to take resource-intensive computations, e.g., high-dimensional matrix operations, exponentiations and bilinear pairings, which are unaffordable by resource-constrained devices. To address the issues of efficiency and privacy for realizing sorted multi-keyword search over outsourced data in clouds, this paper proposes a lightweight privacy-preserving ranked multi-keyword search (PRMS) scheme, which is further extended to allow each outsourced document to be associated with multiple types of keywords. The searched documents can be sorted according to their similarity scores between the search query and the keyword index of documents, so that only when the similarity score exceeds a given threshold, the corresponding searched document will be returned. The security analysis demonstrates that the proposed PRMS schemes can guarantee the privacy of outsourced documents and keywords, and provides unlinkability for search trapdoors. Performance analysis and comparison show the practicality of the proposed PRMS schemes.
Förderung
- Guangxi Natural Science Foundation
- National Natural Science Foundation of China
- Scientific Research Project of Hunan Provincial Department of Education
- High-level Innovation Team and Outstanding Scholar Program for universities of Guangxi
- Peng Cheng Laboratory Projects of Guangdong Province
Zitieren
APA
Zhao, M., Liu, L., Ding, Y., Deng, H., Liang, H., Wang, H., & Wang, Y. (2023). Lightweight and Privacy-Preserving Multi-Keyword Search over Outsourced Data. Applied Sciences, 13(5), 2847. https://doi.org/10.3390/app13052847
Vancouver
Zhao M, Liu L, Ding Y, Deng H, Liang H, Wang H, et al. Lightweight and Privacy-Preserving Multi-Keyword Search over Outsourced Data. Applied Sciences. 2023;13(5):2847. doi:10.3390/app13052847
BibTeX
@article{Zhao2023,
author = {Zhao, Meng and Liu, Lingang and Ding, Yong and Deng, Hua and Liang, Hai and Wang, Huiyong and Wang, Yujue},
title = {Lightweight and Privacy-Preserving Multi-Keyword Search over Outsourced Data},
journal = {Applied Sciences},
year = {2023},
volume = {13},
number = {5},
pages = {2847},
doi = {10.3390/app13052847}
}
EUVIMED