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 (Chinese University of Hong Kong)
- 2. Yuanyuan Zeng (Chinese University of Hong Kong)
- 3. Kun Chen (Ant Financial)
- 4. Wei Dong (Nanyang Technological University)
- 5. Chenhao Ma (Chinese University of Hong Kong)
BibTeX Citation
@inproceedings{wang_sigmod26,
title = {{Scalable Privacy-Preserving Shortest Path Distance Computation via 2-Hop Labeling in MPC}},
author = {Wang, Huizhong and Zeng, Yuanyuan and Chen, Kun and Dong, Wei and Ma, Chenhao},
series = {{SIGMOD} '26},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3786695},
url = {https://dl.acm.org/doi/10.1145/3786695},
year = {2026}
}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 |
|---|---|---|---|---|
| 195 | Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling | 2013 | SIGMOD | 0.00025813775 |
| 927 | Real-time Constrained Cycle Detection in Large Dynamic Graphs | 2018 | VLDB | 0.00013161079 |
| 1,622 | IS-LABEL: an Independent-Set based Labeling Scheme for Point-to-Point Distance Querying | 2013 | VLDB | 0.00010201102 |
| 2,152 | Scaling Distance Labeling on Small-World Networks | 2019 | SIGMOD | 9.0778596e-05 |
| 10,845 | Efficient Maintenance of 2-Hop Labeling Index on Dynamic Small-World Graphs | 2025 | VLDB | 5.093636e-05 |
| 11,248 | Distributed Shortest Distance Labeling on Large-Scale Graphs | 2024 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 2,152 | Scaling Distance Labeling on Small-World Networks | 2019 | SIGMOD |
| 2 | 10,845 | Efficient Maintenance of 2-Hop Labeling Index on Dynamic Small-World Graphs | 2025 | VLDB |
| 3 | 9,557 | Common Neighborhood Estimation over Bipartite Graphs under Local Differential Privacy | 2024 | SIGMOD |
| 4 | 9,552 | Practical and Accurate Local Edge Differentially Private Graph Algorithms | 2025 | VLDB |
| 5 | 7,817 | Shortest Path Computation with No Information Leakage | 2012 | VLDB |
| 6 | 5,507 | Neighborhood-Privacy Protected Shortest Distance Computing in Cloud | 2011 | SIGMOD |
| 7 | 3,948 | Shortest Paths and Distances with Differential Privacy | 2016 | PODS |
| 8 | 7,418 | Distributed Hop-Constrained s-t Simple Path Enumeration at Billion Scale | 2022 | VLDB |
| 9 | 11,248 | Distributed Shortest Distance Labeling on Large-Scale Graphs | 2024 | VLDB |
| 10 | 5,384 | Privacy Preserving Subgraph Matching on Large Graphs in Cloud | 2016 | SIGMOD |