BEAT: Asynchronous BFT made practical

Sisi Duan; Michael K. Reiter; Haibin Zhang

doi:10.1145/3243734.3243812

BEAT: Asynchronous BFT made practical

Sisi Duan, Michael K. Reiter, Haibin Zhang

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

155 Citations (Scopus)

Abstract

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.

Original language	English
Title of host publication	CCS 2018 - Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security
Publisher	Association for Computing Machinery
Pages	2028-2041
Number of pages	14
ISBN (Electronic)	9781450356930
DOIs	https://doi.org/10.1145/3243734.3243812
Publication status	Published - 15 Oct 2018
Externally published	Yes
Event	25th ACM Conference on Computer and Communications Security, CCS 2018 - Toronto, Canada Duration: 15 Oct 2018 → …

Publication series

Name	Proceedings of the ACM Conference on Computer and Communications Security
ISSN (Print)	1543-7221

Conference

Conference	25th ACM Conference on Computer and Communications Security, CCS 2018
Country/Territory	Canada
City	Toronto
Period	15/10/18 → …

Keywords

Asynchronous BFT
BFT
Blockchain
Byzantine fault tolerance
Robustness
Threshold cryptography

Access to Document

10.1145/3243734.3243812

Cite this

Duan, S., Reiter, M. K., & Zhang, H. (2018). BEAT: Asynchronous BFT made practical. In CCS 2018 - Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security (pp. 2028-2041). (Proceedings of the ACM Conference on Computer and Communications Security). Association for Computing Machinery. https://doi.org/10.1145/3243734.3243812

@inproceedings{8b55d883382c48cc92c80126ffcad87e,

title = "BEAT: Asynchronous BFT made practical",

abstract = "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.",

keywords = "Asynchronous BFT, BFT, Blockchain, Byzantine fault tolerance, Robustness, Threshold cryptography",

author = "Sisi Duan and Reiter, {Michael K.} and Haibin Zhang",

note = "Publisher Copyright: {\textcopyright} 2018 Association for Computing Machinery.; 25th ACM Conference on Computer and Communications Security, CCS 2018 ; Conference date: 15-10-2018",

year = "2018",

month = oct,

day = "15",

doi = "10.1145/3243734.3243812",

language = "English",

series = "Proceedings of the ACM Conference on Computer and Communications Security",

publisher = "Association for Computing Machinery",

pages = "2028--2041",

booktitle = "CCS 2018 - Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security",

}

Duan, S, Reiter, MK & Zhang, H 2018, BEAT: Asynchronous BFT made practical. in CCS 2018 - Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security. Proceedings of the ACM Conference on Computer and Communications Security, Association for Computing Machinery, pp. 2028-2041, 25th ACM Conference on Computer and Communications Security, CCS 2018, Toronto, Canada, 15/10/18. https://doi.org/10.1145/3243734.3243812

BEAT: Asynchronous BFT made practical. / Duan, Sisi; Reiter, Michael K.; Zhang, Haibin.
CCS 2018 - Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security. Association for Computing Machinery, 2018. p. 2028-2041 (Proceedings of the ACM Conference on Computer and Communications Security).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - BEAT

T2 - 25th ACM Conference on Computer and Communications Security, CCS 2018

AU - Duan, Sisi

AU - Reiter, Michael K.

AU - Zhang, Haibin

PY - 2018/10/15

Y1 - 2018/10/15

N2 - 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.

AB - 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.

KW - Asynchronous BFT

KW - BFT

KW - Blockchain

KW - Byzantine fault tolerance

KW - Robustness

KW - Threshold cryptography

UR - http://www.scopus.com/inward/record.url?scp=85056878521&partnerID=8YFLogxK

U2 - 10.1145/3243734.3243812

DO - 10.1145/3243734.3243812

M3 - Conference contribution

AN - SCOPUS:85056878521

T3 - Proceedings of the ACM Conference on Computer and Communications Security

SP - 2028

EP - 2041

BT - CCS 2018 - Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security

PB - Association for Computing Machinery

Y2 - 15 October 2018

ER -

BEAT: Asynchronous BFT made practical

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this