A new utility-aware anonymization model for privacy preserving data publishing

被引:4
作者
Canbay, Yavuz [1 ]
Sagiroglu, Seref [2 ]
Vural, Yilmaz [3 ]
机构
[1] Sutcu Imam Univ, Dept Comp Engn, Kahramanmaras, Turkey
[2] Gazi Univ, Dept Comp Engn, Ankara, Turkey
[3] Univ Calif Santa Barbara, Dept Comp Sci, Santa Barbara, CA 93106 USA
关键词
anonymization; privacy preserving data publishing; utility-aware model; TREES;
D O I
10.1002/cpe.6808
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Most of data in various forms contain sensitive information about individuals and so publishing such data might violate privacy. Privacy preserving data publishing (PPDP) is an essential for publishing useful data while preserving privacy. Anonymization, which is a utility based privacy preserving approach, helps hiding the identities of data subjects and also provides data utility. Since data utility is effective on the accuracy of analysis model, new anonymization algorithms to improve data utility are always required. Mondrian is one of the near-optimal anonymization models that presents high data utility and is frequently used for PPDP. However, the upper bound problem of Mondrian causes a decrease in potential data utility. This article focuses on this problem and proposes a new utility-aware anonymization model (u-Mondrian). Experimental results have shown that u-Mondrian presents an acceptable solution to the upper bound problem, increases total data utility and presents higher data utility than Mondrian for different partitioning strategies and datasets.
引用
收藏
页数:19
相关论文
共 57 条
[1]   Privacy-preserving tabular data publishing: A comprehensive evaluation from web to cloud [J].
Abdelhameed, Saad A. ;
Moussa, Sherin M. ;
Khalifa, Mohamed E. .
COMPUTERS & SECURITY, 2018, 72 :74-95
[2]  
Aggarwal C., 2005, INT C VER LARG DAT B
[3]  
Aggarwal G, 2005, LECT NOTES COMPUT SC, V3363, P246
[4]  
Aggarwal G., 2005, J. Privacy Technol.
[5]  
Almasi MM., 2016, INT C NEW TECHN MOB
[6]  
Bayardo RJ, 2005, PROC INT CONF DATA, P217
[7]   MULTIDIMENSIONAL BINARY SEARCH TREES USED FOR ASSOCIATIVE SEARCHING [J].
BENTLEY, JL .
COMMUNICATIONS OF THE ACM, 1975, 18 (09) :509-517
[8]   LOF: Identifying density-based local outliers [J].
Breunig, MM ;
Kriegel, HP ;
Ng, RT ;
Sander, J .
SIGMOD RECORD, 2000, 29 (02) :93-104
[9]  
Canbay Y., 2019, INT C COMP SCI ENG U
[10]   OAN: outlier record-oriented utility-based privacy preserving model [J].
Canbay, Yavuz ;
Vural, Yilmaz ;
Sagiroglu, Seref .
JOURNAL OF THE FACULTY OF ENGINEERING AND ARCHITECTURE OF GAZI UNIVERSITY, 2020, 35 (01) :355-368