A probabilistic approach to mitigate composition attacks on privacy in non-coordinated environments

被引:17
作者
Sattar, A. H. M. Sarowar [1 ]
Li, Jiuyong [1 ]
Liu, Jixue [1 ]
Heatherly, Raymond [2 ]
Malin, Bradley [2 ,3 ]
机构
[1] Univ S Australia, Sch Informat Technol & Math Sci, Mawson Lakes, SA 5095, Australia
[2] Vanderbilt Univ, Dept Biomed Informat, Nashville, TN 37235 USA
[3] Vanderbilt Univ, Dept Elect Engn & Comp Sci, Nashville, TN 37235 USA
基金
美国国家卫生研究院; 美国国家科学基金会; 澳大利亚研究理事会;
关键词
Databases; Data publication; Privacy; Composition attack; Anonymization; K-ANONYMITY; BIG DATA; FRAMEWORK; MODEL;
D O I
10.1016/j.knosys.2014.04.019
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Organizations share data about individuals to drive business and comply with law and regulation. However, an adversary may expose confidential information by tracking an individual across disparate data publications using quasi-identifying attributes (e.g., age, geocode and sex) associated with the records. Various studies have shown that well-established privacy protection models (e.g., k-anonymity and its extensions) fail to protect an individual's privacy against this "composition attack". This type of attack can be thwarted when organizations coordinate prior to data publication, but such a practice is not always feasible. In this paper, we introduce a probabilistic model called (d, alpha)-linkable, which mitigates composition attack without coordination. The model ensures that d confidential values are associated with a quasi-identifying group with a likelihood of alpha. We realize this model through an efficient extension to k-anonymization and use extensive experiments to show our strategy significantly reduces the likelihood of a successful composition attack and can preserve more utility than alternative privacy models, such as differential privacy. (C) 2014 Elsevier B.V. All rights reserved.
引用
收藏
页码:361 / 372
页数:12
相关论文
共 36 条
  • [1] Aggarwal CC, 2004, LECT NOTES COMPUT SC, V2992, P183
  • [2] [Anonymous], 2008, P 14 ACM SIGKDD INT
  • [3] [Anonymous], 2012, STANFORD LAW REV ONL
  • [4] Cebul Randall D., 2008, 14212 NAT BUR EC RES
  • [5] Ordinal, continuous and heterogeneous k-anonymity through microaggregation
    Domingo-Ferrer, J
    Torra, V
    [J]. DATA MINING AND KNOWLEDGE DISCOVERY, 2005, 11 (02) : 195 - 212
  • [6] Hybrid microdata using microaggregation
    Domingo-Ferrer, Josep
    Gonzalez-Nicolas, Ursula
    [J]. INFORMATION SCIENCES, 2010, 180 (15) : 2834 - 2844
  • [7] Dwork C, 2006, LECT NOTES COMPUT SC, V4052, P1
  • [8] Fung B. C. M., 2008, ACM INT C P SERIES, P264, DOI [10.1145/1353343.1353378, DOI 10.1145/1353343.1353378, 10.1145]
  • [9] Privacy-Preserving Data Publishing: A Survey of Recent Developments
    Fung, Benjamin C. M.
    Wang, Ke
    Chen, Rui
    Yu, Philip S.
    [J]. ACM COMPUTING SURVEYS, 2010, 42 (04)
  • [10] Ganta S.R., 2008, P 14 ACM SIGKDD INT, P265, DOI [DOI 10.1145/1401890.1401926, 10.1145/1401890.1401926]