Privacy Preserving Subgraph Matching on Large Graphs in Cloud
Summary: Privacy-preserving subgraph matching on cloud by k-automorphism: G->Gk and answer with a small Go-sg, cutting cloud and client overhead. Anonymizes query labels by generalization and uses a cost model to prune label choices; tested on real data. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Zhao Chang (Peking University; University of Utah)
- 2. Lei Zou (Peking University)
- 3. Feifei Li (University of Utah)
BibTeX Citation
@inproceedings{chang_sigmod16,
title = {{Privacy Preserving Subgraph Matching on Large Graphs in Cloud}},
author = {Chang, Zhao and Zou, Lei and Li, Feifei},
series = {{SIGMOD} '16},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/2882903.2882956},
url = {https://dl.acm.org/doi/10.1145/2882903.2882956},
year = {2016}
}Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,371 | SPG: Structure-Private Graph Database via SqueezePIR | 2023 | VLDB | 5.6312975e-05 |
| 8,586 | A Framework for Privacy Preserving Localized Graph Pattern Query Processing | 2023 | SIGMOD | 5.4073203e-05 |
| 10,936 | GORAM: Graph-oriented ORAM for Efficient Ego-centric Queries on Federated Graphs | 2025 | VLDB | 5.093636e-05 |
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 |
|---|---|---|---|---|
| 442 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB | 0.00018398144 |
| 776 | Distance-Join: Pattern Match Query In a Large Graph Database | 2009 | VLDB | 0.00014110016 |
| 836 | Recursive Mechanism: Towards Node Differential Privacy and Unrestricted Joins | 2013 | SIGMOD | 0.00013715654 |
| 985 | Towards Identity Anonymization on Graphs | 2008 | SIGMOD | 0.00012818114 |
| 1,181 | An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases | 2013 | VLDB | 0.0001179597 |
| 1,326 | Resisting Structural Re-identification in Anonymized Social Networks | 2008 | VLDB | 0.00011145219 |
| 2,909 | K-Automorphism: A General Framework for Privacy Preserving Network Publication | 2009 | VLDB | 7.9708764e-05 |
| 5,227 | K-Isomorphism: Privacy Preserving Network Publication against Structural Attacks | 2010 | SIGMOD | 6.3085805e-05 |
| 5,507 | Neighborhood-Privacy Protected Shortest Distance Computing in Cloud | 2011 | SIGMOD | 6.1924452e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 985 | Towards Identity Anonymization on Graphs | 2008 | SIGMOD |
| 2 | 2,430 | Anonymizing Bipartite Graph Data using Safe Groupings | 2008 | VLDB |
| 3 | 3,548 | Efficient Subgraph Similarity Search on Large Probabilistic Graph Databases | 2012 | VLDB |
| 4 | 5,581 | Subgraph Matching over Graph Federation | 2022 | VLDB |
| 5 | 7,371 | SPG: Structure-Private Graph Database via SqueezePIR | 2023 | VLDB |
| 6 | 10,498 | Scalable Privacy-Preserving Shortest Path Distance Computation via 2-Hop Labeling in MPC | 2026 | SIGMOD |
| 7 | 5,227 | K-Isomorphism: Privacy Preserving Network Publication against Structural Attacks | 2010 | SIGMOD |
| 8 | 442 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB |
| 9 | 5,507 | Neighborhood-Privacy Protected Shortest Distance Computing in Cloud | 2011 | SIGMOD |
| 10 | 8,586 | A Framework for Privacy Preserving Localized Graph Pattern Query Processing | 2023 | SIGMOD |