Abawajy, J. and Ninggal, M.I.H. and Herawan, T. (2015) Vertex re-identification attack using neighbourhood-pair properties. Concurrency and Computation: Practice and Experience, 28 (10). pp. 2906-2919. ISSN 1532-0626, DOI https://doi.org/10.1002/cpe.3687.
Full text not available from this repository.Abstract
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.
| Item Type: | Article |
|---|---|
| Funders: | UNSPECIFIED |
| Uncontrolled Keywords: | Neighbourhood-pair properties; Privacy; Social network; Vertex re-identification attack |
| Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| Divisions: | Faculty of Computer Science & Information Technology |
| Depositing User: | Ms. Juhaida Abd Rahim |
| Date Deposited: | 11 Oct 2017 03:49 |
| Last Modified: | 11 Oct 2017 03:49 |
| URI: | http://eprints.um.edu.my/id/eprint/17961 |
Actions (login required)
 |
View Item |
