The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography
Abstract
In a social network, nodes correspond topeople or other social entities, and edges correspond to social links between them. In an effort to preserve privacy, the practice of anonymization replaces names with meaningless unique identifiers. We describe a family of attacks such that even from a single anonymized copy of a social network, it is possible for an adversary to learn whether edges exist or not between specific targeted pairs of nodes.
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.
Integrity signals
Registry
Cites
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.
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
k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
SWEENEY, L. (2002) · International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems · doi:10.1142/s0218488502001648 · Cited by 8,571
Calibrating Noise to Sensitivity in Private Data Analysis
Dwork, C., McSherry, F., Nissim, K., & Smith, A. (2006) · Lecture Notes in Computer Science · doi:10.1007/11681878_14 · Cited by 7,272
Self-citationBollobás, B. (2001) · doi:10.1017/cbo9780511814068 · Cited by 2,639 · cited 2×
“It is known that for a random graph H such as we have constructed, the following properties hold with probability going to 1 exponentially quickly in k [9]: first, that γ(H) = δ(H); second, that δ(H) ≥ (1/2− ε)k for any constant ε > 0; and third, that H has no non-trivial automorphisms.”
Cited by
Kivela, M., Arenas, A., Barthelemy, M., Gleeson, J. P., Moreno, Y., & Porter, M. A. (2014) · Journal of Complex Networks · doi:10.1093/comnet/cnu016 · Cited by 3,235
Bitcoin and beyond: a technical survey on decentralized digital currencies
Tschorsch, F., & Scheuermann, B. (2016) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2535718 · Cited by 1,690
Differentially Private Federated Learning: A Client Level Perspective
Geyer, R. C., Klein, T., & Nabi, M. (2017) · arXiv · doi:10.48550/arxiv.1712.07557 · Cited by 1,052
(2011) · PubMed · Cited by 990
Zerocoin: Anonymous Distributed E-Cash from Bitcoin
Miers, I., Garman, C., Green, M., & Rubin, A. D. (2013) · 2013 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2013.34 · Cited by 983
Metadata
- Authors
- Backstrom, L., Dwork, C., & Kleinberg, J.
- Venue
- Proceedings of the 16th international conference on World Wide Web
- Publisher
- ACM
- Published
- 2007-05-08
- Pages
- 181-190
- OpenAlex
- W2163263459
- Cited by
- 850
- References
- 3
- FWCI
- 33.18
- 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: Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography. https://app.cochat.ai/papers/10.1145/1242572.1242598
- The paper
- Backstrom, L., Dwork, C., & Kleinberg, J. (2007). Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography. Proceedings of the 16th international conference on World Wide Web. https://doi.org/10.1145/1242572.1242598
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.
