Privacy Preserving Social Network Publication on Bipartite Graphs - Information Security Theory and Practice Access content directly
Conference Papers Year : 2012

Privacy Preserving Social Network Publication on Bipartite Graphs

Abstract

In social networks, some data may come in the form of bipartite graphs, where properties of nodes are public while the associations between two nodes are private and should be protected. When publishing the above data, in order to protect privacy, we propose to adopt the idea generalizing the graphs to super-nodes and super-edges. We investigate the problem of how to preserve utility as much as possible and propose an approach to partition the nodes in the process of generalization. Our approach can give privacy guarantees against both static attacks and dynamic attacks, and at the same time effectively answer aggregate queries on published data.
Fichier principal
Vignette du fichier
978-3-642-30955-7_7_Chapter.pdf (195.5 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01534307 , version 1 (07-06-2017)

Licence

Attribution

Identifiers

Cite

Jian Zhou, Jiwu Jing, Ji Xiang, Lei Wang. Privacy Preserving Social Network Publication on Bipartite Graphs. 6th International Workshop on Information Security Theory and Practice (WISTP), Jun 2012, Egham, United Kingdom. pp.58-70, ⟨10.1007/978-3-642-30955-7_7⟩. ⟨hal-01534307⟩
633 View
53 Download

Altmetric

Share

Gmail Facebook X LinkedIn More