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
- 2. Lei Zou
- 3. Feifei Li
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,344 | SPG: Structure-Private Graph Database via SqueezePIR | 2023 | VLDB | 4.7508931e-05 |
| 8,488 | A Framework for Privacy Preserving Localized Graph Pattern Query Processing | 2023 | SIGMOD | 4.4951247e-05 |
| 10,697 | GORAM: Graph-oriented ORAM for Efficient Ego-centric Queries on Federated Graphs | 2025 | VLDB | 4.1905499e-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 |
|---|---|---|---|---|
| 648 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB | 0.00018688754 |
| 800 | Towards Identity Anonymization on Graphs | 2008 | SIGMOD | 0.00016463554 |
| 916 | Distance-Join: Pattern Match Query In a Large Graph Database | 2009 | VLDB | 0.00015326675 |
| 1,177 | Recursive Mechanism: Towards Node Differential Privacy and Unrestricted Joins | 2013 | SIGMOD | 0.00013465351 |
| 1,571 | Resisting Structural Re-identification in Anonymized Social Networks | 2008 | VLDB | 0.000113084 |
| 1,630 | An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases | 2013 | VLDB | 0.00011073047 |
| 3,169 | K-Automorphism: A General Framework for Privacy Preserving Network Publication | 2009 | VLDB | 7.4545379e-05 |
| 5,360 | K-Isomorphism: Privacy Preserving Network Publication against Structural Attacks | 2010 | SIGMOD | 5.5477372e-05 |
| 5,494 | Neighborhood-Privacy Protected Shortest Distance Computing in Cloud | 2011 | SIGMOD | 5.4770961e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 800 | Towards Identity Anonymization on Graphs | 2008 | SIGMOD | 0.00016463554 |
| 2,721 | Anonymizing Bipartite Graph Data using Safe Groupings | 2008 | VLDB | 8.2331032e-05 |
| 3,873 | Efficient Subgraph Similarity Search on Large Probabilistic Graph Databases | 2012 | VLDB | 6.673504e-05 |
| 6,086 | Subgraph Matching over Graph Federation | 2022 | VLDB | 5.2157921e-05 |
| 7,344 | SPG: Structure-Private Graph Database via SqueezePIR | 2023 | VLDB | 4.7508931e-05 |
| 10,209 | Scalable Privacy-Preserving Shortest Path Distance Computation via 2-Hop Labeling in MPC | 2026 | SIGMOD | 4.1905499e-05 |
| 5,360 | K-Isomorphism: Privacy Preserving Network Publication against Structural Attacks | 2010 | SIGMOD | 5.5477372e-05 |
| 648 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB | 0.00018688754 |
| 5,494 | Neighborhood-Privacy Protected Shortest Distance Computing in Cloud | 2011 | SIGMOD | 5.4770961e-05 |
| 8,488 | A Framework for Privacy Preserving Localized Graph Pattern Query Processing | 2023 | SIGMOD | 4.4951247e-05 |