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)
Incoming Non-self Citations Over Time
Authors
- 1. Zikai Ye (Xidian University)
- 2. Xiangyu Wang (Xidian University)
- 3. Zesen Liu (Xidian University)
- 4. Dan Zhu (Northwestern Polytechnical University)
- 5. Jianfeng Ma (Xidian University)
BibTeX Citation
@inproceedings{ye_sigmod25,
title = {{OBIR-tree: An Efficient Oblivious Index for Spatial Keyword Queries on Secure Enclaves}},
author = {Ye, Zikai and Wang, Xiangyu and Liu, Zesen and Zhu, Dan and Ma, Jianfeng},
series = {{SIGMOD} '25},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3709688},
url = {https://dl.acm.org/doi/10.1145/3709688},
year = {2025}
}Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,264 | Loom: Weaving PCS-Preserving and Searchable Cloud Backups for Secure Messaging | 2026 | SIGMOD | 5.093636e-05 |
| 10,570 | Enabling Index-free Adjacency in Oblivious Graph Processing with Delayed Duplications | 2026 | VLDB | 5.093636e-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.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4 | The R*-tree: An Efficient and Robust Access Method for Points and Rectangles | 1990 | SIGMOD | 0.001157935 |
| 2,045 | Efficient Oblivious Database Joins | 2020 | VLDB | 9.2632279e-05 |
| 2,319 | Secure kNN Computation on Encrypted Databases | 2009 | SIGMOD | 8.7577497e-05 |
| 2,417 | Towards Practical Oblivious Join | 2022 | SIGMOD | 8.6061949e-05 |
| 2,989 | Spatial Keyword Query Processing: An Experimental Evaluation | 2013 | VLDB | 7.8896275e-05 |
| 6,797 | Efficient Searchable Encryption Through Compression | 2018 | VLDB | 5.7707661e-05 |
| 7,420 | Doquet: Differentially Oblivious Range and Join Queries with Private Data Structures | 2023 | VLDB | 5.6226175e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,102 | Fast Range Query Processing with Strong Privacy Protection for Cloud Computing | 2014 | VLDB |
| 2 | 8,835 | Authenticating Top-k Queries in Location-based Services with Confidentiality | 2014 | VLDB |
| 3 | 6,537 | Range Search over Encrypted Multi-Attribute Data | 2023 | VLDB |
| 4 | 4,625 | Practical Private Range Search Revisited | 2016 | SIGMOD |
| 5 | 1,819 | Efficient Retrieval of the Top-k Most Relevant Spatial Web Objects | 2009 | VLDB |
| 6 | 6,832 | A Scalable Index for Top-k Subtree Similarity Queries | 2019 | SIGMOD |
| 7 | 9,068 | Efficient Secure and Verifiable Location-Based Skyline Queries over Encrypted Data | 2022 | VLDB |
| 8 | 6,797 | Efficient Searchable Encryption Through Compression | 2018 | VLDB |
| 9 | 11,996 | Fast Searchable Encryption With Tunable Locality | 2017 | SIGMOD |
| 10 | 10,610 | A Workload-Aware Encrypted Index for Efficient Privacy-Preserving Range Queries | 2026 | VLDB |