Para acceder a los documentos con el texto completo, por favor, siga el siguiente enlace: http://hdl.handle.net/10609/24881

Comparing Random-based and k-Anonymity-Based Algorithms for Graph Anonymization
Casas Roma, Jordi; Torra, Vicenç; Herrera Joancomartí, Jordi
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.
26-09-2013
Social networks
k-Anonymity
Privacy
Anonimization
NO
Article
Conference lecture
Part of book or chapter of book
Springer-Verlag
         

Mostrar el registro completo del ítem

Documentos relacionados

Otros documentos del mismo autor/a

Cabré Segarra, Blai; Casas Roma, Jordi; Costal Costa, Dolors; Juanola Juanola, Pere; Rius Gavidia, Àngels; Segret Sala, Ramon
Casas Roma, Jordi; Herrera-Joancomartí, Jordi; Torra Reventós, Vicenç
Fernàndez Montolí, Josep Anton; Garreta Domingo, Muriel; Santanach Delisau, Francesc; Casas Roma, Jordi; Domènech Bagaria, Ona; Puigdevall Serralvo, Maria Teresa; Domínguez Martín, Eva; Conesa Caralt, Jordi; Pérez Navarro, Antoni
Casado Martínez, Carlos; Casas Roma, Jordi; Córcoles Briongos, César Pablo; Minguillón Alfonso, Julià; Peña López, Ismael