CRApr 9

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

arXiv:2604.077975.5Has Code
Predicted impact top 54% in CR · last 90 daysOriginality Incremental advance
AI Analysis

This addresses privacy concerns for users outsourcing spatial data to cloud servers, though it is incremental as it builds on existing pattern-hiding techniques for keyword queries.

The paper tackles the problem of enabling Boolean range queries over encrypted spatial data while hiding search and access patterns, presenting BRASP, which combines Hilbert-curve encoding with encrypted indexes and dual-server shuffling to achieve this with low overhead.

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

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes