An efficient privacy-preserving data publishing in health care records with multiple sensitive attributes

被引:1
|
作者
Jayapradha, J. [1 ]
Prakash, M. [1 ]
机构
[1] SRM Inst Sci & Technol, Fac Engn & Technol, Coll Engn & Technol, Dept Comp Sci & Engn, Chennai 603203, Tamil Nadu, India
关键词
E-Health; Privacy; Multi-record; Utility; Generalization; k-anonymity; (k; l)-diversity;
D O I
10.1109/ICICT50816.2021.9358639
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Emerging advanced technologies in the e-health sector have improved the industry, helping to invent new medicine, reduced cost, better-quality consultation, and treatment. The improvements have originated from the patient record analysis that is shared between the health care provider and researchers. Due to this collaboration, there is an emerging security and privacy requirement in the health care sector. Privacy-preserved data publishing plays a significant role in preventing the disclosure of individual identity. Many privacy-preserving models have been proposed earlier for data publishing. However, they still suffer from few drawbacks i) cannot be applied on 1: M dataset ii) no trade-off between privacy and utility. To satisfy the multi-record privacy and trade-off between classification utility and privacy, we proposed Quasi-identifier Bucket-Individual Multi-Sensitive Attribute Bucket (QIAB-IMSB) algorithm. The main focus of our work is to anonymize the multi-valued record of an individual. The initial phase of our work is to merge the multi-record of an individual. Next, we implement vertical partitioning and apply k-anonymity for quasi-identifier bucket (QIAB) and (k, l) - diversity for individual multi-sensitive attribute bucket (IMSB). Our proposed approach mainly focuses on preventing the sensitive linking attack by implementing hierarchical generalization taxonomy. Our experimental results proved that there is an improved privacy and classification utility in privacy-preserving data publishing of health care records.
引用
收藏
页码:623 / 629
页数:7
相关论文
共 50 条
  • [31] EDAMS: Efficient Data Anonymization Model Selector for Privacy-Preserving Data Publishing
    Qamar, Tehreem
    Bawany, Narmeen Zakaria
    Khan, Najeed Ahmed
    [J]. ENGINEERING TECHNOLOGY & APPLIED SCIENCE RESEARCH, 2020, 10 (02) : 5423 - 5427
  • [32] Personalized Privacy-Preserving Trajectory Data Publishing
    Lu Qiwei
    Wang Caimei
    Xiong Yan
    Xia Huihua
    Huang Wenchao
    Gong Xudong
    [J]. CHINESE JOURNAL OF ELECTRONICS, 2017, 26 (02) : 285 - 291
  • [33] Privacy-preserving data publishing for cluster analysis
    Fung, Benjamin C. M.
    Wang, Ke
    Wang, Lingyu
    Hung, Patrick C. K.
    [J]. DATA & KNOWLEDGE ENGINEERING, 2009, 68 (06) : 552 - 575
  • [34] Privacy-Preserving Continuous Event Data Publishing
    Rafiei, Majid
    van der Aalst, Wil M. P.
    [J]. BUSINESS PROCESS MANAGEMENT FORUM (BPM 2021), 2021, 427 : 178 - 194
  • [35] δ-Dependency for privacy-preserving XML data publishing
    Landberg, Anders H.
    Nguyen, Kinh
    Pardede, Eric
    Rahayu, J. Wenny
    [J]. JOURNAL OF BIOMEDICAL INFORMATICS, 2014, 50 : 77 - 94
  • [36] Privacy-Preserving Data Publishing in Process Mining
    Rafiei, Majid
    van der Aalst, Wil M. P.
    [J]. BUSINESS PROCESS MANAGEMENT FORUM, BPM FORUM 2020, 2020, 392 : 122 - 138
  • [37] Personalized Privacy-Preserving Trajectory Data Publishing
    LU Qiwei
    WANG Caimei
    XIONG Yan
    XIA Huihua
    HUANG Wenchao
    GONG Xudong
    [J]. Chinese Journal of Electronics, 2017, 26 (02) : 285 - 291
  • [38] Towards Privacy-Preserving Speech Data Publishing
    Qian, Jianwei
    Han, Feng
    Hou, Jiahui
    Zhang, Chunhong
    Wang, Yu
    Li, Xiang-Yang
    [J]. IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (IEEE INFOCOM 2018), 2018, : 1088 - 1096
  • [39] DATA MINING AS A TOOL IN PRIVACY-PRESERVING DATA PUBLISHING
    Sramka, Michal
    [J]. NILCRYPT 10, 2010, 45 : 151 - 159
  • [40] Privacy-Preserving Algorithms for Multiple Sensitive Attributes Satisfying t-Closeness
    Wang, Rong
    Zhu, Yan
    Chen, Tung-Shou
    Chang, Chin-Chen
    [J]. JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2018, 33 (06) : 1231 - 1242