Skip to main content

How to quantify graph De-anonymization risks

Author(s): Lee, W-H; Liu, C; Ji, S; Mittal, P; Lee, RB

Download
To refer to this page use: http://arks.princeton.edu/ark:/88435/pr1pc2t87v
Full metadata record
DC FieldValueLanguage
dc.contributor.authorLee, W-H-
dc.contributor.authorLiu, C-
dc.contributor.authorJi, S-
dc.contributor.authorMittal, P-
dc.contributor.authorLee, RB-
dc.date.accessioned2024-02-03T02:02:28Z-
dc.date.available2024-02-03T02:02:28Z-
dc.date.issued2018-06-09en_US
dc.identifier.citationLee, W-H, Liu, C, Ji, S, Mittal, P, Lee, RB. (2018). How to quantify graph De-anonymization risks. Communications in Computer and Information Science, 867 (84 - 104. doi:10.1007/978-3-319-93354-2_5en_US
dc.identifier.urihttp://arks.princeton.edu/ark:/88435/pr1pc2t87v-
dc.description.abstractAn increasing amount of data are becoming publicly available over the Internet. These data are released after applying some anonymization techniques. Recently, researchers have paid significant attention to analyzing the risks of publishing privacy-sensitive data. Even if data anonymization techniques were applied to protect privacy-sensitive data, several de-anonymization attacks have been proposed to break their privacy. However, no theoretical quantification for relating the data vulnerability against de-anonymization attacks and the data utility that is preserved by the anonymization techniques exists. In this paper, we first address several fundamental open problems in the structure-based de-anonymization research by establishing a formal model for privacy breaches on anonymized data and quantifying the conditions for successful de-anonymization under a general graph model. To the best of our knowledge, this is the first work on quantifying the relationship between anonymized utility and de-anonymization capability. Our quantification works under very general assumptions about the distribution from which the data are drawn, thus providing a theoretical guide for practical de-anonymization/anonymization techniques. Furthermore, we use multiple real-world datasets including a Facebook dataset, a Collaboration dataset, and two Twitter datasets to show the limitations of the state-of-the-art de-anonymization attacks. From these experimental results, we demonstrate the ineffectiveness of previous de-anonymization attacks and the potential of more powerful de-anonymization attacks in the future, by comparing the theoretical de-anonymization capability proposed by us with the practical experimental results of the state-of-the-art de-anonymization methods.en_US
dc.format.extent84 - 104en_US
dc.language.isoen_USen_US
dc.relation.ispartofCommunications in Computer and Information Scienceen_US
dc.rightsAuthor's manuscripten_US
dc.titleHow to quantify graph De-anonymization risksen_US
dc.typeConference Articleen_US
dc.identifier.doidoi:10.1007/978-3-319-93354-2_5-
pu.type.symplectichttp://www.symplectic.co.uk/publications/atom-terms/1.0/journal-articleen_US

Files in This Item:
File Description SizeFormat 
How+to+Quantify+Graph+De-anonymization+Risks.pdf421.08 kBAdobe PDFView/Download


Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.