GORAM: Graph-oriented ORAM for Efficient Ego-centric Queries on Federated Graphs
Summary: GORAM combines MPC with partitioned ORAM indexing to privately execute ego-centric queries over mutually distrustful, federated graph owners. It limits each query to one partition, achieving practical performance on billion-edge graphs—the first such MPC-scale demonstration. (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. Xiaoyu Fan (Ant Financial; Tsinghua University)
- 2. Xiaowei Zhu (Ant Financial)
- 3. Kun Chen (Ant Financial)
- 4. Yunyi Chen (Ant Financial; Tsinghua University)
- 5. Jiping Yu (Ant Financial; Tsinghua University)
- 6. Huanchen Zhang (Shanghai Qi Zhi Institute; Tsinghua University)
- 7. Wei Xu (Shanghai Qi Zhi Institute; Tsinghua University)
BibTeX Citation
@article{fan_vldb25,
title = {{GORAM: Graph-oriented ORAM for Efficient Ego-centric Queries on Federated Graphs}},
author = {Fan, Xiaoyu and Zhu, Xiaowei and Chen, Kun and Chen, Yunyi and Yu, Jiping and Zhang, Huanchen and Xu, Wei},
journal = {PVLDB},
series = {{VLDB} '25},
volume = {18},
number = {10},
pages = {3601--3614},
doi = {10.14778/3748191.3748218},
url = {https://doi.org/10.14778/3748191.3748218},
year = {2025}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 9 of 9 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 232 | LinkBench: a Database Benchmark Based on the Facebook Social Graph | 2013 | SIGMOD | 0.00023830978 |
| 596 | Private Analysis of Graph Structure | 2011 | VLDB | 0.00015926024 |
| 927 | Real-time Constrained Cycle Detection in Large Dynamic Graphs | 2018 | VLDB | 0.00013161079 |
| 1,984 | Shrinkwrap: Efficient SQL Query Processing in Differentially Private Data Federations | 2019 | VLDB | 9.3540912e-05 |
| 2,417 | Towards Practical Oblivious Join | 2022 | SIGMOD | 8.6061949e-05 |
| 2,433 | Vertexica: Your Relational Friend for Graph Analytics! | 2014 | VLDB | 8.5869161e-05 |
| 5,299 | GraphOS: Towards Oblivious Graph Processing | 2023 | VLDB | 6.2767341e-05 |
| 5,384 | Privacy Preserving Subgraph Matching on Large Graphs in Cloud | 2016 | SIGMOD | 6.2370509e-05 |
| 8,586 | A Framework for Privacy Preserving Localized Graph Pattern Query Processing | 2023 | SIGMOD | 5.4073203e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 2,045 | Efficient Oblivious Database Joins | 2020 | VLDB |
| 2 | 1,803 | Towards Effective Partition Management for Large Graphs | 2012 | SIGMOD |
| 3 | 5,612 | Cache-Efficient Fork-Processing Patterns on Large Graphs | 2021 | SIGMOD |
| 4 | 1,246 | Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows | 2018 | VLDB |
| 5 | 5,581 | Subgraph Matching over Graph Federation | 2022 | VLDB |
| 6 | 5,384 | Privacy Preserving Subgraph Matching on Large Graphs in Cloud | 2016 | SIGMOD |
| 7 | 4,519 | G-Tran: A High Performance Distributed Graph Database with a Decentralized Architecture | 2022 | VLDB |
| 8 | 11,092 | Towards Practical Oblivious Map | 2025 | VLDB |
| 9 | 6,775 | EAGr: Supporting Continuous Ego-centric Aggregate Queries over Large Dynamic Graphs | 2014 | SIGMOD |
| 10 | 5,444 | Oblivious RAM: A Dissection and Experimental Evaluation | 2016 | VLDB |