Database Paper Browser

Back to papers

OBIR-tree: An Efficient Oblivious Index for Spatial Keyword Queries on Secure Enclaves

Summary: OBIR-tree: an oblivious top-k spatial keyword index for encrypted data, hiding search, access, and volume patterns, built from IR-tree and PathORAM. SGX + Real/Dummy Tree (RDT) lowers enclave costs; experiments show 25x–723x speedups vs baselines on real datasets. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
7053
Venue
SIGMOD
Year
2025
Pagerank
4.3648789e-05
Overall Rank
9,235 | 35.82%
DOI
10.1145/3709688

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
10,283 Enabling Index-free Adjacency in Oblivious Graph Processing with Delayed Duplications 2026 VLDB 4.1905499e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 7 of 7 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers