@inproceedings{10553,
  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.},
  author       = {Gelashvili, Rati and Kokoris Kogias, Eleftherios and Spiegelman, Alexander and Xiang, Zhuolun},
  booktitle    = {Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing},
  isbn         = {9-781-4503-8548-0},
  keywords     = {optimal, state machine replication, fallback, asynchrony, byzantine faults},
  location     = {Virtual, Italy},
  pages        = {187--190},
  publisher    = {Association for Computing Machinery},
  title        = {{Brief announcement: Be prepared when network goes bad: An asynchronous view-change protocol}},
  doi          = {10.1145/3465084.3467941},
  year         = {2021},
}