Anonymizing Social Graphs via Uncertainty Semantics - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

Anonymizing Social Graphs via Uncertainty Semantics

Résumé

Rather than anonymizing social graphs by generalizing them to super nodes/edges or adding/removing nodes and edges to satisfy given privacy parameters, recent methods exploit the semantics of uncertain graphs to achieve privacy protection of participating entities and their relationships. These techniques anonymize a deterministic graph by converting it into an uncertain form. In this paper, we propose a general obfuscation model based on uncertain adjacency matrices that keep expected node degrees equal to those in the unanonymized graph. We analyze two recently proposed schemes and their fitting into the model. We also point out disadvantages in each method and present several elegant techniques to fill the gap between them. Finally, to support fair comparisons, we develop a new tradeoff quantifying framework by leveraging the concept of incorrectness. Experiments on large social graphs demonstrate the effectiveness of our schemes.
Fichier non déposé

Dates et versions

hal-01108437 , version 1 (22-01-2015)

Identifiants

  • HAL Id : hal-01108437 , version 1

Citer

Huu Hiep Nguyen, Abdessamad Imine, Michaël Rusinowitch. Anonymizing Social Graphs via Uncertainty Semantics. ASIACCS 2015 - 10th ACM Symposium on Information, Computer and Communications Security, Apr 2015, Singapour, Singapore. ⟨hal-01108437⟩
145 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More