Preserving Privacy in Social Networks Against Subgraph Attacks

摘要：

With the rapid development of internet, explosive growth of social network creates largescale 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.

关键词： social network data publishing privacy preservation graph isomorphism subgraph attacks

作者: TANG Chenxing WANG Xiaodong

作者单位: College of Mathematic and Computer Science,Fuzhou University,Fuzhou, China

会议类型: 国际会议

会议名称: 2010 IEEE International Conference on Intelligent Computing and Intelligent Systems(2010 IEEE 智能计算与智能系统国际会议 ICIS 2010)

会议地点: 厦门

会议语种:英文

页码: 154-158

在线出版日期: 2010-10-29（万方平台首次上网日期，不代表论文的发表时间）