BEAT: Asynchronous BFT Made Practical

被引：101

作者：

Duan, Sisi ^{[1
]}

Reiter, Michael K. ^{[2
]}

Zhang, Haibin ^{[1
]}

机构：

[1] UMBC, Baltimore, MD 21250 USA

[2] Univ N Carolina, Chapel Hill, NC USA

来源：

PROCEEDINGS OF THE 2018 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY (CCS'18) | 2018年

关键词：

Byzantine fault tolerance; BFT; asynchronous BFT; blockchain; robustness; threshold cryptography; BYZANTINE FAULT-TOLERANCE; INTERPROCESS COMMUNICATION; CONSENSUS; TIME;

D O I：

10.1145/3243734.3243812

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We present BEAT, a set of practical Byzantine fault-tolerant (BFT) protocols for completely asynchronous environments. BEAT is flexible, versatile, and extensible, consisting of five asynchronous BFT protocols that are designed to meet different goals (e.g., different performance metrics, different application scenarios). Due to modularity in its design, features of these protocols can be mixed to achieve even more meaningful trade-offs between functionality and performance for various applications. Through a 92-instance, five-continent deployment of BEAT on Amazon EC2, we show that BEAT is efficient: roughly, all our BEAT instances significantly outperform, in terms of both latency and throughput, HoneyBadgerBFT, the most efficient asynchronous BFT known.

引用

页码：2028 / 2041

页数：14

共 82 条

[1]

Abd-ElMalek M., SOSP 2005

[2] Charm: a framework for rapidly prototyping cryptosystems [J].

Akinyele, Joseph A. ;

Garman, Christina ;

Miers, Ian ;

Pagano, Matthew W. ;

Rushanan, Michael ;

Green, Matthew ;

Rubin, Aviel D. .

JOURNAL OF CRYPTOGRAPHIC ENGINEERING, 2013, 3 (02) :111-128

[3] Prime: Byzantine Replication under Attack [J].

Amir, Yair ;

Coan, Brian ;

Kirsch, Jonathan ;

Lane, John .

IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2011, 8 (04) :564-577

[4]

Androulaki E, 2014, LECT NOTES COMPUT SC, V8878, P76, DOI 10.1007/978-3-319-14472-6_6

[5]

Androulaki Elli, EUROSYS 2018

[6]

[Anonymous], FAST 2013

[7]

[Anonymous], 1960, J SOC IND APPL MATH

[8]

[Anonymous], 1978, The Theory of Error-Correcting Codes

[9]

[Anonymous], USENIX FAST

[10]

Aublin P-L., ICDCS 2013

← 1 2 3 4 5 6 7 8 9 →