How to Quantify Graph De-anonymization Risks

被引:0
|
作者
Lee, Wei-Han [1 ]
Liu, Changchang [1 ]
Ji, Shouling [2 ,3 ]
Mittal, Prateek [1 ]
Lee, Ruby B. [1 ]
机构
[1] Princeton Univ, Princeton, NJ 08544 USA
[2] Zhejiang Univ, Hangzhou, Peoples R China
[3] Georgia Tech, Atlanta, GA USA
来源
关键词
Structure-based de-anonymization attacks; Anonymization utility; De-anonymization capability; Theoretical bounds;
D O I
10.1007/978-3-319-93354-2_5
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
An 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.
引用
收藏
页码:84 / 104
页数:21
相关论文
共 50 条
  • [31] Fast De-anonymization of Social Networks with Structural Information
    Yingxia Shao
    Jialin Liu
    Shuyang Shi
    Yuemei Zhang
    Bin Cui
    Data Science and Engineering, 2019, 4 : 76 - 92
  • [32] Search Rank Fraud De-Anonymization in Online Systems
    Rahman, Mizanur
    Carbunar, Bogdan
    Hernandez, Nestor
    Chau, Duen Horng
    HT'18: PROCEEDINGS OF THE 29TH ACM CONFERENCE ON HYPERTEXT AND SOCIAL MEDIA, 2018, : 174 - 182
  • [33] Collective De-Anonymization of Social Networks With Optional Seeds
    Zhang, Jiapeng
    Fu, Luoyi
    Long, Huan
    Meng, Guiae
    Tang, Feilong
    Wang, Xinbing
    Chen, Guihai
    IEEE TRANSACTIONS ON MOBILE COMPUTING, 2022, 21 (12) : 4218 - 4232
  • [34] De-anonymization of Heterogeneous Random Graphs in Quasilinear Time
    Bringmann, Karl
    Friedrich, Tobias
    Krohmer, Anton
    ALGORITHMS - ESA 2014, 2014, 8737 : 197 - 208
  • [35] An Efficient and Robust Social Network De-anonymization Attack
    Gulyas, Gabor Gyorgy
    Simon, Benedek
    Imre, Sandor
    PROCEEDINGS OF THE 2016 ACM WORKSHOP ON PRIVACY IN THE ELECTRONIC SOCIETY (WPES'16), 2016, : 1 - 11
  • [36] Theoretical Results on De-Anonymization via Linkage Attacks
    Merener, Martin M.
    TRANSACTIONS ON DATA PRIVACY, 2012, 5 (02) : 377 - 402
  • [37] De-anonymization of Heterogeneous Random Graphs in Quasilinear Time
    Bringmann, Karl
    Friedrich, Tobias
    Krohmer, Anton
    ALGORITHMICA, 2018, 80 (11) : 3397 - 3427
  • [38] De-anonymization of Heterogeneous Random Graphs in Quasilinear Time
    Karl Bringmann
    Tobias Friedrich
    Anton Krohmer
    Algorithmica, 2018, 80 : 3397 - 3427
  • [39] Optimal De-Anonymization in Random Graphs with Community Structure
    Onaran, Efe
    Garg, Siddharth
    Erkip, Elza
    2016 50TH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS AND COMPUTERS, 2016, : 709 - 713
  • [40] Provable De-anonymization of Large Datasets with Sparse Dimensions
    Datta, Anupam
    Sharma, Divya
    Sinha, Arunesh
    PRINCIPLES OF SECURITY AND TRUST, POST 2012, 2012, 7215 : 229 - 248