Scalable Privacy-Preserving Shortest Path Distance Computation via 2-Hop Labeling in MPC
Summary: PrivHop: MPC-based shortest-path distance with 2-hop labeling, turning global queries into boundary-graph queries via an offline index, then using privacy-aware dynamic pruning to cut iterations. Key result: privacy-preserving SSSP/SD computation scales to million-node graphs with up to 10^6× runtime/communication gains. (summarized by gpt-5-mini on Apr 11 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Huizhong Wang
- 2. Yuanyuan Zeng
- 3. Kun Chen
- 4. Wei Dong
- 5. Chenhao Ma
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 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 |
|---|---|---|---|---|
| 260 | Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling | 2013 | SIGMOD | 0.00030040036 |
| 1,394 | Real-time Constrained Cycle Detection in Large Dynamic Graphs | 2018 | VLDB | 0.0001221552 |
| 1,838 | IS-LABEL: an Independent-Set based Labeling Scheme for Point-to-Point Distance Querying | 2013 | VLDB | 0.00010349881 |
| 2,639 | Scaling Distance Labeling on Small-World Networks | 2019 | SIGMOD | 8.3975113e-05 |
| 10,584 | Efficient Maintenance of 2-Hop Labeling Index on Dynamic Small-World Graphs | 2025 | VLDB | 4.1945683e-05 |
| 11,038 | Distributed Shortest Distance Labeling on Large-Scale Graphs | 2024 | VLDB | 4.1945683e-05 |
Previous
Page 1 / 1
Next