K-symmetry model for identity anonymization in social networks

Advances in Database Technology - EDBT 2010 - 13th International Conference on Extending Database Technology, Proceedings

Volumn , Issue , 2010, Pages 111-122

  Wu, Wentao ^a   Xiao, Yanghua ^a   Wang, Wei ^a   He, Zhenying ^a   Wang, Zhihui ^a  

^a FUDAN UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ANONYMIZATION; NUMBER OF SAMPLES; SAMPLING METHOD; SENSITIVE INFORMATIONS; SOCIAL NETWORKS; STATISTICAL PROPERTIES; STRUCTURAL KNOWLEDGE; TOPOLOGICAL INFORMATION;

SAMPLING; SOCIAL NETWORKING (ONLINE); TECHNOLOGY;

DATABASE SYSTEMS;

EID: 77952279599     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1739041.1739058     Document Type: Conference Paper

References (20)

1. R. Albert, H. Jeong, and A.-L. Barabasi. Error and attack tolerance of complex networks. Nature, 406:378, 2000.
2. L. Backtrom, C. Dwork, and J. Kleinberg. Wherefore art thou r3579x? anonymized social networks, hidden patterns, and structural steganography. In WWW'07, 2007.
3. S. Fortin. The graph isomorphism problem. Technical Report TR 96-120, Dept. of Computing Science, University of Alberta, Canada, 1996.
4. M. Hay, G. Miklau, D. Jensen, D.Towsley, and P. Weis. Resisting structural re-identification in anonymized social networks. In VLDB'08, 2008.
5. M. Hay, G. Miklau, D. Jensen, P. Weis, and S. Srivastava. Anonymizing social networks. Technical Report 07-19, UMass Amherst, 2007.
6. M. Klin and G.Tinhofer. Algebraic combinatorics in mathematical chemistry. methods and algorithms. iii. graph invariants and stabilization methods (preliminary version). Technical Report TUM-M9902, Technische Universitat Munchen, 1999.
7. K. Liu and E. Terzi. Towards identity anonymization on graphs. In SIGMOD'08, 2008.
8. B. D. MacArthur, R. J. Sánchez-García, and J. W. Anderson. Symmetry in complex networks. Discrete Applied Mathematics.
9. R. Mathon. A note on the graph isomorphism counting problem. Information Processing Letters, 8:131-132, 1979.
10. P. Samarati. Protecting respondent's privacy in microdata release. IEEE Transactions on Knowledge and Data Engineering, 2001.
11. P. Samarati and L. Sweeney. Protecting privacy when disclosing information: k-anonymity and its enforcement through generalization and suppression. Technical report, SRI International, 1998.
12. L. Singh and J. Zhan. Measuring topological anonymity in social networks. In Intl. Conf. on Granular Computing, 2007.
13. L. Sweeney. k-anonymity: a model for protecting privacy. Journ. of Uncertainty, Fuzziness, and KB Systems, 2002.
14. D. W. Wang, C. J. Liau, and T. S. Hsu. Privacy protection in social network data disclosure based on granular computing. In International Conference on Fuzzy System, 2006.
15. Y. Xiao, B. D. MacArthur, H. Wang, M. Xiong, and W. Wang. Network quotients: Structural skeletons of complex systems. Physical Review E, 78:046102, 2008.
16. Y. Xiao, W. Wu, J. Pei, and Z. H. W. Wang. Efficiently indexing shortest path by exploiting symmetry in graphs. In EDBT'09, 2009.
17. Y. Xiao, M. Xiong, W. Wang, and H. Wang. Emergence of symmetry in complex networks. Physical Review E, 77:066108, 2008.
18. X. Ying and X. Wu. Randomizing social networks: a spectrum preserving approach. In SIAM Conf. on Data Mining, 2007.
19. B. Zhou and J. Pei. Preserving privacy in social networks against neighborhood attacks. In ICDE'08, 2008.
20. L. Zou, L. Chen, and M. T. Özsu. K-automorphism: A general framework for privacy preserving network publication. PVLDB, 2(1):946-957, 2009.