Reference : Preventing active re-identification attacks on social graphs via sybil subgraph obfus...
Scientific journals : Article
Engineering, computing & technology : Computer science
Security, Reliability and Trust
Preventing active re-identification attacks on social graphs via sybil subgraph obfuscation
Mauw, Sjouke mailto [University of Luxembourg > Faculty of Science, Technology and Medicine (FSTM) > Department of Computer Science (DCS) >]
Ramirez Cruz, Yunior mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > PI Mauw]
Trujillo Rasua, Rolando mailto [Universitat Rovira i Virgili > Department of Computer Sciences and Mathematics]
Knowledge and Information Systems
[en] Active re-identification attacks constitute a serious threat to privacy-preserving social graph publication, because of the ability of active adversaries to leverage fake accounts, a.k.a. sybil nodes, to enforce structural patterns that can be used to re-identify their victims on anonymised graphs. Several formal privacy properties have been enunciated with the purpose of characterising the resistance of a graph against active attacks. However, anonymisation methods devised on the basis of these properties have so far been able to address only restricted special cases, where the adversaries are assumed to leverage a very small number of sybil nodes. In this paper, we present a new probabilistic interpretation of active re-identification attacks on social graphs. Unlike the aforementioned privacy properties, which model the protection from active adversaries as the task of making victim nodes indistinguishable in terms of their fingerprints with respect to all potential attackers, our new formulation introduces a more complete view, where the attack is countered by jointly preventing the attacker from retrieving the set of sybil nodes, and from using these sybil nodes for re-identifying the victims. Under the new formulation, we show that k-symmetry, a privacy property introduced in the context of passive attacks, provides a sufficient condition for the protection against active re-identification attacks leveraging an arbitrary number of sybil nodes. Moreover, we show that the algorithm K-Match, originally devised for efficiently enforcing the related notion of k-automorphism, also guarantees k-symmetry. Empirical results on real-life and synthetic graphs demonstrate that our formulation allows, for the first time, to publish anonymised social graphs (with formal privacy guarantees) that effectively resist the strongest active re-identification attack reported in the literature, even when it leverages a large number of sybil nodes.
Fonds National de la Recherche - FnR
C17/IS/11685812 (PrivDA)
FnR ; FNR11685812 > Yunior Ramirez-cruz > PrivDA > Privacy-preserving Publication Of Dynamic Social Network Data In The Presence Of Active Adversaries > 01/06/2018 > 31/05/2021 > 2017

File(s) associated to this reference

Fulltext file(s):

Open access
MRT21.pdfPublisher postprint896.41 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.