周炜,袁晓伟,魏志强,翟翌立,王超,杜丙瑜,朱文印,王金龙

• 1:青岛理工大学信息与控制工程学院
• 2:海尔集团技术研发中心
• 3:中国海洋大学信息科学与工程学院

摘要(Abstract)：

拜占庭容错(BFT)在提供分布式系统的可靠性方面将变得越来越重要,其中实用性拜占庭容错(PBFT)是目前用的最佳算法之一,但是面对具有众多节点的分布式系统,PBFT并不令人满意。由于PBFT共识失败率接近1/3,共识失败率较高会造成主节点切换频繁,拖慢共识效率,概率分组算法降低了共识失败率,从而提高了共识效率。为了防止拜占庭节点串通攻击分组,基于可验证随机函数VRF抽签方式让拜占庭节点无法预判分组,进一步提高共识安全性。混合共识机制组内采用拜占庭容错chain-raft加快共识效率,组间采用PBFT保证对现有PBFT共识的兼容性。本文提出的共识机制在16个节点分为四组的情况下消息复杂度比PBFT降低了92%,吞吐量是PBFT的3.6倍。

关键词(KeyWords)： 实用拜占庭容错;联盟链;分组混合共识;概率分组;随机分组

Abstract:

Keywords:

基金项目(Foundation): 国家自然科学基金项目(61502262);; 青岛市博士后应用研究项目资助~~

作者(Author): 周炜,袁晓伟,魏志强,翟翌立,王超,杜丙瑜,朱文印,王金龙

参考文献(References)：

