结合Schnorr签名的拜占庭容错Raft算法

Sihan Tian, Yun Liu, Yansong Zhang, Yingsi Zhao
{"title":"结合Schnorr签名的拜占庭容错Raft算法","authors":"Sihan Tian, Yun Liu, Yansong Zhang, Yingsi Zhao","doi":"10.1109/IMCOM51814.2021.9377376","DOIUrl":null,"url":null,"abstract":"To optimize the Byzantine fault tolerance of Raft algorithm, a Byzantine fault-tolerant B-Raft algorithm combined with Schnorr signature mechanism is proposed. First, during leader election, followers are required to sign the ballot to prevent the Byzantine node from forging the vote. Second, the client is required to sign the message when sending the message to leader to prevent the Byzantine leader from tampering with the logs. B-Raft combines the signature mechanism with the Raft algorithm and several modifications and additions provide Byzantine fault tolerance. The results of the experiments launched in Hyperledger Fabric show that compared with the Raft algorithm, the safety of B-Raft is greatly improved.","PeriodicalId":275121,"journal":{"name":"2021 15th International Conference on Ubiquitous Information Management and Communication (IMCOM)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A Byzantine Fault-Tolerant Raft Algorithm Combined with Schnorr Signature\",\"authors\":\"Sihan Tian, Yun Liu, Yansong Zhang, Yingsi Zhao\",\"doi\":\"10.1109/IMCOM51814.2021.9377376\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To optimize the Byzantine fault tolerance of Raft algorithm, a Byzantine fault-tolerant B-Raft algorithm combined with Schnorr signature mechanism is proposed. First, during leader election, followers are required to sign the ballot to prevent the Byzantine node from forging the vote. Second, the client is required to sign the message when sending the message to leader to prevent the Byzantine leader from tampering with the logs. B-Raft combines the signature mechanism with the Raft algorithm and several modifications and additions provide Byzantine fault tolerance. The results of the experiments launched in Hyperledger Fabric show that compared with the Raft algorithm, the safety of B-Raft is greatly improved.\",\"PeriodicalId\":275121,\"journal\":{\"name\":\"2021 15th International Conference on Ubiquitous Information Management and Communication (IMCOM)\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-01-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 15th International Conference on Ubiquitous Information Management and Communication (IMCOM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IMCOM51814.2021.9377376\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 15th International Conference on Ubiquitous Information Management and Communication (IMCOM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IMCOM51814.2021.9377376","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

为了优化Raft算法的拜占庭容错性,提出了一种结合Schnorr签名机制的拜占庭容错B-Raft算法。首先,在领导人选举期间,追随者需要在选票上签名,以防止拜占庭节点伪造选票。其次,客户端在向leader发送消息时需要对消息进行签名,以防止拜占庭leader篡改日志。B-Raft将签名机制与Raft算法结合起来,并进行了一些修改和补充,提供了拜占庭式容错。在Hyperledger Fabric上进行的实验结果表明,与Raft算法相比,B-Raft算法的安全性得到了很大的提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A Byzantine Fault-Tolerant Raft Algorithm Combined with Schnorr Signature
To optimize the Byzantine fault tolerance of Raft algorithm, a Byzantine fault-tolerant B-Raft algorithm combined with Schnorr signature mechanism is proposed. First, during leader election, followers are required to sign the ballot to prevent the Byzantine node from forging the vote. Second, the client is required to sign the message when sending the message to leader to prevent the Byzantine leader from tampering with the logs. B-Raft combines the signature mechanism with the Raft algorithm and several modifications and additions provide Byzantine fault tolerance. The results of the experiments launched in Hyperledger Fabric show that compared with the Raft algorithm, the safety of B-Raft is greatly improved.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
On a Partially Verifiable Multi-party Multi-argument Zero-knowledge Proof EnvBERT: Multi-Label Text Classification for Imbalanced, Noisy Environmental News Data Method for Changing Users' Attitudes Towards Fashion Styling by Showing Evaluations After Coordinate Selection The Analysis of Web Search Snippets Displaying User's Knowledge An Energy Management System with Edge Computing for Industrial Facility
×
引用
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