English   español  
Por favor, use este identificador para citar o enlazar a este item: http://hdl.handle.net/10261/138222
logo share SHARE   Add this article to your Mendeley library MendeleyBASE
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:

Data privacy for simply anonymized network logs represented as graphs - considerations for graph alteration operations.

AutorNettleton, David; Torra, Vicenç
Palabras claveGraphs
Data privacy
Fecha de publicación2011
EditorWorld Scientific Publishing
CitaciónInternational Journal of Uncertainty, Fuzziness and Knowlege-Based Systems Vol. 19: 107- 125 (2011)
ResumenIn this paper we review the state of the art on graph privacy with special emphasis on applications to online social networks, and we consider some novel aspects which have not been greatly covered in the specialized literature on graph privacy. The following key considerations are covered: (i) choice of different operators to modify the graph; (ii) information loss based on the cost of graph operations in terms of statistical characteristics (degree, clustering coefficient and path length) in the original graph; (iii) computational cost of the operations; (iv) in the case of the aggregation of two nodes, the choice of similar adjacent nodes rather than isomorphic topologies, in order to maintain the overall structure of the graph; (v) a statistically knowledgeable attacker who is able to search for regions of a simply anonymized graph based on statistical characteristics and map those onto a given node and its immediate neighborhood.
Identificadoresissn: 0218-4885
Aparece en las colecciones: (IIIA) Artículos
Ficheros en este ítem:
Fichero Descripción Tamaño Formato  
IJUFKBS_19(2011)107-25.null341,77 kBUnknownVisualizar/Abrir
Mostrar el registro completo

NOTA: Los ítems de Digital.CSIC están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.