Brief Announcement: Be Prepared When Network Goes Bad: An Asynchronous View-Change Protocol

1Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The popularity of permissioned blockchain systems demands BFT SMR protocols that are efficient under good network conditions (synchrony) and robust under bad network conditions (asynchrony). The state-of-the-art partially synchronous BFT SMR protocols provide optimal linear communication cost per decision under synchrony and good leaders, but lose liveness under asynchrony. On the other hand, the state-of-the-art asynchronous BFT SMR protocols are live even under asynchrony, but always pay quadratic cost even under synchrony. In this paper, we propose a BFT SMR protocol that achieves the best of both worlds - optimal linear cost per decision under good networks and leaders, optimal quadratic cost per decision under bad networks, and remains always live.

Cite

CITATION STYLE

APA

Gelashvili, R., Kokoris-Kogias, L., Spiegelman, A., & Xiang, Z. (2021). Brief Announcement: Be Prepared When Network Goes Bad: An Asynchronous View-Change Protocol. In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing (pp. 187–190). Association for Computing Machinery. https://doi.org/10.1145/3465084.3467941

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free