Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 348

The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.

K-isomorphism: privacy preserving network publication against structural attacks

Cheng, James, Fu, Ada Wai-chee, Liu, Jia·2010·Proceedings of the 2010 ACM SIGMOD International Conference on Management of data

Abstract

Serious concerns on privacy protection in social networks have been raised in recent years; however, research in this area is still in its infancy. The problem is challenging due to the diversity and complexity of graph data, on which an adversary can use many types of background knowledge to conduct an attack. One popular type of attacks as studied by pioneer work [2] is the use of embedding subgraphs. We follow this line of work and identify two realistic targets of attacks, namely, NodeInfo and LinkInfo. Our investigations show that k-isomorphism, or anonymization by forming k pairwise isomorphic subgraphs, is both sufficient and necessary for the protection. The problem is shown to be NP-hard. We devise a number of techniques to enhance the anonymization efficiency while retaining the data utility. A compound vertex ID mechanism is also introduced for privacy preservation over multiple data releases. The satisfactory performance on a number of real datasets, including HEP-Th, EUemail and LiveJournal, illustrates that the high symmetry of social networks is very helpful in mitigating the difficulty of the problem.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/1807167.1807218

Cites

30 of 30 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 30 references

Cited by

See all 348

Metadata

Authors
Cheng, J., Fu, A. W.-C., & Liu, J.
Venue
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Publisher
ACM
Published
2010-06-06
Pages
459-470
ISSN
0730-8078 (ISSN-L)
OpenAlex
W2032186932
Cited by
348
References
30
FWCI
20.01
Type
conference paper
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: K-isomorphism: privacy preserving network publication against structural attacks. https://app.cochat.ai/papers/10.1145/1807167.1807218
The paper
Cheng, J., Fu, A. W.-C., & Liu, J. (2010). K-isomorphism: privacy preserving network publication against structural attacks. Proceedings of the 2010 ACM SIGMOD International Conference on Management of data. https://doi.org/10.1145/1807167.1807218

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.