Structural Attack to Anonymous Graph of Social Networks

Abstract EN

With the rapid development of social networks and its applications, the demand of publishing and sharing social network data for the purpose of commercial or research is increasing.

However, the disclosure risks of sensitive information of social network users are also arising.

The paper proposes an effective structural attack to deanonymize social graph data.

The attack uses the cumulative degree of n-hop neighbors of a node as the regional feature and combines it with the simulated annealing-based graph matching method to explore the nodes reidentification in anonymous social graphs.

The simulation results on two social network datasets show that the attack is feasible in the nodes reidentification in anonymous graphs including the simply anonymous graph, randomized graph and k-isomorphism graph.