The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Preserving Privacy in Social Networks Against Neighborhood Attacks
Abstract
Recently, as more and more social network data has been published in one way or another, preserving privacy in publishing social network data becomes an important concern. With some local knowledge about individuals in a social network, an adversary may attack the privacy of some victims easily. Unfortunately, most of the previous studies on privacy preservation can deal with relational data only, and cannot be applied to social network data. In this paper, we take an initiative towards preserving privacy in social network data. We identify an essential type of privacy attacks: neighborhood attacks. If an adversary has some knowledge about the neighbors of a target victim and the relationship among the neighbors, the victim may be re-identified from a social network even if the victim's identity is preserved using the conventional anonymization techniques. We show that the problem is challenging, and present a practical solution to battle neighborhood attacks. The empirical study indicates that anonymized social networks generated by our method can still be used to answer aggregate network queries with high accuracy.
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
(1979) · Cited by 43,841
Adhi Harmoko, S., M.Komp, Jacquard, J. M., Zuse, K., & Eniac (2005) · Cited by 18,035
Social Network Analysis: Methods and Applications
Wasserman, S., & Faust, K. (1994) · doi:10.1017/cbo9780511815478 · Cited by 17,557
Rayward-Smith, V. J. (1991) · Journal of the Operational Research Society · doi:10.1057/jors.1991.155 · Cited by 16,821
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
(2017) · The SAGE Encyclopedia of Communication Research Methods · doi:10.4135/9781483381411.n575 · Cited by 6,008
On power-law relationships of the Internet topology
Faloutsos, M., Faloutsos, P., & Faloutsos, C. (1999) · Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/316188.316229 · Cited by 4,196
L -diversity: Privacy beyond k -anonymity
Machanavajjhala, A., Kifer, D., Gehrke, J., & Venkitasubramaniam, M. (2007) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1217299.1217302 · Cited by 3,617
On power-law relationships of the Internet topology
Faloutsos, M., Faloutsos, P., & Faloutsos, C. (1999) · ACM SIGCOMM Computer Communication Review · doi:10.1145/316194.316229 · Cited by 2,613
L-diversity: privacy beyond k-anonymity
Machanavajjhala, A., Gehrke, J., Kifer, D., & Venkitasubramaniam, M. (2006) · 22nd International Conference on Data Engineering (ICDE'06) · doi:10.1109/icde.2006.1 · Cited by 2,362
Protecting respondents identities in microdata release
Samarati, P. (2001) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.971193 · Cited by 2,324
gSpan: graph-based substructure pattern mining
Yan, X., & Han, J. (2003) · 2002 IEEE International Conference on Data Mining, 2002. Proceedings. · doi:10.1109/icdm.2002.1184038 · Cited by 2,013
Introduction to Algorithms, Second Edition
Rivest, R. L., Leiserson, C. E., Cormen, T. H., & Stein, C. (2001) · Cited by 1,984
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
Empirical Analysis of an Evolving Social Network
Kossinets, G., & Watts, D. J. (2006) · Science · doi:10.1126/science.1116869 · Cited by 1,723
R-MAT: A Recursive Model for Graph Mining
Chakrabarti, D., Zhan, Y., & Faloutsos, C. (2004) · Proceedings of the 2004 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972740.43 · Cited by 1,255
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
Getoor, L., & Diehl, C. P. (2005) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1117454.1117456 · Cited by 973
Backstrom, L., Dwork, C., & Kleinberg, J. (2007) · Proceedings of the 16th international conference on World Wide Web · doi:10.1145/1242572.1242598 · Cited by 850
Generalizing data to provide anonymity when disclosing information (abstract)
Samarati, P., & Sweeney, L. (1998) · Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems · doi:10.1145/275487.275508 · Cited by 779
Personalized privacy preservation
Xiao, X., & Tao, Y. (2006) · Proceedings of the 2006 ACM SIGMOD international conference on Management of data · doi:10.1145/1142473.1142500 · Cited by 670
Graph indexing: a frequent structure-based approach
Yan, X., Yu, P. S., & Han, J. (2004) · Proceedings of the 2004 ACM SIGMOD international conference on Management of data · doi:10.1145/1007568.1007607 · Cited by 637
How to search a social network
Adamic, L., & Adar, E. (2005) · Social Networks · doi:10.1016/j.socnet.2005.01.007 · Cited by 606
Utility-based anonymization using local recoding
Xu, J., Wang, W., Pei, J., Wang, X., Shi, B., & Fu, A. W.-C. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150504 · Cited by 424
Self-citationPreserving the Privacy of Sensitive Relationships in Graph Data
Zheleva, E., & Getoor, L. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78478-4_9 · Cited by 403
(2010) · Chapman & Hall/CRC Data Mining and Knowledge Discovery Series · doi:10.1201/9781420091502-c15 · Cited by 328
On the Complexity of Approximating k-Dimensional Matching
Hazan, E., Safra, M., & Schwartz, O. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-45198-3_8 · Cited by 55
Cited by
Hogan, A., Blomqvist, E., Cochez, M., D’amato, C., Melo, G. D., Gutierrez, C., Kirrane, S., Gayo, J. E. L., Navigli, R., Neumaier, S., et al. (2022) · ACM Computing Surveys · doi:10.1145/3447772 · Cited by 1,904
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
Towards identity anonymization on graphs
Liu, K., & Terzi, E. (2008) · Proceedings of the 2008 ACM SIGMOD international conference on Management of data · doi:10.1145/1376616.1376629 · Cited by 773
Resisting structural re-identification in anonymized social networks
Hay, M., Miklau, G., Jensen, D., Towsley, D., & Weis, P. (2008) · Proceedings of the VLDB Endowment · doi:10.14778/1453856.1453873 · Cited by 549
Boosting the accuracy of differentially private histograms through consistency
Hay, M., Rastogi, V., Miklau, G., & Suciu, D. (2010) · Proceedings of the VLDB Endowment · doi:10.14778/1920841.1920970 · Cited by 528
Metadata
- Authors
- Zhou, B., & Pei, J.
- Venue
- 2008 IEEE 24th International Conference on Data Engineering
- Publisher
- IEEE
- Published
- 2008-04
- Pages
- 506-515
- ISSN
- 1084-4627 (ISSN-L)
- OpenAlex
- W2096296626
- Cited by
- 719
- References
- 27
- FWCI
- 37.96
- 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.