K-Isomorphism: Privacy Preserving Network Publication against Structural Attacks
Summary: Proposes k-isomorphism as the necessary-and-sufficient privacy model against structural attacks on graphs (NodeInfo/LinkInfo). NP-hard; develops efficiency techniques and a compound vertex ID for multi-release privacy; validated on HEP-TH, EUemail, LiveJournal, showing symmetry aids anonymization while preserving utility. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. James Cheng (Nanyang Technological University)
- 2. Ada Wai-Chee Fu (Chinese University of Hong Kong)
- 3. Jia Liu (Chinese University of Hong Kong)
BibTeX Citation
@inproceedings{cheng_sigmod10,
title = {{K-Isomorphism: Privacy Preserving Network Publication against Structural Attacks}},
author = {Cheng, James and Fu, Ada Wai-Chee and Liu, Jia},
series = {{SIGMOD} '10},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/1807167.1807218},
url = {https://dl.acm.org/doi/10.1145/1807167.1807218},
year = {2010}
}
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,384 | Privacy Preserving Subgraph Matching on Large Graphs in Cloud | 2016 | SIGMOD | 6.2370509e-05 |
| 5,507 | Neighborhood-Privacy Protected Shortest Distance Computing in Cloud | 2011 | SIGMOD | 6.1924452e-05 |
| 6,304 | Privacy-Aware Data Management in Information Networks | 2011 | SIGMOD | 5.9210809e-05 |
| 7,338 | DPGraph: A Benchmark Platform for Differentially Private Graph Analysis | 2021 | SIGMOD | 5.6393827e-05 |
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 |
|---|---|---|---|---|
| 572 | Anatomy: Simple and Effective Privacy Preservation | 2006 | VLDB | 0.00016316092 |
| 674 | Finding Maximal Cliques in Massive Networks by H*-graph | 2010 | SIGMOD | 0.00015081844 |
| 985 | Towards Identity Anonymization on Graphs | 2008 | SIGMOD | 0.00012818114 |
| 1,326 | Resisting Structural Re-identification in Anonymized Social Networks | 2008 | VLDB | 0.00011145219 |
| 2,430 | Anonymizing Bipartite Graph Data using Safe Groupings | 2008 | VLDB | 8.5885381e-05 |
| 2,909 | K-Automorphism: A General Framework for Privacy Preserving Network Publication | 2009 | VLDB | 7.9708764e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 2,977 | Injecting Uncertainty in Graphs for Identity Obfuscation | 2012 | VLDB |
| 2 | 6,288 | Publishing Attributed Social Graphs with Formal Privacy Guarantees | 2016 | SIGMOD |
| 3 | 8,545 | Personalized Privacy Protection in Social Networks | 2011 | VLDB |
| 4 | 5,384 | Privacy Preserving Subgraph Matching on Large Graphs in Cloud | 2016 | SIGMOD |
| 5 | 596 | Private Analysis of Graph Structure | 2011 | VLDB |
| 6 | 4,125 | Class-based graph anonymization for social network data | 2009 | VLDB |
| 7 | 2,430 | Anonymizing Bipartite Graph Data using Safe Groupings | 2008 | VLDB |
| 8 | 1,326 | Resisting Structural Re-identification in Anonymized Social Networks | 2008 | VLDB |
| 9 | 985 | Towards Identity Anonymization on Graphs | 2008 | SIGMOD |
| 10 | 2,909 | K-Automorphism: A General Framework for Privacy Preserving Network Publication | 2009 | VLDB |