Abstract
Although a lot of literatures have been proposed on the issue of privacy preserve with relational data, social networks bring new challenges of resisting re-identify attacks. Based on message passing, an approach of privacy preserve in social networks is proposed in this paper. Individuals are assigned to different clusters according to their quasi-identifies and structural similarity measured by message passing. With clusters, k-anonymous mask networks are achieved where any individual is indistinguishable to other k-1 individuals. The experiments show our approach can protect individuals' privacy effectively in social networks with little information loss during generalization.
| Original language | English |
|---|---|
| Title of host publication | Proceedings - 2012 4th International Conference on Multimedia and Security, MINES 2012 |
| Pages | 483-487 |
| Number of pages | 5 |
| DOIs | |
| State | Published - 2012 |
| Externally published | Yes |
| Event | 2012 4th International Conference on Multimedia and Security, MINES 2012 - Nanjing, Jiangsu, China Duration: 2 Nov 2012 → 4 Nov 2012 |
Publication series
| Name | Proceedings - 2012 4th International Conference on Multimedia and Security, MINES 2012 |
|---|
Conference
| Conference | 2012 4th International Conference on Multimedia and Security, MINES 2012 |
|---|---|
| Country/Territory | China |
| City | Nanjing, Jiangsu |
| Period | 2/11/12 → 4/11/12 |
Keywords
- K-anonymity
- Privacy preserve
- Social networks