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

被引:0
|
作者
Canbay, Yavuz [1 ]
Sagiroglu, Seref [2 ]
Vural, Yilmaz [3 ]
机构
[1] Department of Computer Engineering, Sutcu Imam University, Kahramanmaras, Turkey
[2] Department of Computer Engineering, Gazi University, Ankara, Turkey
[3] Department of Computer Science, University of California, Santa Barbara,CA, United States
关键词
Accuracy of analysis - Analysis models - Anonymization - Data subjects - Data utilities - Mondrian - Privacy preserving - Privacy Preserving Data Publishing - Sensitive informations - Upper Bound;
D O I
暂无
中图分类号
学科分类号
摘要
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. © 2022 John Wiley & Sons, Ltd.
引用
收藏
相关论文
共 50 条
  • [31] A Robust Privacy Preserving Model for Data Publishing
    Sowmyarani, C. N.
    Srinivasan, G. N.
    2015 INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATION AND INFORMATICS (ICCCI), 2015,
  • [32] Privacy-Preserving Data Publishing Based On Utility Specification
    Tian, Hongwei
    Zhang, Weining
    2013 ASE/IEEE INTERNATIONAL CONFERENCE ON SOCIAL COMPUTING (SOCIALCOM), 2013, : 114 - 121
  • [33] A Scalable (α, k)-Anonymization Approach using MapReduce for Privacy Preserving Big Data Publishing
    Mehta, Brijesh B.
    Gupta, Ruchika
    Rao, Udai Pratap
    Muthiyan, Mukesh
    2019 10TH INTERNATIONAL CONFERENCE ON COMPUTING, COMMUNICATION AND NETWORKING TECHNOLOGIES (ICCCNT), 2019,
  • [34] Preserving Both Privacy and Utility in Network Trace Anonymization
    Mohammady, Meisam
    Wang, Lingyu
    Hong, Yuan
    Louafi, Habib
    Pourzandi, Makan
    Debbabi, Mourad
    PROCEEDINGS OF THE 2018 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY (CCS'18), 2018, : 459 - 474
  • [35] Utility-Friendly Heterogenous Generalization in Privacy Preserving Data Publishing
    He, Xianmang
    Li, Dong
    Hao, Yanni
    Chen, Huahui
    CONCEPTUAL MODELING, 2014, 8824 : 186 - 194
  • [36] Privacy and Utility Preserving Trajectory Data Publishing for Intelligent Transportation Systems
    Liu, Xiangwen
    Zhu, Yuquan
    IEEE ACCESS, 2020, 8 : 176454 - 176466
  • [37] General Confidentiality and Utility Metrics for Privacy-Preserving Data Publishing Based on the Permutation Model
    Domingo-Ferrer, Josep
    Muralidhar, Krishnamurty
    Bras-Amoros, Maria
    IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2021, 18 (05) : 2506 - 2517
  • [38] Collection of an e-Health Dataset and Anonymization with Privacy-Preserving Data Publishing Algorithms
    Kara, Burak Cem
    Eyupoglu, Can
    Uysal, Serkan
    Bayrakli, Selim
    ELECTRICA, 2023, 23 (03): : 658 - 665
  • [39] Slicing: A New Approach for Privacy Preserving Data Publishing
    Li, Tiancheng
    Li, Ninghui
    Zhang, Jian
    Molloy, Ian
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2012, 24 (03) : 561 - 574
  • [40] Privacy preserving big data publishing: a scalable k-anonymization approach using MapReduce
    Mehta, Brijesh B.
    Rao, Udai Pratap
    IET SOFTWARE, 2017, 11 (05) : 271 - 276