Towards Practical Oblivious Map
Summary: Introduces OMAPs combining hash tables with search trees, plus DAORAM for efficient oblivious hash-table access. Achieves O(log n/log log n + log λ) rounds and O(log²n/log log n + log λ log n) bandwidth, outperforming prior schemes experimentally. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Xinle Cao (Zhejiang University)
- 2. Weiqi Feng (University of Massachusetts Amherst)
- 3. Jian Liu (Zhejiang University)
- 4. Jinjin Zhou (Ant Financial)
- 5. Wenjing Fang (Ant Financial)
- 6. Lei Wang (Ant Financial)
- 7. Quanqing Xu (Ant Financial)
- 8. Chuanhui Yang (Ant Financial)
- 9. Kui Ren (Zhejiang University)
BibTeX Citation
@article{cao_vldb25,
title = {{Towards Practical Oblivious Map}},
author = {Cao, Xinle and Feng, Weiqi and Liu, Jian and Zhou, Jinjin and Fang, Wenjing and Wang, Lei and Xu, Quanqing and Yang, Chuanhui and Ren, Kui},
journal = {PVLDB},
series = {{VLDB} '25},
volume = {18},
number = {3},
pages = {688--701},
doi = {10.14778/3712221.3712235},
url = {https://doi.org/10.14778/3712221.3712235},
year = {2025}
}Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 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 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,045 | Efficient Oblivious Database Joins | 2020 | VLDB | 9.2632279e-05 |
| 2,417 | Towards Practical Oblivious Join | 2022 | SIGMOD | 8.6061949e-05 |
| 2,918 | OceanBase: A 707 Million tpmC Distributed Relational Database System | 2022 | VLDB | 7.9649716e-05 |
| 5,299 | GraphOS: Towards Oblivious Graph Processing | 2023 | VLDB | 6.2767341e-05 |
| 6,537 | Range Search over Encrypted Multi-Attribute Data | 2023 | VLDB | 5.8478276e-05 |
| 9,530 | OceanBase Paetica: A Hybrid Shared-nothing/Shared-everything Database for Supporting Single Machine and Distributed Cluster | 2023 | VLDB | 5.2543048e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 10,221 | Differentially Oblivious Multi-way Join | 2026 | SIGMOD |
| 2 | 7,337 | OBIR-tree: An Efficient Oblivious Index for Spatial Keyword Queries on Secure Enclaves | 2025 | SIGMOD |
| 3 | 5,299 | GraphOS: Towards Oblivious Graph Processing | 2023 | VLDB |
| 4 | 5,128 | A Comparative Evaluation of Order-Revealing Encryption Schemes and Secure Range-Query Protocols | 2019 | VLDB |
| 5 | 7,723 | Frequency-Hiding Order-Preserving Encryption with Small Client Storage | 2021 | VLDB |
| 6 | 6,797 | Efficient Searchable Encryption Through Compression | 2018 | VLDB |
| 7 | 6,793 | What Storage Access Privacy is Achievable with Small Overhead? | 2019 | PODS |
| 8 | 2,045 | Efficient Oblivious Database Joins | 2020 | VLDB |
| 9 | 5,444 | Oblivious RAM: A Dissection and Experimental Evaluation | 2016 | VLDB |
| 10 | 2,417 | Towards Practical Oblivious Join | 2022 | SIGMOD |