Comparing random-based and k-anonymity-based algorithms for graph anonymization

Jordi Casas-Roma*, Jordi Herrera-Joancomartí, Vicenç Torra

*Corresponding author for this work

Research output: Contribution to journalArticleResearchpeer-review

2 Citations (Scopus)

Abstract

Recently, several anonymization algorithms have appeared for privacy preservation on graphs. Some of them are based on randomization techniques and on k-anonymity concepts. We can use both of them to obtain an anonymized graph with a given k-anonymity value. In this paper we compare algorithms based on both techniques in order to obtain an anonymized graph with a desired k-anonymity value. We want to analyze the complexity of these methods to generate anonymized graphs and the quality of the resulting graphs.

Original languageAmerican English
Pages (from-to)197-209
Number of pages13
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
DOIs
Publication statusPublished - 2012

Keywords

  • Anonimization
  • Graphs
  • k-Anonymity
  • Privacy
  • Social networks

Fingerprint Dive into the research topics of 'Comparing random-based and k-anonymity-based algorithms for graph anonymization'. Together they form a unique fingerprint.

Cite this