Anonymizing Graphs Export

@article{citeulike:3476707, abstract = {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,l)-anonymous if for every node in the graph there exist at least k other nodes that share at least l 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,l)-anonymous. We define two variants of this minimization problem and study their properties. We show that for certain values of k and l the problems are polynomial-time solvable, while for others they become NP-hard. Approximation algorithms for the latter cases are also given.}, archivePrefix = {arXiv}, author = {Feder, Tomas and Nabar, Shubha U. and Terzi, Evimaria}, citeulike-article-id = {3476707}, citeulike-linkout-0 = {http://arxiv.org/abs/0810.5578}, citeulike-linkout-1 = {http://arxiv.org/pdf/0810.5578}, eprint = {0810.5578}, keywords = {combinatorics, graphs, mathematics}, month = {Oct}, posted-at = {2008-11-03 19:44:08}, priority = {2}, title = {Anonymizing Graphs}, url = {http://arxiv.org/abs/0810.5578}, year = {2008} }

TY - JOUR ID - citeulike:3476707 L3 - citeulike-article-id:3476707 N2 - 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,l)-anonymous if for every node in the graph there exist at least k other nodes that share at least l 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,l)-anonymous. We define two variants of this minimization problem and study their properties. We show that for certain values of k and l the problems are polynomial-time solvable, while for others they become NP-hard. Approximation algorithms for the latter cases are also given. TI - Anonymizing Graphs KW - combinatorics KW - graphs KW - mathematics AU - Feder, Tomas AU - Nabar, Shubha AU - Terzi, Evimaria PY - 2008/Oct/30/ UR - http://arxiv.org/abs/0810.5578 ER -