The DOI matches its Crossref record; 28 of the 28 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.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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. (1985) · Cited by 6,196
Dwork, C. (2006) · Lecture Notes in Computer Science · doi:10.1007/11787006_1 · Cited by 5,291
Self-citationSpencer, J. (1991) · Medical Entomology and Zoology · Cited by 4,310
Privacy-preserving data mining
Agrawal, R., & Srikant, R. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335438 · Cited by 2,961
Bollobá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.”
Group formation in large social networks: membership, growth, and evolution
Backstrom, L., Huttenlocher, D., Kleinberg, J., & Lan, X. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150412 · Cited by 1,805
Self-citationEmpirical Analysis of an Evolving Social Network
Kossinets, G., & Watts, D. J. (2006) · Science · doi:10.1126/science.1116869 · Cited by 1,723
Privacy-preserving data mining
Agrawal, R., & Srikant, R. (2000) · Proceedings of the 2000 ACM SIGMOD international conference on Management of data · doi:10.1145/342009.335438 · Cited by 1,719
Structure and evolution of online social networks
Kumar, R., Novak, J., & Tomkins, A. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150476 · Cited by 1,084
On the design and quantification of privacy preserving data mining algorithms
Agrawal, D., & Aggarwal, C. C. (2001) · Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/375551.375602 · Cited by 1,006
Revealing information while preserving privacy
Dinur, I., & Nissim, K. (2003) · Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/773153.773173 · Cited by 980
Geographic routing in social networks
Liben-Nowell, D., Novak, J., Kumar, R., Raghavan, P., & Tomkins, A. (2005) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0503018102 · Cited by 838
Limiting privacy breaches in privacy preserving data mining
Evfimievski, A., Gehrke, J., & Srikant, R. (2003) · Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/773153.773174 · Cited by 815
Practical privacy: the SuLQ framework
Blum, A., Dwork, C., McSherry, F., & Nissim, K. (2005) · Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/1065167.1065184 · Cited by 797
Self-citationSome remarks on the theory of graphs
Erdös, P. (1947) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1947-08785-1 · Cited by 645
How to search a social network
Adamic, L., & Adar, E. (2005) · Social Networks · doi:10.1016/j.socnet.2005.01.007 · Cited by 606
1 Rhythms of social interaction: messaging within a massive online networkPreprint
Golder, S. A., Wilkinson, D. M., & Huberman, B. A. (2006) · Cited by 539
Weaving Technology and Policy Together to Maintain Confidentiality
Sweeney, L. (1997) · Journal of Law, Medicine & Ethics · doi:10.1111/j.1748-720x.1997.tb01885.x · Cited by 375
Structure and evolution of blogspace
Kumar, R., Novak, J., Raghavan, P., & Tomkins, A. (2004) · Communications of the ACM · doi:10.1145/1035134.1035162 · Cited by 371
Graph Clustering and Minimum Cut Trees
Flake, G. W., Tarjan, R. E., & Tsioutsiouliklis, K. (2004) · Internet Mathematics · doi:10.1080/15427951.2004.10129093 · Cited by 333
A social network caught in the Web
Adamic, L., Buyukkokten, O., & Adar, E. (2003) · First Monday · doi:10.5210/fm.v8i6.1057 · Cited by 265
How To Break Anonymity of the Netflix Prize Dataset
Narayanan, A., & Shmatikov, V. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0610105 · Cited by 263
Rhythms of Social Interaction: Messaging Within a Massive Online Network
Golder, S. A., Wilkinson, D. M., & Huberman, B. A. (2007) · Communities and Technologies 2007 · doi:10.1007/978-1-84628-905-7_3 · Cited by 237
The price of privacy and the limits of LP decoding
Dwork, C., McSherry, F., & Talwar, K. (2007) · Proceedings of the thirty-ninth annual ACM symposium on Theory of computing · doi:10.1145/1250790.1250804 · Cited by 205
Self-citationNovak, J., Raghavan, P., & Tomkins, A. (2004) · International World Wide Web Conference (WWW) · doi:10.1145/988672.988678 · Cited by 104
Privacy via pseudorandom sketches
Mishra, N., & Sandler, M. (2006) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/1142351.1142373 · Cited by 75
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
De-anonymizing Social Networks
Narayanan, A., & Shmatikov, V. (2009) · 2009 30th IEEE Symposium on Security and Privacy · doi:10.1109/sp.2009.22 · Cited by 1,301
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
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
- 28
- 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
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.