Towards Practical Oblivious Map
Summary: Practical OMAP constructions cutting interaction rounds to O(log n / log log n)+O(log λ) and communication to O(log^2 n / log log n)+O(log λ·log n) per access, improving on OMIX++'s O(log n) rounds and O(log^2 n) bandwidth. Key ideas: a novel hash-table+search-tree OMAP framework and a new tree-based ORAM (DAORAM) that enables efficient oblivious hash-table accesses; prototype shows substantial empirical speedups. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Xinle Cao
- 2. Weiqi Feng
- 3. Jian Liu
- 4. Jinjin Zhou
- 5. Wenjing Fang
- 6. Lei Wang
- 7. Quanqing Xu
- 8. Chuanhui Yang
- 9. Kui Ren
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 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,549 | Efficient Oblivious Database Joins | 2020 | VLDB | 8.5572389e-05 |
| 3,026 | Towards Practical Oblivious Join | 2022 | SIGMOD | 7.691304e-05 |
| 3,641 | OceanBase: A 707 Million tpmC Distributed Relational Database System | 2022 | VLDB | 6.8877808e-05 |
| 5,511 | GraphOS: Towards Oblivious Graph Processing | 2023 | VLDB | 5.4701773e-05 |
| 6,395 | Range Search over Encrypted Multi-Attribute Data | 2023 | VLDB | 5.0766624e-05 |
| 9,957 | OceanBase Paetica: A Hybrid Shared-nothing/Shared-everything Database for Supporting Single Machine and Distributed Cluster | 2023 | VLDB | 4.2323889e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,324 | A Workload-Aware Encrypted Index for Efficient Privacy-Preserving Range Queries | 2026 | VLDB | 4.1905499e-05 |
| 9,235 | OBIR-tree: An Efficient Oblivious Index for Spatial Keyword Queries on Secure Enclaves | 2025 | SIGMOD | 4.3648789e-05 |
| 5,511 | GraphOS: Towards Oblivious Graph Processing | 2023 | VLDB | 5.4701773e-05 |
| 5,243 | A Comparative Evaluation of Order-Revealing Encryption Schemes and Secure Range-Query Protocols | 2019 | VLDB | 5.6043145e-05 |
| 7,720 | Frequency-Hiding Order-Preserving Encryption with Small Client Storage | 2021 | VLDB | 4.6637286e-05 |
| 8,457 | Efficient Searchable Encryption Through Compression | 2018 | VLDB | 4.5018004e-05 |
| 5,819 | What Storage Access Privacy is Achievable with Small Overhead? | 2019 | PODS | 5.3146488e-05 |
| 2,549 | Efficient Oblivious Database Joins | 2020 | VLDB | 8.5572389e-05 |
| 5,425 | Oblivious RAM: A Dissection and Experimental Evaluation | 2016 | VLDB | 5.5131616e-05 |
| 3,026 | Towards Practical Oblivious Join | 2022 | SIGMOD | 7.691304e-05 |