A Maximum Variance Approach for Graph Anonymization - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

A Maximum Variance Approach for Graph Anonymization

Résumé

Uncertain graphs, a form of uncertain data, have recently attracted a lot of attention as they can represent inherent uncertainty in collected data. The uncertain graphs pose challenges to conventional data processing techniques and open new research directions. Going in the reserve direction, this paper focuses on the problem of anonymizing a deterministic graph by converting it into an uncertain form. The paper first analyzes drawbacks in a recent uncertainty-based anonymization scheme and then proposes Maximum Variance, a novel approach that provides better tradeoff between privacy and utility. Towards a fair com-parison between the anonymization schemes on graphs, the second con-tribution of this paper is to describe a quantifying framework for graph anonymization by assessing privacy and utility scores of typical schemes in a unified space. The extensive experiments show the effectiveness and efficiency of Maximum Variance on three large real graphs.
Fichier principal
Vignette du fichier
uncertain-graph-fps-final.pdf (277.75 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01092442 , version 1 (08-12-2014)

Identifiants

  • HAL Id : hal-01092442 , version 1

Citer

Huu Hiep Nguyen, Abdessamad Imine, Michael Rusinowitch. A Maximum Variance Approach for Graph Anonymization. The 7th International Symposium on Foundations & Practice of Security FPS’2014, Nov 2014, Montreal, Canada. ⟨hal-01092442⟩
241 Consultations
484 Téléchargements

Partager

Gmail Facebook X LinkedIn More