Database Paper Browser

Back to papers

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)

Paper ID
4266
Venue
SIGMOD
Year
2010
Pagerank
5.5531181e-05
Overall Rank
5,351 | 62.78%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

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.

Previous Page 1 / 1 Next

Semantically Similar Papers