English

RISK: Efficiently processing rich spatial-keyword queries on encrypted geo-textual data

Databases 2026-02-25 v1

Abstract

Symmetric searchable encryption (SSE) for geo-textual data has attracted significant attention. However, existing schemes rely on task-specific, incompatible indices for isolated specific secure queries (e.g., range or k-nearest neighbor spatial-keyword queries), limiting practicality due to prohibitive multi-index overhead. To address this, we propose RISK, a model for rich spatial-keyword queries on encrypted geo-textual data. In a textual-first-then-spatial manner, RISK is built on a novel k-nearest neighbor quadtree (kQ-tree) that embeds representative and regional nearest neighbors, with the kQ-tree further encrypted using standard cryptographic tools (e.g., keyed hash functions and symmetric encryption). Overall, RISK seamlessly supports both secure range and k-nearest neighbor queries, is provably secure under IND-CKA2 model, and extensible to multi-party scenarios and dynamic updates. Experiments on three real-world and one synthetic datasets show that RISK outperforms state-of-the-art methods by at least 0.5 and 4 orders of magnitude in response time for 1% range queries and 10-nearest neighbor queries, respectively.

Keywords

Cite

@article{arxiv.2602.20952,
  title  = {RISK: Efficiently processing rich spatial-keyword queries on encrypted geo-textual data},
  author = {Zhen Lv and Cong Cao and Hongwei Huo and Jiangtao Cui and Yanguo Peng and Hui Li and Yingfan Liu},
  journal= {arXiv preprint arXiv:2602.20952},
  year   = {2026}
}

Comments

15 pages, 10 figures, IEEE ICDE

R2 v1 2026-07-01T10:49:58.518Z