Efficient and Secure Geometric Range Search Over Encrypted Spatial Data in Mobile Cloud
IEEE Transactions on Mobile Computing · 2025-03 · 24 (3) · 1621-1635
DOI: 10.1109/tmc.2024.3482321 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Mobile Computing, 2025-03. Verfasst von Yinbin Miao und 5 weiteren Autor:innen. Die Arbeit wurde bisher 12-mal zitiert (Crossref) und nennt 35 Literaturangaben. Gefördert von: National Natural Science Foundation of China, Key Research and Development Projects of Shaanxi Province, Shaanxi Fundamental Science Research Project for Mathematics and Physics.
Abstract (Originalsprache)
With the rapid development of mobile computing and the popularity of mobile devices equipped with GPS technology, massive spatial data have become available. Enterprises upload encrypted spatial data to the mobile cloud to save local storage and computation costs. However, the existing secure Geometric Range Search (GRS) solutions are inefficient in terms of building, updating index structure and querying processes. Moreover, the index structures of existing GRS schemes based on Order Preserving Encryption (OPE) leak location order, which may lead to reconstruction attacks. To solve these issues, we first propose an efficient and secure GRS scheme using Radix-Tree, namely GRSRT-I. Specifically, we construct an index structure based on Radix-tree to achieve efficient search and update, then use homomorphic encryption NTRU to resist chosen-plaintext attack, finally design a dual-server architecture to alleviate the burdens on mobile users caused by multiple rounds of interactions. Furthermore, we propose an enhanced scheme, GRSRT-II, by combining Order-Revealing Encryption and OPE, which greatly improves the search efficiency while slightly reducing the security. We formally prove the security of our proposed schemes, and conduct extensive experiments to demonstrate that GRSRT-I can improve the query efficiency by up to at least 1.5 times when compared with previous solutions and GRSRT-II can achieve a higher level of search efficiency.
Förderung
- National Natural Science Foundation of China
- Key Research and Development Projects of Shaanxi Province
- Shaanxi Fundamental Science Research Project for Mathematics and Physics
- Fundamental Research Funds for the Central Universities
- Intelligent Policing Key Laboratory of Sichuan Province
- Open fund of Key Laboratory of Computing Power Network and Information Security
- Cloud Technology Endowed Professorship
Zitieren
APA
Miao, Y., Wang, G., Li, X., Li, H., Choo, K. R., & Deng, R. H. (2025). Efficient and Secure Geometric Range Search Over Encrypted Spatial Data in Mobile Cloud. IEEE Transactions on Mobile Computing, 24(3), 1621-1635. https://doi.org/10.1109/tmc.2024.3482321
Vancouver
Miao Y, Wang G, Li X, Li H, Choo KR, Deng RH. Efficient and Secure Geometric Range Search Over Encrypted Spatial Data in Mobile Cloud. IEEE Transactions on Mobile Computing. 2025;24(3):1621-1635. doi:10.1109/tmc.2024.3482321
BibTeX
@article{Miao2025,
author = {Miao, Yinbin and Wang, Guijuan and Li, Xinghua and Li, Hongwei and Choo, Kim-Kwang Raymond and Deng, Rebert H.},
title = {Efficient and Secure Geometric Range Search Over Encrypted Spatial Data in Mobile Cloud},
journal = {IEEE Transactions on Mobile Computing},
year = {2025},
volume = {24},
number = {3},
pages = {1621--1635},
doi = {10.1109/tmc.2024.3482321}
}
EUVIMED