Preserving Privacy in Social Networks Against Neighborhood Attacks
Top Cited Papers
- 1 April 2008
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10636382,p. 506-515
- https://doi.org/10.1109/icde.2008.4497459
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.Keywords
This publication has 16 references indexed in Scilit:
- Preserving the Privacy of Sensitive Relationships in Graph DataPublished by Springer Nature ,2008
- Wherefore art thou r3579x?Published by Association for Computing Machinery (ACM) ,2007
- Structure and evolution of online social networksPublished by Association for Computing Machinery (ACM) ,2006
- Empirical Analysis of an Evolving Social NetworkScience, 2006
- Link miningACM SIGKDD Explorations Newsletter, 2005
- How to search a social networkSocial Networks, 2005
- R-MAT: A Recursive Model for Graph MiningPublished by Society for Industrial & Applied Mathematics (SIAM) ,2004
- On the Complexity of Approximating k-Dimensional MatchingPublished by Springer Nature ,2003
- k-ANONYMITY: A MODEL FOR PROTECTING PRIVACYInternational Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 2002
- Protecting respondents identities in microdata releaseIEEE Transactions on Knowledge and Data Engineering, 2001