GraphOS: Towards Oblivious Graph Processing
Summary: GraphOS enables oblivious outsourced graph processing with leakage limited to graph size, query type, and response size, using trusted hardware and doubly-oblivious storage. Omix++ and fixed-trace BFS/DFS, MST, and SSSP yield up to 100× speedups over oblivious relational execution. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Javad Ghareh Chamani (Hong Kong University of Science and Technology)
- 2. Ioannis Demertzis (University of California Santa Cruz)
- 3. Dimitrios Papadopoulos (Hong Kong University of Science and Technology)
- 4. Charalampos Papamanthou (Yale University)
- 5. Rasool Jalili (Sharif University of Technology)
BibTeX Citation
@article{chamani_vldb23,
title = {{GraphOS: Towards Oblivious Graph Processing}},
author = {Chamani, Javad Ghareh and Demertzis, Ioannis and Papadopoulos, Dimitrios and Papamanthou, Charalampos and Jalili, Rasool},
journal = {PVLDB},
series = {{VLDB} '23},
volume = {16},
number = {13},
pages = {4324--4338},
doi = {10.14778/3625054.3625067},
url = {https://doi.org/10.14778/3625054.3625067},
year = {2023}
}
Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,896 | Aster: Enhancing LSM-structures for Scalable Graph Database | 2025 | SIGMOD | 5.3495662e-05 |
| 10,570 | Enabling Index-free Adjacency in Oblivious Graph Processing with Delayed Duplications | 2026 | VLDB | 5.093636e-05 |
| 10,921 | Sectric: Towards Accurate, Privacy-preserving and Efficient Triangle Counting | 2025 | VLDB | 5.093636e-05 |
| 10,936 | GORAM: Graph-oriented ORAM for Efficient Ego-centric Queries on Federated Graphs | 2025 | VLDB | 5.093636e-05 |
| 11,092 | Towards Practical Oblivious Map | 2025 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 13 of 13 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
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 8,318 | Optimizing Declarative Graph Queries at Large Scale | 2019 | SIGMOD |
| 2 | 3,357 | Columnar Storage and List-based Processing for Graph Database Management Systems | 2021 | VLDB |
| 3 | 294 | Graphs-at-a-time: Query Language and Access Methods for Graph Databases | 2008 | SIGMOD |
| 4 | 2,854 | Extracting and Analyzing Hidden Graphs from Relational Databases | 2017 | SIGMOD |
| 5 | 11,745 | Parallel Traversal of Graphs Stored in RDBMSs | 2020 | CIDR |
| 6 | 5,384 | Privacy Preserving Subgraph Matching on Large Graphs in Cloud | 2016 | SIGMOD |
| 7 | 8,586 | A Framework for Privacy Preserving Localized Graph Pattern Query Processing | 2023 | SIGMOD |
| 8 | 2,045 | Efficient Oblivious Database Joins | 2020 | VLDB |
| 9 | 11,092 | Towards Practical Oblivious Map | 2025 | VLDB |
| 10 | 10,570 | Enabling Index-free Adjacency in Oblivious Graph Processing with Delayed Duplications | 2026 | VLDB |