Triangle randomization for social network data anonymization
Fecha de publicación2014-06-27
MetadatosMostrar el registro completo del ítem
In order to protect privacy of social network participants, network graph data should be anonymised prior to its release. Most proposals in the literature aim to achieve $k$-anonymity under specific assumptions about the background information available to the attacker. Our method is based on randomizing
the location of the triangles in the graph. We show that this simple method preserves the main structural parameters of the graph to a high extent, while providing a high re-identification confusion.
Es parte deArs Mathematica Contemporanea, 2014, vol. 7, num. 2, p. 461-477
Excepto si se señala otra cosa, la licencia del ítem se describe comocc-by (c) Society of Mathematicians, Physicists and Astronomers of Slovenia, Institute of Mathematics, Physics, and Mechanics, University of Primorska (Slovenia) 2014
Showing items related by title, author, creator and subject.
López Lorenzo, Ignacio; Pérez Rosés, Hebert; Pujolàs Boix, Jordi; Zdimalovà, Maria (Elsevier B.V., 2016-09-27)The Degree/Diameter Problem is an extremal problem in graph theory with applications in network design. One of the main research areas in the Degree/Diameter Problem consists of finding large graphs whose order approach ...
López Lorenzo, Ignacio; Pérez Rosés, Hebert; Pujolàs Boix, Jordi (Elsevier, 2017-11-20)This paper investigates the upper bounds for the number of vertices in mixed abelian Cayley graphs with given degree and diameter. Additionally, in the case when the undirected degree is equal to one, we give a construction ...
Dalfó, Cristina; Fiol, Miguel Angel; López Lorenzo, Ignacio (Elsevier B.V., 2018)A mixed graph G can contain both (undirected) edges and arcs (directed edges). Here we derive an improved Moore-like bound for the maximum number of vertices of a mixed graph with diameter at least three. Moreover, a ...