Privacy for Healthcare Data Using the Byzantine Consensus Method

The Healthcare Byzantine consensus method (HBFT) has poor scalability, arbitrary master node selection, and high network overhead in the healthcare scenario. This research constructs and proposes an optimized Byzantine consensus algorithm for the alliance chain. First, create roles for nodes in the cluster, provide them additional permissions based on their responsibilities, and build a dynamic network access method for nodes with various permissions. Second, reputation-based voting and FTS are meant for production node selection. The tree-combined voting algorithm assures election security and fairness. Finally, the HBFT consensus mechanism is optimized, reducing network overhead. The suggested POC consensus algorithm has high features dynamics, election security, and minimal overhead when compared to the HBFT algorithm.

Automated summary

This research proposes an optimized Byzantine consensus algorithm for the healthcare scenario, addressing the scalability, arbitrary master node selection, and high network overhead issues in the Healthcare Byzantine consensus method (HBFT). It introduces roles and additional permissions for nodes, reputation-based voting and the FTS algorithm for node selection, and a tree-combined voting algorithm for election security and fairness. The optimized HBFT consensus mechanism reduces network overhead. The suggested POC consensus algorithm has high features dynamics, election security, and minimal overhead compared to HBFT.