Improved Blockchain Consensus Mechanism Based on PBFT Algorithm

Ge Yu, Bin Wu, Xinxin Niu
{"title":"Improved Blockchain Consensus Mechanism Based on PBFT Algorithm","authors":"Ge Yu, Bin Wu, Xinxin Niu","doi":"10.1109/CTISC49998.2020.00009","DOIUrl":null,"url":null,"abstract":"Practical Byzantine Fault Tolerance (PBFT) is a blockchain consensus mechanism that is widely used at present, but the confidence of blockchain node in PBFT cannot be guaranteed, and a large amount of communication resources will be consumed in the process of reaching consensus. The paper proposes a new consensus mechanism, namely the Dynamic Grouping Byzantine Fault Tolerance Mechanism (DGBFT) based on confidence. The principles of DGBFT are as follows: 1) By extending the node’s attributes with the confidence, and designing a mechanism to evaluate the node’s confidence, therefore, the confidence adjustment and grouping adjustment can be performed on the nodes in the system. By grouping the confidence nodes by the confidence group, the communication complexity is greatly reduced, and the malicious nodes can be effectively excluded. Finally, the experimental results show that the blockchain applying the improved mechanism can significantly improve the communication efficiency of the system and the overall confidence of the system.","PeriodicalId":266384,"journal":{"name":"2020 2nd International Conference on Advances in Computer Technology, Information Science and Communications (CTISC)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 2nd International Conference on Advances in Computer Technology, Information Science and Communications (CTISC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CTISC49998.2020.00009","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13

Abstract

Practical Byzantine Fault Tolerance (PBFT) is a blockchain consensus mechanism that is widely used at present, but the confidence of blockchain node in PBFT cannot be guaranteed, and a large amount of communication resources will be consumed in the process of reaching consensus. The paper proposes a new consensus mechanism, namely the Dynamic Grouping Byzantine Fault Tolerance Mechanism (DGBFT) based on confidence. The principles of DGBFT are as follows: 1) By extending the node’s attributes with the confidence, and designing a mechanism to evaluate the node’s confidence, therefore, the confidence adjustment and grouping adjustment can be performed on the nodes in the system. By grouping the confidence nodes by the confidence group, the communication complexity is greatly reduced, and the malicious nodes can be effectively excluded. Finally, the experimental results show that the blockchain applying the improved mechanism can significantly improve the communication efficiency of the system and the overall confidence of the system.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于PBFT算法的改进区块链共识机制
实用拜占庭容错(Practical Byzantine Fault Tolerance, PBFT)是目前广泛使用的区块链共识机制,但区块链节点在PBFT中的置信度无法保证,在达成共识的过程中会消耗大量的通信资源。提出了一种新的共识机制,即基于置信度的动态分组拜占庭容错机制(DGBFT)。DGBFT的原理如下:1)通过对节点属性进行置信度扩展,并设计节点置信度评估机制,从而对系统中的节点进行置信度调整和分组调整。通过将信任节点按信任组分组,大大降低了通信复杂度,有效地排除了恶意节点。最后,实验结果表明,采用改进机制的区块链可以显著提高系统的通信效率和系统的整体置信度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Neurons identification of single-photon wide-field calcium fluorescent imaging data CTISC 2020 List Reviewer Page CTISC 2020 Commentary Image data augmentation method based on maximum activation point guided erasure Sponsors and Supporters: CTISC 2020
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1