PBFT Consensus Algorithm Based Electronic Health Records Sharing Model on Blockchain with Checkable State PROJECT TITLE : Electronic Health Records Sharing Model Based on Blockchain With Checkable State PBFT Consensus Algorithm ABSTRACT: With the increasing adoption of Cloud Computing and Internet of Things devices in the medical industry. The exchange of electronic health records, also known as EHRs, between hospitals and other medical facilities makes medical diagnosis more precise and encourages the growth of public health services. However, it can be challenging to share electronic health records (EHRs) between hospitals, and patients are typically unaware of how their medical records are used. In this article, we propose a system for the sharing of electronic health records (EHRs) that is controlled by the patient and is built on Blockchain technology that collaborates with Cloud Computing. The abstract of the medical study as well as the access protocol are both saved in the Blockchain so that they cannot be altered. We propose the attribute-based encryption scheme and the multi-keyword encryption scheme as methods for encrypting electronic health records in order to achieve fine-grained access control. In addition, we proposed a node-state-checkable Practical Byzantine Fault Tolerance consensus algorithm known as sc-PBFT with the intention of preventing Byzantine nodes from infiltrating the consortium Blockchain. To begin, we will examine the current state of the master node that has been elected to ensure that it does not contain any malicious records. The consensus request that was initially submitted by the customer should then be finished using the pre-prepared, prepare, and commit processes. To conclude, the consensus algorithm that was proposed analyzes the current state of the master node based on the successful conclusion of the three-stage process. This is done in order to lessen the effect that the malicious node has on the entire consortium Blockchain. When you do this, the malicious node will be marked, and then it will be isolated into the area reserved for isolation. The findings of the experiments indicate that the proposed sc-PBFT algorithm has a higher handling capability and a lower consensus latency than previous algorithms. The sc-PBFT algorithm, when compared to the PBFT algorithm in the case of Byzantine nodes, not only improves the robustness of the consortium Blockchain network, but it also improves the capability of handling transactions. Did you like this research project? To get this research project Guidelines, Training and Code... Click Here facebook twitter google+ linkedin stumble pinterest Block Size Optimization for Proof-of-Work Blockchain Applications and End-to-End Latency Analysis Efficacious Constant-Modulus Analog Beamforming Algorithms