BRASP: Boolean Range Queries over Encrypted Spatial Data with Access and Search Pattern Privacy

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Zhang, Jing, Yang, Ganxuan, Yang, Yifei, Wen, Siqi, Qiu, Zhengyang
Format: Preprint
Published: 2026
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866913018324975616
author Zhang, Jing
Yang, Ganxuan
Yang, Yifei
Wen, Siqi
Qiu, Zhengyang
author_facet Zhang, Jing
Yang, Ganxuan
Yang, Yifei
Wen, Siqi
Qiu, Zhengyang
contents Searchable Encryption (SE) enables users to query outsourced encrypted data while preserving data confidentiality. However, most efficient schemes still leak the search pattern and access pattern, which may allow an honest-but-curious cloud server to infer query contents, user interests, or returned records from repeated searches and observed results. Existing pattern-hiding solutions mainly target keyword queries and do not naturally support Boolean range queries over encrypted spatial data. This paper presents BRASP, a searchable encryption scheme for Boolean range queries over encrypted spatial data. BRASP combines Hilbert-curve-based prefix encoding with encrypted prefix--ID and keyword--ID inverted indexes to support efficient spatial range filtering and conjunctive keyword matching. To hide the search pattern and access pattern under a dual-server setting, BRASP integrates index shuffling for encrypted keyword and prefix entries with ID-field redistribution across two non-colluding cloud servers. BRASP also supports dynamic updates and achieves forward security. We formalize the security of BRASP through confidentiality, shuffle indistinguishability, query unforgeability, and forward-security analyses, and we evaluate its performance experimentally on a real-world dataset. The results show that BRASP effectively protects query privacy while incurring relatively low computation and communication overhead. To facilitate reproducibility and further research, the source code of BRASP is publicly available at https://github.com/Egbert-Lannister/BRASP
format Preprint
id arxiv_https___arxiv_org_abs_2604_07797
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle BRASP: Boolean Range Queries over Encrypted Spatial Data with Access and Search Pattern Privacy
Zhang, Jing
Yang, Ganxuan
Yang, Yifei
Wen, Siqi
Qiu, Zhengyang
Cryptography and Security
Searchable Encryption (SE) enables users to query outsourced encrypted data while preserving data confidentiality. However, most efficient schemes still leak the search pattern and access pattern, which may allow an honest-but-curious cloud server to infer query contents, user interests, or returned records from repeated searches and observed results. Existing pattern-hiding solutions mainly target keyword queries and do not naturally support Boolean range queries over encrypted spatial data. This paper presents BRASP, a searchable encryption scheme for Boolean range queries over encrypted spatial data. BRASP combines Hilbert-curve-based prefix encoding with encrypted prefix--ID and keyword--ID inverted indexes to support efficient spatial range filtering and conjunctive keyword matching. To hide the search pattern and access pattern under a dual-server setting, BRASP integrates index shuffling for encrypted keyword and prefix entries with ID-field redistribution across two non-colluding cloud servers. BRASP also supports dynamic updates and achieves forward security. We formalize the security of BRASP through confidentiality, shuffle indistinguishability, query unforgeability, and forward-security analyses, and we evaluate its performance experimentally on a real-world dataset. The results show that BRASP effectively protects query privacy while incurring relatively low computation and communication overhead. To facilitate reproducibility and further research, the source code of BRASP is publicly available at https://github.com/Egbert-Lannister/BRASP
title BRASP: Boolean Range Queries over Encrypted Spatial Data with Access and Search Pattern Privacy
topic Cryptography and Security
url https://arxiv.org/abs/2604.07797