Neighbourhood-pair attack in social network data publishing
Ninggal, MIH and Abawajy, JH 2014, Neighbourhood-pair attack in social network data publishing. In Stojmenovic,I, Cheng,Z and Guo,S (ed), Mobile and Ubiquitous Systems : Computing, Networking, and Services, Springer Verlag, Heidelberg, Germany, pp.726-731, doi: 10.1007/978-3-319-11569-6_61.
Attached Files
Name
Description
MIMEType
Size
Downloads
Title
Neighbourhood-pair attack in social network data publishing
Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
Chapter number
59
Total chapters
67
Start page
726
End page
731
Total pages
6
Publisher
Springer Verlag
Place of Publication
Heidelberg, Germany
Summary
Vertex re-identification is one of the significant and challenging problems in social network. In this paper, we show a new type of vertex reidentification attack called neighbourhood-pair attack. This attack utilizes the neighbourhood topologies of two connected vertices. We show both theoretically and empirically that this attack is possible on anonymized social network and has higher re-identification rate than the existing structural attacks.
Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.