Red Belly: A Secure, Fair and Scalable Open Blockchain

被引:67
作者
Crain, Tyler [1 ]
Natoli, Christopher [1 ]
Gramoli, Vincent [1 ,2 ]
机构
[1] Univ Sydney, Sydney, NSW, Australia
[2] CSIRO, Sydney, NSW, Australia
来源
2021 IEEE SYMPOSIUM ON SECURITY AND PRIVACY, SP | 2021年
基金
澳大利亚研究理事会;
关键词
CONSENSUS; AGREEMENT;
D O I
10.1109/SP40001.2021.00087
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Blockchain has found applications to track ownership of digital assets. Yet, several blockchains were shown vulnerable to network attacks. It is thus crucial for companies to adopt secure blockchains before moving them to production. In this paper, we present Red Belly Blockchain (RBBC), the first secure blockchain whose throughput scales to hundreds of geodistributed consensus participants. To this end, we drastically revisited Byzantine Fault Tolerant (BFT) blockchains through three contributions: (i) defining the Set Byzantine Consensus problem of agreeing on a superblock of all proposed blocks instead of a single block; (ii) adopting a fair leaderless design to offer censorship-resistance guaranteeing the commit of correctly requested transactions; (iii) introducing sharded verification to limit the number of signature verifications without hampering security. We evaluate RBBC on up to 1000 VMs of 3 different types, spread across 4 continents, and under attacks. Although its performance is affected by attacks, RBBC scales in that its throughput increases to hundreds of consensus nodes and achieves 30k TPS throughput and 3 second latency on 1000 VMs, hence improving by 3x both the latency and the throughput of its closest competitor.
引用
收藏
页码:466 / 483
页数:18
相关论文
共 93 条
[61]   Inclusive Block Chain Protocols [J].
Lewenberg, Yoad ;
Sompolinsky, Yonatan ;
Zohar, Aviv .
FINANCIAL CRYPTOGRAPHY AND DATA SECURITY (FC 2015), 2015, 8975 :528-547
[62]   Fast and secure global payments with Stellar [J].
Lokhava, Marta ;
Losa, Giuliano ;
Mazieres, David ;
Hoare, Graydon ;
Barry, Nicolas ;
Gafni, Eli ;
Jove, Jonathan ;
Malinowsky, Rafal ;
McCaleb, Jed .
PROCEEDINGS OF THE TWENTY-SEVENTH ACM SYMPOSIUM ON OPERATING SYSTEMS PRINCIPLES (SOSP '19), 2019, :80-96
[63]  
Losa Giuliano, 2020, 2 WORKSH FORM METH B
[64]   A Secure Sharding Protocol For Open Blockchains [J].
Luu, Loi ;
Narayanan, Viswesh ;
Zheng, Chaodong ;
Baweja, Kunal ;
Gilbert, Seth ;
Saxena, Prateek .
CCS'16: PROCEEDINGS OF THE 2016 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2016, :17-30
[65]  
Mao Yanhua, 2009, PROC 5 WORKSHOP HOT
[66]  
Miller A., 2016, P 2016 ACM SIGSAC C, P31
[67]   Bounded Delay in Byzantine-Tolerant State Machine Replication [J].
Milosevic, Zarko ;
Biely, Martin ;
Schiper, Andre .
2013 IEEE 32ND INTERNATIONAL SYMPOSIUM ON RELIABLE DISTRIBUTED SYSTEMS (SRDS 2013), 2013, :61-70
[68]   There Is More Consensus in Egalitarian Parliaments [J].
Moraru, Iulian ;
Andersen, David G. ;
Kaminsky, Michael .
SOSP'13: PROCEEDINGS OF THE TWENTY-FOURTH ACM SYMPOSIUM ON OPERATING SYSTEMS PRINCIPLES, 2013, :358-372
[69]   Signature-Free Asynchronous Byzantine Consensus with t < n/3 and O(n2) Messages [J].
Mostefaoui, Achour ;
Moumen, Hamouma ;
Raynal, Michel .
PROCEEDINGS OF THE 2014 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC'14), 2014, :2-9
[70]   Signature-Free Asynchronous Binary Byzantine Consensus with t < n/3, O(n2) Messages, and O(1) Expected Time [J].
Mostefaoui, Achour ;
Moumen, Hamouma ;
Raynal, Michel .
JOURNAL OF THE ACM, 2015, 62 (04)