Preserving the privacy of sensitive relationships in graph data
| Title | Preserving the privacy of sensitive relationships in graph data |
| Publication Type | Conference Papers |
| Year of Publication | 2008 |
| Authors | Zheleva E, Getoor L |
| Conference Name | Proceedings of the 1st ACM SIGKDD international conference on Privacy, security, and trust in KDD |
| Date Published | 2008/// |
| Publisher | Springer-Verlag |
| Conference Location | Berlin, Heidelberg |
| ISBN Number | 3-540-78477-2, 978-3-540-78477-7 |
| Keywords | anonymization, graph data, identification, link mining, noisy-or, privacy, social network analysis |
| Abstract | In this paper, we focus on the problem of preserving the privacy of sensitive relationships in graph data. We refer to the problem of inferring sensitive relationships from anonymized graph data as link reidentification. We propose five different privacy preservation strategies, which vary in terms of the amount of data removed (and hence their utility) and the amount of privacy preserved. We assume the adversary has an accurate predictive model for links, and we show experimentally the success of different link re-identification strategies under varying structural characteristics of the data. |
| URL | http://dl.acm.org/citation.cfm?id=1793474.1793485 |