An efficient privacy mechanism for electronic health records. Issue 72 (January 2018)

• Record Type: Journal Article
• Authors: Anjum, Adeel; Malik, Saif ur Rehman; Choo, Kim-Kwang Raymond; Khan, Abid; Haroon, Asma; Khan, Sangeen; Khan, Samee U.; Ahmad, Naveed; Raza, Basit
• Is Part Of: Computers & security. Issue 72(2018)
• Page Start: 196
• Page End: 211
• Publication Date: 2018-01
• Subjects: Electronic health record -- p+-sensitive k-anonymity model -- Balanced p+-sensitive k-anonymity model -- k-anonymity -- Attribute disclosure -- Privacy preserving model; Computer security -- Periodicals; Electronic data processing departments -- Security measures -- Periodicals; 005.805
• DOI: 10.1016/j.cose.2017.09.014
• Languages: English
• ISSNs: 0167-4048

Abstract

Abstract: Electronic health records (EHRs), digitization of patients' health record, offer many advantages over traditional ways of keeping patients' records, such as easing data management and facilitating quick access and real-time treatment. EHRs are a rich source of information for research (e.g. in data analytics), but there is a risk that the published data (or its leakage) can compromise patient privacy. The k -anonymity model is a widely used privacy model to study privacy breaches, but this model only studies privacy against identity disclosure. Other extensions to mitigate existing limitations in k -anonymity model include p -sensitive k -anonymity model, p + -sensitive k -anonymity model, and ( p, α)-sensitive k -anonymity model. In this paper, we point out that these existing models are inadequate in preserving the privacy of end users. Specifically, we identify situations where p + -sensitive k -anonymity model is unable to preserve the privacy of individuals when an adversary can identify similarities among the categories of sensitive values. We term such attack as Categorical Similarity Attack (CSA). Thus, we propose a balanced p + -sensitive k -anonymity model, as an extension of the p + -sensitive k -anonymity model. We then formally analyze the proposed model using High-Level Petri Nets (HLPN) and verify its properties using SMT-lib and Z3 solver. We then evaluate the utility of release data using standard metrics and show that our model outperforms its counterparts in terms of privacy vs. utility tradeoff.