Semantic privacy-preserving framework for electronic health record linkage

被引:11
|
作者
Lu, Yang [1 ]
Sinnott, Richard O. [1 ]
机构
[1] Univ Melbourne, Comp & Informat Syst, Melbourne, Vic 3010, Australia
关键词
BUSINESS INTELLIGENCE; ACCESS;
D O I
10.1016/j.tele.2017.06.007
中图分类号
G25 [图书馆学、图书馆事业]; G35 [情报学、情报工作];
学科分类号
1205 ; 120501 ;
摘要
The combination of digitized health information and web-based technologies offers many possibilities for data analysis and business intelligence. In the healthcare and biomedical research domain, applications depending on electronic health records (EHRs) identify privacy preservation as a major concern. Existing solutions cannot always satisfy the evolving research demands such as linking patient records across organizational boundaries due to the potential for patient re-identification. In this work, we show how semantic methods can be applied to support the formulation and enforcement of access control policy whilst ensuring that privacy leakage can be detected and prevented. The work is illustrated through a case study associated with the Australasian Diabetes Data Network (ADDN www.addn.org.au), the national paediatric type-1 diabetes data registry, and the Australian Urban Research Infrastructure Network (AURIN - www.aurin.org.au) platform that supports Australia-wide access to urban and built environment data sets. We demonstrate that through extending the eXtensible Access Control Markup Language (XACML) with semantic capabilities, finer-grained access control encompassing data risk disclosure mechanisms can be supported. We discuss the contributions that can be made using this approach to socio-economic development and political management within business systems, and especially those situations where secure data access and data linkage is required. (C) 2017 Elsevier Ltd. All rights reserved.
引用
收藏
页码:737 / 752
页数:16
相关论文
共 50 条
  • [1] Privacy-Preserving Access Control in Electronic Health Record Linkage
    Lu, Yang
    Sinnott, Richard O.
    Verspoor, Kain
    Parampalli, Udaya
    [J]. 2018 17TH IEEE INTERNATIONAL CONFERENCE ON TRUST, SECURITY AND PRIVACY IN COMPUTING AND COMMUNICATIONS (IEEE TRUSTCOM) / 12TH IEEE INTERNATIONAL CONFERENCE ON BIG DATA SCIENCE AND ENGINEERING (IEEE BIGDATASE), 2018, : 1079 - 1090
  • [2] Privacy-Preserving Electronic Health Record Linkage Using Pseudonym Identifiers
    Alhaqbani, Bandar
    Fidge, Colin
    [J]. 2008 10TH IEEE INTERNATIONAL CONFERENCE ON E-HEALTH NETWORKING, APPLICATIONS AND SERVICES, 2008, : 108 - +
  • [3] A scalable privacy-preserving framework for temporal record linkage
    Ranbaduge, Thilina
    Christen, Peter
    [J]. KNOWLEDGE AND INFORMATION SYSTEMS, 2020, 62 (01) : 45 - 78
  • [4] A scalable privacy-preserving framework for temporal record linkage
    Thilina Ranbaduge
    Peter Christen
    [J]. Knowledge and Information Systems, 2020, 62 : 45 - 78
  • [5] A Vulnerability Assessment Framework for Privacy-preserving Record Linkage
    Vidanage, Anushka
    Christen, Peter
    Ranbaduge, Thilina
    Schnell, Rainer
    [J]. ACM TRANSACTIONS ON PRIVACY AND SECURITY, 2023, 26 (03)
  • [6] Privacy-preserving record linkage
    Verykios, Vassilios S.
    Christen, Peter
    [J]. WILEY INTERDISCIPLINARY REVIEWS-DATA MINING AND KNOWLEDGE DISCOVERY, 2013, 3 (05) : 321 - 332
  • [7] Privacy-Preserving Record Linkage
    Hall, Rob
    Fienberg, Stephen E.
    [J]. PRIVACY IN STATISTICAL DATABASES, 2010, 6344 : 269 - +
  • [8] Privacy-Preserving Record Linkage with Spark
    Valkering, Onno
    Belloum, Adam
    [J]. 2019 19TH IEEE/ACM INTERNATIONAL SYMPOSIUM ON CLUSTER, CLOUD AND GRID COMPUTING (CCGRID), 2019, : 440 - 448
  • [9] Privacy-Preserving Temporal Record Linkage
    Ranbaduge, Thilina
    Christen, Peter
    [J]. 2018 IEEE INTERNATIONAL CONFERENCE ON DATA MINING (ICDM), 2018, : 377 - 386
  • [10] FEDERAL: A Framework for Distance-Aware Privacy-Preserving Record Linkage
    Karapiperis, Dimitrios
    Gkoulalas-Divanis, Aris
    Verykios, Vassilios S.
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2018, 30 (02) : 292 - 304