Títol:
|
Comparing Random-based and k-Anonymity-Based Algorithms for Graph Anonymization
|
Autor/a:
|
Casas Roma, Jordi; Torra, Vicenç; Herrera Joancomartí, Jordi
|
Abstract:
|
Recently, several anonymization algorithms have appeared for privacy preservation on graphs. Some of them are based on random-ization 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 orderto 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. |
Data de publicació:
|
28-02-2014 |
Matèries:
|
Social networks k-Anonymity Privacy Anonimization |
Drets:
|
NO |
Tipus de document:
|
Article Conference lecture Part of book or chapter of book |
Publicat per:
|
Springer-Verlag
|
Compartir:
|
|