Motivated by recently discovered privacy attacks on social networks, we study the problem of anonymizing the underlying graph of interactions in a social network. We call a graph (k, ℓ)-anonymous if for every node in the graph there exist at least k other nodes that share at least ℓ of its neighbors. We consider two combinatorial problems arising from this notion of anonymity in graphs. More specifically, given an input graph we ask for the minimum number of edges to be added so that the graph becomes (k, ℓ)-anonymous. We define two variants of this minimization problem and study their properties. We show that for certain values of k and ℓ the problems are polynomial-time solvable, while for others they become NP-hard. Approximation algorithms for the latter cases are also given.
Feder et al. REF called a graph (k, l)-anonymous if, for every vertex in the graph, there exist at least k other vertices that share at least l of their neighbors.
Anonymizing Graphs
ArXiv
ArXiv
Computer Science