实用拜占庭容错共识算法在医疗信息泄露防控及共享中的研究与应用

Research and application of Byzantine fault-tolerant consensus algorithm in prevention and sharing of medical information leakage

摘要:

目前电子病历在多客户端数据共享上依然存在分享困难和患者隐私无法保护等的问题,因此医疗信息泄露防控及共享问题迫在眉睫；为了解决该问题对PBFT算法进行了分析,以此提出了afBFT共识算法,并对其有效性进行了验证；实验结果表明,连续运行时可插拔共识算法(Pluggable Consensus based on PBFT,CPBFT)算法和拜占庭容错算法(Practical Byzantine Fault Tolerance,PBFT)算法的通信量的平均值十分相近,而afBFT共识算法的通信量平均值为3.47千字节,比PBFT算法高14.1%左右,但处于可接受的范围内；同时出块时间的平均值可以稳定在2.4s左右；而在遭受攻击后afBFT共识算法表明出较强的抗预测攻击的能力,同时将其应用在实际方案中使得数据加密与搜索的时间处于较低的范围,分别为350ms内和140ms内；综合来看,提出的afBFT共识算法在电子病历管理应用上具备有效性,其对保障多客户端医疗信息共享安全性具有重要意义。

Abstract:

At present, electronic medical records still face difficulties in sharing data on multiple clients and the inability to protect patient privacy. Therefore, the prevention and control of medical information leakage and sharing issues are urgent; In order to solve this problem, the PBFT algorithm was analyzed and the afBFT consensus algorithm was proposed, and its effectiveness was verified; The experimental results show that the average traffic of the Pluggable Consensus based on PBFT (CPBFT) algorithm and the Practical Byzantine Fault Tolerance (PBFT) algorithm during continuous operation is very similar, while the average traffic of the afBFT consensus algorithm is 3.47 kilobytes, which is about 14.1% higher than the PBFT algorithm, but within an acceptable range; The average value of simultaneous block out time can be stable at around 2.4 s; After being attacked, the afBFT consensus algorithm showed strong resistance to predictive attacks, and its application in practical solutions resulted in lower data encryption and search times, within 350ms and 140ms, respectively; Overall, the proposed afBFT consensus algorithm is effective in electronic medical record management applications, and it is of great significance in ensuring the security of multi client medical information sharing.