• [1]Sateshi N.Bitcoin:peer-to-peer electronic cash system[J].Consulted,2008(1):28．
• [2]King S,Nadal S.Ppcoin:Peer-to-peer crypto-currency with proofof-stake[J].self-published paper,August,2012,19:1．
• [3]Buterin V,Griffith V.Casper the friendly finality gadget[J].arXiv preprint arXiv,1710.09437．
• [4]Bentov I,Lee C,Mizrahi A,et al.Proof of activity:Extending bitcoin’s proof of work via proof of stake[extended abstract]y[J].Evaluation Review,2014,42(3):34-37．
• [5]Wang W,Hoang D T,Hu P,et al.A survey on consensus mechanisrhs and mining strategy management in blockchain networks[J].IEEE Access,2019,7:22328-22370．
• [6]Lamport L.Paxos made simple[J].ACM Sigact News,2001,32(4):18-25．
• [7]Ongaro D,Ousterhout J.In Search of an Understandable Consensus Algorithm[C].[s.l.]:2014{USENIX}Annual Technical Conference（{USENIX}{ATC}14).2014:305-319．
• [8]Castro M,Liskov B.Practical Byzantine fault tolerance[J].OSDI,1999,99:173-186．
• [9]Van Renesse R,Schneider F B.Chain Replication for Supporting High Throughput and Availability[J].OSDI,2004,(4):91-104．
• [10]Vvkolic′M.Rethinking Permissioned blockchanis[C].Proceedings of the ACM Workshop on Blackchain,Cryptocurrencies and Contracts,2017:3-7．
• [11]Bessani A,Sousa J,Alchieri E E P.State machine replication for the masses with BFT-SMART[C].IEEE:2014 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks,2014:355-362．
• [12]Abd-El-Malek M,Ganger G R,Goodson G R,et al.Fault-scalable Byzantine fault-tolerant services[J].ACM SIGOPS Operating Systems Review,2005,39(5):59-74．
• [13]Cowling J,Myers D,Liskov B,et al.HQ replication:A hybrid quorum protocol for Byzantine fault tolerance[C].[s.l.]:Proceedings of the 7th symposium on Operating systems design and implementation,2006:177-190．
• [14]Aublin P L,Guerraoui R,Kne6evic'N,et al.The next 700BFTprotocols[J].ACM Transactions on Computer Systems(TOCS),2015,32(4):1-45．
• [15]Kotla R,Alvisi L,Dahlin M,et al.Zyzzyva:Speculative byzantine fault tolerance[C].[s.l.]:Proceedings of twenty-first ACMSIGOPS symposium on Operating systems principles,2007:45-58．
• [16]Singh A,Fonseca P,Kuznetsov P,et al.Zeno:Eventually Consistent Byzantine-Fault Tolerance[C].NSDI,2009,9:169-184．
• [17]Wood T,Singh R,Venkataramani A,et al.ZZ and the art of practical BFT execution[C].[s.l.]:Proceedings of the sixth conference on Computer systems,2011:123-138．
• [18]Shoker A,Bahsoun J P,Yabandeh M.Improving independence of failures in bft[C].IEEE:2013IEEE 12th International Symposium on Network Computing and Applications,2013:227-234．
• [19]Kapitza R,Behl J,Cachin C,et al.CheapBFT:Resource-efficient byzantine fault tolerance[C].[s.l.]:Proceedings of the 7th ACMeuropean conference on Computer Systems,2012:295-308．
• [20]Hendricks J,Sinnamohideen S,Ganger G R,et al.Zzyzx:Scalable fault tolerance through Byzantine locking[C].IEEE:2010IEEE/IFIP International Conference on Dependable Systems&Networks(DSN),2010:363-372．
• [21]Fan J,Yi L T,Shu J W.Research on the technologies of Byzantine system[J].Journal of Software,2013,24(6):1346-1360．
• [22]Clement A,Wong E L,Alvisi L,et al.Making byzantine fault tolerant systems tolerate byzantine faults[J].NSDI,2009,9:153-168．
• [23]Amir Y,Coan B,Kirsch J,et al.Prime:Byzantine replication under attack[J].IEEE Transactions on Dependable and Secure Computing,2010,8(4):564-577．
• [24]Veronese G S,Correia M,Bessani A N,et al.Spin one’s wheels?Byzantine fault tolerance with a spinning primary[C].IEEE:2009 28th IEEE International Symposium on Reliable Distributed Systems,2009:135-144．
• [25]Aublin P L,Mokhtar S B,Quéma V.Rbft:Redundant byzantine fault tolerance[C].IEEE:2013IEEE 33rd International Conference on Distributed Computing Systems,2013:297-306．
• [26]Tschorsch F,Schevemann B.Bitcon and beyond:Atechnical survey on decentralized digital currencies[J].IEEE Communications Surveys&Tutorials,2016,18(3):2084-2123．
• [27]Aggarwal S,Challdhary R,Avjla G S,et al.Blockchain for smart communities:Applications,challenges and opportunities[J].Journal of Network and Computer Applications,2019,144:13-48．
• [28]Bvchpom E.Tendermint:Byzantime fance tolerance in the age of blockchains(2016)[J].Query date,2018(2):2-26．
• [29]Innerbichler J,Darnjanovic-Behrendt V.Federated byzantine agreement to ensure trustworthiness of digital mannfacturing platforms[C].[s.l.]:Proceedings of the Ist Workshop on Crypeocurrencies and Blockchains for Distributed Systems,2018:111-116．
• [30]Team Z.The zilliqa technical whitepaper[J].Retrieved September,2017,16:2019．
• [31]Micali S,Rabin M,Vadhan S.Verifiable random functions[C].IEEE:40th annual symposium on foundations of computer science(cat.No.99CB37039),1999:120-130．
• [32]Miller A,Xia Y,Croman K,et al.The honey badger of BFT protocols[C].[s.l.]:Proceedings of the 2016ACM SIGSAC Conference on Computer and Communications Security,2016:31-42．
• [33]Yin M,Malkhi D,Reiter M K,et al.Hotstuff:Bft consensus in the lens of blockchain[J].arXiv preprint arXiv 1803.05069.

文章评论(Comment)：