Yunlong Gao

Yunlong Gao

Auto-generated profile, based on publicly available information

Yunlong Gao

School of Computer Science, the Engineering Research Center of Digital Forensics, Nanjing University of Information Science and Technology, Nanjing, China

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
20 June 2025 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
Fuyuan SongFuyuan Song
Fuyuan Song
YGYunlong Gao
Yunlong Gao
MZMingyang Zhao
Mingyang Zhao
Chuan ZhangChuan Zhang
Chuan Zhang
ZQZheng Qin
Zheng Qin
BXBin XIAO
Bin XIAO
Spatial keyword query has emerged as a critical service in mobile cloud, enabling cloud servers to retrieve spatiotextual 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 (INDCPA). Extensive experimental evaluations show that the proposed EPSKQ and EPSKQ+ schemes significantly outperform state-ofthe-art schemes in terms of computational and communication costs, with EPSKQ+ being 9× and 3× faster than the state-ofthe-art schemes in the index build and query phase, respectively