Vertex re‐identification attack using neighbourhood‐pair properties. (27th September 2015)

• Record Type: Journal Article
• Authors: Abawajy, Jemal; Ninggal, Mohd Izuan Hafez; Herawan, Tutut
• Other Names: Jeong Hwa‐Young guestEditor.; Rana Omer F. guestEditor.; Hsu Ching‐Hsien guestEditor.; Jeong Young‐Sik guestEditor.; Xiang Yang guestEditor.; Au Man Ho guestEditor.; Kutylowsky Miroslaw guestEditor.
• Is Part Of: Concurrency and computation. Volume 28:Number 10(2016)
• Page Start: 2906
• Page End: 2919
• Publication Date: 2015-09-27
• Subjects: social network -- vertex re‐identification attack -- privacy -- neighbourhood‐pair properties; Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.3687
• Languages: English
• ISSNs: 1532-0626

Abstract

Summary: There has been a growing interest in sharing and mining social network data for a wide variety of applications. In this paper, we address the problem of privacy disclosure risks that arise from publishing social network data. Specifically, we look at the vertex re‐identification attack that aims to link specific vertex in social network data to specific individual in the real world. We show that even when identifiable attributes such as names are removed from released social network data, re‐identification attack is still possible by manipulating abstract information. We present a new type of vertex re‐identification attack model called neighbourhood‐pair attack. This attack utilizes the information about the local communities of two connected vertices to identify the target individual. We show both theoretically and empirically that the proposed attack provides higher re‐identification rate compared with the existing re‐identification attacks that also manipulate network structure properties. The experiments conducted also show that the proposed attack is still possible even on anonymised social network data. Copyright © 2015 John Wiley & Sons, Ltd.