Vertex re-identification attack using neighbourhood-pair properties

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...

Full description

Bibliographic Details
Main Authors: Abawajy, J., Ninggal, M.I.H., Herawan, T.
Format: Article
Published: John Wiley & Sons 2015
Subjects:
_version_ 1796947251943178240
author Abawajy, J.
Ninggal, M.I.H.
Herawan, T.
author_facet Abawajy, J.
Ninggal, M.I.H.
Herawan, T.
author_sort Abawajy, J.
collection UM
description 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.
first_indexed 2024-03-06T05:44:02Z
format Article
id um.eprints-17961
institution Universiti Malaya
last_indexed 2024-03-06T05:44:02Z
publishDate 2015
publisher John Wiley & Sons
record_format dspace
spelling um.eprints-179612017-10-11T03:49:16Z http://eprints.um.edu.my/17961/ Vertex re-identification attack using neighbourhood-pair properties Abawajy, J. Ninggal, M.I.H. Herawan, T. QA75 Electronic computers. Computer science 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. John Wiley & Sons 2015 Article PeerReviewed 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 <https://doi.org/10.1002/cpe.3687>. http://dx.doi.org/10.1002/cpe.3687 doi:10.1002/cpe.3687
spellingShingle QA75 Electronic computers. Computer science
Abawajy, J.
Ninggal, M.I.H.
Herawan, T.
Vertex re-identification attack using neighbourhood-pair properties
title Vertex re-identification attack using neighbourhood-pair properties
title_full Vertex re-identification attack using neighbourhood-pair properties
title_fullStr Vertex re-identification attack using neighbourhood-pair properties
title_full_unstemmed Vertex re-identification attack using neighbourhood-pair properties
title_short Vertex re-identification attack using neighbourhood-pair properties
title_sort vertex re identification attack using neighbourhood pair properties
topic QA75 Electronic computers. Computer science
work_keys_str_mv AT abawajyj vertexreidentificationattackusingneighbourhoodpairproperties
AT ninggalmih vertexreidentificationattackusingneighbourhoodpairproperties
AT herawant vertexreidentificationattackusingneighbourhoodpairproperties