Message passing based privacy preserve in social networks

  • Kelin Xiang*
  • , Wei Luo
  • , Xingjian Lu
  • , Jianwei Yin
  • *Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

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 languageEnglish
Title of host publicationProceedings - 2012 4th International Conference on Multimedia and Security, MINES 2012
Pages483-487
Number of pages5
DOIs
StatePublished - 2012
Externally publishedYes
Event2012 4th International Conference on Multimedia and Security, MINES 2012 - Nanjing, Jiangsu, China
Duration: 2 Nov 20124 Nov 2012

Publication series

NameProceedings - 2012 4th International Conference on Multimedia and Security, MINES 2012

Conference

Conference2012 4th International Conference on Multimedia and Security, MINES 2012
Country/TerritoryChina
CityNanjing, Jiangsu
Period2/11/124/11/12

Keywords

  • K-anonymity
  • Privacy preserve
  • Social networks

Fingerprint

Dive into the research topics of 'Message passing based privacy preserve in social networks'. Together they form a unique fingerprint.

Cite this