ABSTRACT
Due to the rich information in graph data, the technique for privacy protection in published social networks is still in its infancy, as compared to the protection in relational databases. In this paper we identify a new type of attack called a friendship attack. In a friendship attack, an adversary utilizes the degrees of two vertices connected by an edge to re-identify related victims in a published social network data set. To protect against such attacks, we introduce the concept of k2-degree anonymity, which limits the probability of a vertex being re-identified to 1/k. For the k2-degree anonymization problem, we propose an Integer Programming formulation to find optimal solutions in small-scale networks. We also present an efficient heuristic approach for anonymizing large-scale social networks against friendship attacks. The experimental results demonstrate that the proposed approaches can preserve much of the characteristics of social networks.
- L. Backstrom, C. Dwork, and J. M. Kleinberg. Wherefore art thou r3579x?: Anonymized social networks, hidden patterns, and structural steganography. In Proc. of WWW, 2007. Google ScholarDigital Library
- D. Chakrabarti, Y. Zhan, and C. Faloutsos. R-mat: A recursive model for graph mining. In Proc. of SDM, 2004.Google ScholarCross Ref
- J. Cheng, A. W. Fu, and J. Liu. K-isomorphism: privacy preserving network publication against structural attacks. In Proc. of SIGMOD, 2010. Google ScholarDigital Library
- B. C. M. Fung, K. Wang, R. Chen, and P. S. Yu. Privacy-preserving data publishing: A survey on recent evelopments. ACM Computing Surveys, in press. Google ScholarDigital Library
- M. Hay, G. Miklau, D. Jensen, D. F. Towsley, and P. Weis. Resisting structural re-identification in anonymized social networks. In Proc. of VLDB, 2008. Google ScholarDigital Library
- X. He, J. Vaidya, B. Shafiq, N. Adam, and V. Atluri. Preserving privacy in social networks: A structure-aware approach. In Proc. of WI-IAT, 2009. Google ScholarDigital Library
- IBM. (ILOG CPLEX 12.2, 2010) http://www-01.ibm.com/software/integration/optimization/cplex-optimizer/.Google Scholar
- K. Liu, K. Das, T. Grandison, and H. Kargupta. Privacy-preserving data analysis on graphs and social networks. In H. Kargupta, J. Han, P. Yu, R. Motwani, and V. Kumar, editors, Next Generation Data Mining. CRC Press, 2008.Google Scholar
- K. Liu and E. Terzi. Towards identity anonymization on graphs. In Proc. of ACM SIGMOD, 2008. Google ScholarDigital Library
- P. Samarati and L. Sweeney. Generalizing data to provide anonymity when disclosing information. In Proc. of ACM PODS, 1998. Google ScholarDigital Library
- L. Sweeney. k-anonymity: A model for protecting privacy. IJUFKS, 10(5), 2002. Google ScholarDigital Library
- J. P. Scott. Social network analysis: a handbook. Sage Publications, 2nd edition, 2000.Google Scholar
- C.-H. Tai, D.-N. Yang, P. S. Yu, and M.-S. Chen. Structural Diversity for Privacy in Publishing Social Networks. In Proc. of SDM, 2011.Google Scholar
- S. Wasserman, K. Faust, D. Iacobucci, and M. Granovetter. Social network analysis: methods and applications. Cambridge University Press, 1994.Google ScholarCross Ref
- X. Wu, X. Ying, K. Liu, and L. Chen. A Survey of Privacy-Preservation of Graphs and Social Networks. Springer US, 2010.Google ScholarCross Ref
- X. Ying and X. Wu. Randomizing social networks: a spectrum preserving approach. In Proc. of SDM, 2008.Google ScholarCross Ref
- L. Zhang and W. Zhang. Edge anonymity in social network graphs. In Proc. of CSE, 2009. Google ScholarDigital Library
- E. Zheleva and L. Getoor. Preserving the privacy of sensitive relationships in graph data. In Proc. of PinKDD, 2007. Google ScholarDigital Library
- B. Zhou and J. Pei. Preserving privacy in social networks against neighborhood attacks. In Proc. of ICDE, 2008. Google ScholarDigital Library
- B. Zhou, J. Pei, and W. Luk. A brief survey on anonymization techniques for privacy preserving publishing of social network data. SIGKDD Explorations, 10(2), 2008. Google ScholarDigital Library
- L. Zou, L. Chen, and M. T. -Ozsu. K-automorphism: a general framework for privacy preserving network publication. In Proc. of VLDB, 2009. Google ScholarDigital Library
Index Terms
- Privacy-preserving social network publication against friendship attacks
Recommendations
Privacy Preserving Social Network Publication against Mutual Friend Attacks
ICDMW '13: Proceedings of the 2013 IEEE 13th International Conference on Data Mining WorkshopsPublishing social network data for research purposes has raised serious concerns for individual privacy. There exist many privacy-preserving works that can deal with different attack models. In this paper, we introduce a novel privacy attack model and ...
Privacy Preserving Social Network Publication Against Mutual Friend Attacks
Publishing social network data for research purposes has raised serious concerns for individual privacy. There exist many privacy-preserving works that can deal with different attack models. In this paper, we introduce a novel privacy attack model and ...
Identities Anonymization in Dynamic Social Networks
ICDM '11: Proceedings of the 2011 IEEE 11th International Conference on Data MiningPrivacy in social network data publishing is always an important concern. Nowadays most prior privacy protection techniques focus on static social networks. However, there are additional privacy disclosures in dynamic social networks due to the ...
Comments