DocumentCode :
2875268
Title :
Social Network Privacy for Attribute Disclosure Attacks
Author :
Chester, Sean ; Srivastava, Gautam
Author_Institution :
CS Dept., Univ. of Victoria, Victoria, BC, Canada
fYear :
2011
fDate :
25-27 July 2011
Firstpage :
445
Lastpage :
449
Abstract :
Increasing research on social networks stresses the urgency for producing effective means of ensuring user privacy. Represented ubiquitously as graphs, social networks have a myriad of recently developed techniques to prevent identity disclosure, but the equally important attribute disclosure attacks have been neglected. To address this gap, we introduce an approach to anonymize social networks that have labeled nodes, α-proximity, which requires that the label distribution in every neighbourhood of the graph be close to that throughout the entire network. We present an effective greedy algorithm to achieve α-proximity and experimentally validate the quality of the solutions it derives.
Keywords :
computer crime; data privacy; graphs; greedy algorithms; social networking (online); ubiquitous computing; α-proximity; attribute disclosure attack; greedy algorithm; label distribution; social network privacy; Communities; Diseases; Facebook; Greedy algorithms; Partitioning algorithms; Privacy; algorithms; anonymization; attribute disclosure; data privacy; social networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Advances in Social Networks Analysis and Mining (ASONAM), 2011 International Conference on
Conference_Location :
Kaohsiung
Print_ISBN :
978-1-61284-758-0
Electronic_ISBN :
978-0-7695-4375-8
Type :
conf
DOI :
10.1109/ASONAM.2011.105
Filename :
5992612
Link To Document :
بازگشت