Flexible adversary disclosure risk measure for identity and attribute disclosure attacks

被引:2
作者
Orooji, Marmar [1 ]
Rabbanian, Seyedeh Shaghayegh [2 ]
Knapp, Gerald M. M. [3 ]
机构
[1] Rice Univ, Dept Comp Sci, B146-B Abercrombie, Houston, TX 77251 USA
[2] Louisiana State Univ, Dept Mech & Ind Engn, 3277-21 Patrick F Taylor Hall, Baton Rouge, LA 70803 USA
[3] Louisiana State Univ, Dept Mech & Ind Engn, 3250-B Patrick F Taylor Hall, Baton Rouge, LA 70803 USA
关键词
Attribute disclosure; Data privacy; Disclosure risk measure; Identity disclosure; RECORD LINKAGE; PRIVACY; ALGORITHM;
D O I
10.1007/s10207-022-00654-y
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Individuals generate tremendous amount of personal data each day, with a wide variety of uses. This datum often contains sensitive information about individuals, which can be disclosed by "adversaries ". Even when direct identifiers such as social security numbers are masked, an adversary may be able to recognize an individual's identity for a data record by looking at the values of quasi-identifiers (QIDs), known as identity disclosure, or can uncover sensitive attributes (SAs) about an individual through attribute disclosure. In data privacy field, multiple disclosure risk measures have been proposed. These share two drawbacks: they do not consider identity and attribute disclosure concurrently, and they consider a restrictive attack model by assuming certain attributes, namely QIDs and SAs. In this paper, we present a flexible adversary disclosure risk measure that addresses these limitations, by presenting a single combined metric of identity and attribute disclosure, and generalizing attack models by considering all scenarios for an adversary's knowledge and disclosure targets while providing the flexibility to model a specific disclosure preference. We have developed an efficient algorithm for computing our proposed risk measure and evaluated the performance of our approach on a benchmark dataset from 1994 Census database.
引用
收藏
页码:631 / 645
页数:15
相关论文
共 37 条
[1]   Supervised learning using a symmetric bilinear form for record linkage [J].
Abril, Daniel ;
Torra, Vicenc ;
Navarro-Arribas, Guillermo .
INFORMATION FUSION, 2015, 26 :144-153
[2]   Improving record linkage with supervised learning for disclosure risk assessment [J].
Abril, Daniel ;
Navarro-Arribas, Guillermo ;
Torra, Vicenc .
INFORMATION FUSION, 2012, 13 (04) :274-284
[3]   Choquet integral for record linkage [J].
Abril, Daniel ;
Navarro-Arribas, Guillermo ;
Torra, Vicenc .
ANNALS OF OPERATIONS RESEARCH, 2012, 195 (01) :97-110
[4]   Scoring Users' Privacy Disclosure Across Multiple Online Social Networks [J].
Aghasian, Erfan ;
Garg, Saurabh ;
Gao, Longxiang ;
Yu, Shui ;
Montgomery, James .
IEEE ACCESS, 2017, 5 :13118-13130
[5]  
Andreou A., 2017, P IEEE ACM INT C ADV, P163, DOI [10.1145/3110025.3110046, DOI 10.1145/3110025.3110046, DOI 10.1145/3110025.3110046.25G]
[6]   A METRIC TO EVALUATE INTERACTION OBFUSCATION IN ONLINE SOCIAL NETWORKS [J].
Balsa, Ero ;
Troncoso, Carmela ;
Diaz, Claudia .
INTERNATIONAL JOURNAL OF UNCERTAINTY FUZZINESS AND KNOWLEDGE-BASED SYSTEMS, 2012, 20 (06) :877-892
[7]   Jumping NLP Curves: A Review of Natural Language Processing Research [J].
Cambria, Erik ;
White, Bebo .
IEEE COMPUTATIONAL INTELLIGENCE MAGAZINE, 2014, 9 (02) :48-57
[8]  
Cheng X, 2018, IEEE T KNOWL DATA EN, V30, P1411, DOI [10.1109/TKDE.2018.2793862, 10.1109/tkde.2018.2793862]
[9]  
Domingo-Ferrer J, 2015, ANN CONF PRIV SECUR, P28, DOI 10.1109/PST.2015.7232951
[10]   Differential Privacy Preserving of Training Model in Wireless Big Data with Edge Computing [J].
Du, Miao ;
Wang, Kun ;
Xia, Zhuoqun ;
Zhang, Yan .
IEEE TRANSACTIONS ON BIG DATA, 2020, 6 (02) :283-295