Synchronous consensus with optimal asynchronous fallback guarantees
Published in TCC '19: Theory of Cryptography Conference, 2019
This is the first paper in a line of work on network-agnostic protocols: protocols that are secure for up to \(t_s\) corruptions when the network happens to be synchronous, and still provide “fallback” security for a lower threshold of \(t_a\) corruptions when the network is asynchronous. The original paper focuses on Byzantine agreement, with follow-up work extending our techniques to secure multiparty computation (Blum, Liu-Zhang, and Loss, CRYPTO ‘20) and state machine replication (Blum, Katz, and Loss, Asiacrypt ‘21).