By Topic

Preserving privacy in social networks against subgraph attacks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Tang Chenxing ; Coll. of Mathematic & Comput. Sci., Fuzhou Univ., Fuzhou, China ; Xiaodong Wang

With the rapid development of internet, explosive growth of social network creates large-scale social network data. In order to discover the potential value of the social network data, many analysis methods have been developed. However, using prior knowledge about the subgraph structure of a given network, it is possible to identify a target node or infer some useful information. In this paper, we mainly consider how to prevent such subgraph attack, and propose a practical method to battle it. We use iterative hash to detect the isomorphic subgraph structures and try to greedily match the anonymous subgraphs. Empirical queries on anonymized social network shows both the security and utility advantage of our algorithm.

Published in:

Intelligent Computing and Intelligent Systems (ICIS), 2010 IEEE International Conference on  (Volume:3 )

Date of Conference:

29-31 Oct. 2010