High-Dimensional and Secure Spatial Keyword Query With Arbitrary Ranges in Mobile Cloud
IEEE Transactions on Mobile Computing · 2025-11 · 24 (11) · 12121-12136
DOI: 10.1109/tmc.2025.3581562 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Mobile Computing, 2025-11. Verfasst von Fuyuan Song und 5 weiteren Autor:innen. Die Arbeit wurde bisher 10-mal zitiert (Crossref) und nennt 41 Literaturangaben. Gefördert von: National Natural Science Foundation of China, China Postdoctoral Science Foundation, Open Foundation of Key Laboratory of Cyberspace Security.
Abstract (Originalsprache)
Spatial keyword query has emerged as a critical service in mobile cloud, enabling cloud servers to retrieve spatio-textual objects within a mobile user’s query range that contain specified query keywords. Numerous secure spatial keyword query schemes have been developed to enable geometric range queries and keyword searches on encrypted spatial data. However, spatial keyword queries are typically designed for searching high-dimensional spatial data across arbitrary geographic ranges. Most of them fail to handle arbitrary geometric range queries and efficient spatial keyword query over high-dimensional encrypted data. To address these issues, we propose a high-dimEnsional and Privacy-preserving Spatial Keyword Query (EPSKQ) scheme with arbitrary geometric ranges over encrypted spatial data, leveraging Hilbert curve encoding and Enhanced Matrix-based Inner Product Encryption (EMIPE). In EPSKQ, spatial locations and multi-keywords are encoded into compact vectors, and arbitrary geometric range queries are transformed into range intersection tests. To reduce computational overhead, we employ vector bucketing technique to partition large-size vectors into several small-size sub-vectors. Furthermore, we design a novel index structure called Hilbert Binary tree (HB-tree) to optimize range intersection tests. Based on HB-tree, we propose an enhanced spatial keyword query scheme, named EPSKQ+, which further improves query performance. Security analysis demonstrates that both EPSKQ and EPSKQ+ achieve semantic security against indistinguishability under chosen-plaintext attack (IND-CPA). Extensive experimental evaluations show that the proposed EPSKQ and EPSKQ+ schemes significantly outperform state-of-the-art schemes in terms of computational and communication costs, with EPSKQ+ being 9× and 3× faster than the state-of-the-art schemes in the index build and query phase, respectively.
Förderung
- National Natural Science Foundation of China
- China Postdoctoral Science Foundation
- Open Foundation of Key Laboratory of Cyberspace Security
- Ministry of Education of the People's Republic of China
Zitieren
APA
Song, F., Gao, Y., Zhao, M., Zhang, C., Qin, Z., & Xiao, B. (2025). High-Dimensional and Secure Spatial Keyword Query With Arbitrary Ranges in Mobile Cloud. IEEE Transactions on Mobile Computing, 24(11), 12121-12136. https://doi.org/10.1109/tmc.2025.3581562
Vancouver
Song F, Gao Y, Zhao M, Zhang C, Qin Z, Xiao B. High-Dimensional and Secure Spatial Keyword Query With Arbitrary Ranges in Mobile Cloud. IEEE Transactions on Mobile Computing. 2025;24(11):12121-12136. doi:10.1109/tmc.2025.3581562
BibTeX
@article{Song2025,
author = {Song, Fuyuan and Gao, Yunlong and Zhao, Mingyang and Zhang, Chuan and Qin, Zheng and Xiao, Bin},
title = {High-Dimensional and Secure Spatial Keyword Query With Arbitrary Ranges in Mobile Cloud},
journal = {IEEE Transactions on Mobile Computing},
year = {2025},
volume = {24},
number = {11},
pages = {12121--12136},
doi = {10.1109/tmc.2025.3581562}
}
EUVIMED