4.6 Article

Block-Based Privacy-Preserving Healthcare Data Ranked Retrieval in Encrypted Cloud File Systems

期刊

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/JBHI.2022.3212684

关键词

Encryption; Feature extraction; Privacy; Cloud computing; Medical services; Indexes; Data privacy; Internet of Medical Things; privacy-preserving; searchable encryption; cloud computing

向作者/读者索取更多资源

The Internet of Medical Things (IoMT) is an important application of the Internet of Things in health care. In this study, the authors propose a new Efficient Encrypted Parallel Ranking (EEPR) search system for encrypted cloud healthcare data, addressing the issues of inefficient retrieval and increased privacy risk faced by existing schemes. The proposed system demonstrates better search performance and enhanced privacy protection, and it is resistant to known background attacks, showing significantly improved time complexity and search efficiency compared to existing schemes.
The Internet of Medical Things (IoMT) is an important application of the Internet of Things in health care. In IoMT, efficiency and user privacy are crucial for cloud storage and retrieval of healthcare data documents. Existing schemes, however, often suffer from inefficient retrieval and increased risk of privacy disclosure when dealing with massive data. We propose here a new Efficient Encrypted Parallel Ranking (EEPR) search system, block-based and privacy-preserved, for encrypted cloud healthcare data. We design a parallel binary search tree structure in block and propose a parallel retrieval algorithm adaptable to such a structure. A quantitative analysis through the information retention index shows that our scheme demonstrates better search performance. In addition, feature vectors generated from our scheme are difficult to be reversely analyzed due to unexplainability, enhancing privacy protection for patients and researchers. A formal security analysis shows that our EEPR scheme is resistable to known background attack, and yields a lower time complexity and significantly improves search efficiency as well as accuracy over existing schemes.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据