Multicopy provable data possession scheme supporting data dynamics for cloud-based Electronic Medical Record system

被引:43
作者
Zhou, Lei [1 ,2 ]
Fu, Anmin [1 ,2 ]
Mu, Yi [3 ]
Wang, Huaqun [2 ,6 ]
Yu, Shui [4 ]
Sun, Yinxia [5 ]
机构
[1] Nanjing Univ Sci & Technol, Sch Comp Sci & Engn, Nanjing, Peoples R China
[2] Nanjing Univ Posts & Telecommun, Jiangsu Key Lab Big Data Secur & Intelligent Proc, Nanjing, Peoples R China
[3] Fujian Normal Univ, Coll Math & Informat, Fujian Prov Key Lab Network Secur & Cryptol, Fuzhou, Peoples R China
[4] Univ Technol Sydney, Sch Software, Sydney, NSW, Australia
[5] Nanjing Normal Univ, Sch Comp Sci & Technol, Nanjing, Peoples R China
[6] Chinese Acad Sci, Inst Informat Engn, State Key Lab Informat Secur, Beijing, Peoples R China
基金
中国国家自然科学基金;
关键词
Cloud storage; Electronic Medical Record; Privacy preserving; Data dynamics; BIG DATA-STORAGE; EFFICIENT; SECURE; RETRIEVAL;
D O I
10.1016/j.ins.2020.08.031
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In the era of big data, there are several insuperable research challenges in establishing Electronic Medical Record (EMR) for updating massive data with traditional methods. It is an attractive option to create the cloud-based EMR system, since cloud provides elastic and affordable data storage and management services. However, once the medical records are uploaded into the cloud, the owner will lose the control over the data, and sensitive contents might be accessed or modified by unauthorized entities. To address this issue, we propose a multicopy provable data possession for cloud-based EMR systems, which ensures the integrity and privacy of EMR data. In particular, to achieve data updates, we design a novel dynamic structure that improves the Merkle Hash Tree for multicopy storage, which achieves full dynamics efficiently and safely. Moreover, a random masking technique is employed in our proposal to generate distinguishable replica blocks of one block. Our construction prevents a verifier from obtaining medical records from challenge responses, but also eliminates exposing the content to unauthorized entities. Our security analysis shows that our scheme is provably secure. Evaluation experiments demonstrate that the proposal has lower communication and computation costs in comparison with the existing schemes. (C) 2020 Elsevier Inc. All rights reserved.
引用
收藏
页码:254 / 276
页数:23
相关论文
共 50 条
  • [1] Aboalian A., CONCURRENCY COMPUTAT, V29
  • [2] Ateniese G., 2008, P 4 INT C SEC PRIV C, P1, DOI 10.1145/1460877.1460889
  • [3] Ateniese G, 2007, CCS'07: PROCEEDINGS OF THE 14TH ACM CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, P598
  • [4] Barsoum A.F., 2012, INTEGRITY VERIFICATI, P829
  • [5] Provable Multicopy Dynamic Data Possession in Cloud Computing Systems
    Barsoum, Ayad F.
    Hasan, M. Anwar
    [J]. IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2015, 10 (03) : 485 - 497
  • [6] Benaloh Josh., 2009, P 2009 ACM WORKSHOP, P103
  • [7] Cloud based security on outsourcing using blockchain in E-health systems
    Benil, T.
    Jasper, J.
    [J]. COMPUTER NETWORKS, 2020, 178
  • [8] Blockchain-Based Dynamic Provable Data Possession for Smart Cities
    Chen, Ruonan
    Li, Yannan
    Yu, Yong
    Li, Huilin
    Chen, Xiaofeng
    Susilo, Willy
    [J]. IEEE INTERNET OF THINGS JOURNAL, 2020, 7 (05) : 4143 - 4154
  • [9] AKSER: Attribute-based keyword search with efficient revocation in cloud computing
    Cui, Jie
    Zhou, Han
    Zhong, Hong
    Xu, Yan
    [J]. INFORMATION SCIENCES, 2018, 423 : 343 - 352
  • [10] MR-PDP: Multiple-Replica Provable Data Possession
    Curtmola, Reza
    Khan, Osama
    Burns, Randal
    Ateniese, Giuseppe
    [J]. 28TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, VOLS 1 AND 2, PROCEEDINGS, 2008, : 411 - +