The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
k-automorphism: a general framework for privacy preserving network publication
Abstract
The growing popularity of social networks has generated interesting data management and data mining problems. An important concern in the release of these data for study is their privacy, since social networks usually contain personal information. Simply removing all identifiable personal information (such as names and social security number) before releasing the data is insufficient. It is easy for an attacker to identify the target by performing different structural queries. In this paper we propose k-automorphism to protect against multiple structural attacks and develop an algorithm (called KM) that ensures k-automorphism. We also discuss an extension of KM to handle "dynamic" releases of the data. Extensive experiments show that the algorithm performs well in terms of protection it provides.
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 · cited 2×
“Privacy-preserving data publication has received increasing interest in database community [7, 13, 15, 16, 18, 19, 23, 9, 14, 6, 4, 3].”
BackgroundMethodL-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
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
Data Privacy through Optimal k-Anonymization
Bayardo, R. J., & Agrawal, R. (2005) · 21st International Conference on Data Engineering (ICDE'05) · doi:10.1109/icde.2005.42 · Cited by 1,131
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
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
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
Preserving Privacy in Social Networks Against Neighborhood Attacks
Zhou, B., & Pei, J. (2008) · 2008 IEEE 24th International Conference on Data Engineering · doi:10.1109/icde.2008.4497459 · Cited by 719
Anatomy: simple and effective privacy preservation
Xiao, X., & Tao, Y. (2006) · Very Large Data Bases · doi:10.5555/1182635.1164141 · Cited by 642
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
M-invariance: towards privacy preserving re-publication of dynamic datasets
Xiao, X., & Tao, Y. (2007) · Proceedings of the 2007 ACM SIGMOD international conference on Management of data · doi:10.1145/1247480.1247556 · Cited by 466
Finding Frequent Patterns in a Large Sparse Graph*
Kuramochi, M., & Karypis, G. (2005) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-005-0003-9 · Cited by 371
(2010) · Chapman & Hall/CRC Data Mining and Knowledge Discovery Series · doi:10.1201/9781420091502-c15 · Cited by 328
Randomizing Social Networks: a Spectrum Preserving Approach
Ying, X., & Wu, X. (2008) · Proceedings of the 2008 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972788.67 · Cited by 311
Anonymizing bipartite graph data using safe groupings
Cormode, G., Srivastava, D., Yu, T., & Zhang, Q. (2008) · Proceedings of the VLDB Endowment · doi:10.14778/1453856.1453947 · Cited by 222
On the Anonymization of Sparse High-Dimensional Data
Ghinita, G., Tao, Y., & Kalnis, P. (2008) · 2008 IEEE 24th International Conference on Data Engineering · doi:10.1109/icde.2008.4497480 · Cited by 188
Resisting structural re-identification in anonymized social networks
Hay, M., Miklau, G., Jensen, D. D., Towsley, D., & Li, C. (2010) · The VLDB Journal · doi:10.1007/s00778-010-0210-x · Cited by 153
Topics in graph automorphisms and reconstruction
Lauri, J., & Scapellato, R. (2004) · Choice Reviews Online · doi:10.5860/choice.41-2860 · Cited by 110
Privacy preserving serial data publishing by role composition
Bu, Y., Fu, A. W.-C., Wong, R. C.-W., Chen, L., & Li, J. (2008) · Proceedings of the VLDB Endowment · doi:10.14778/1453856.1453948 · Cited by 82
Self-citationEmergence of symmetry in complex networks
Xiao, Y., Xiong, M., Wang, W., & Wang, H. (2008) · Physical Review E · doi:10.1103/physreve.77.066108 · Cited by 58
Private social network analysis: how to assemble pieces of a graph privately
Frikken, K. B., & Golle, P. (2006) · ACM Workshop on Privacy in the Electronic Society (WPES) · doi:10.1145/1179601.1179619 · Cited by 55
Cited by
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
Accurate Estimation of the Degree Distribution of Private Networks
Hay, M., Li, C., Miklau, G., & Jensen, D. (2009) · 2009 Ninth IEEE International Conference on Data Mining · doi:10.1109/icdm.2009.11 · Cited by 387
K-isomorphism: privacy preserving network publication against structural attacks
Cheng, J., Fu, A. W.-C., & Liu, J. (2010) · Proceedings of the 2010 ACM SIGMOD International Conference on Management of data · doi:10.1145/1807167.1807218 · Cited by 348
A Review of Anonymization for Healthcare Data
Olatunji, I. E., Rauch, J., Katzensteiner, M., & Khosla, M. (2024) · Big Data · doi:10.1089/big.2021.0169 · Cited by 101
Metadata
- Authors
- Zou, L., Chen, L., & Özsu, M. T.
- Venue
- Proceedings of the VLDB Endowment
- Published
- 2009-08
- Volume
- 2
- Issue
- 1
- Pages
- 946-957
- ISSN
- 2150-8097 (ISSN-L)
- OpenAlex
- W2128248866
- Cited by
- 409
- References
- 22
- FWCI
- 30.00
- Type
- journal article
- 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.