Synchronous Byzantine agreement with expected \(O(1)\) rounds, expected \(O(n^2)\) communication, and optimal resilience

DOI10.1007/978-3-030-32101-7_20zbMath1460.94033OpenAlexW2980108059MaRDI QIDQ2656912

Danny Dolev, Srinivas Devadas, Ling Ren, Kartik Nayak, Ittai Abraham

Publication date: 17 March 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-32101-7_20

Related Items (12)

On the round complexity of randomized Byzantine agreement ⋮ Round-optimal Byzantine agreement ⋮ Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party ⋮ Asymptotically free broadcast in constant expected time via packed VSS ⋮ State machine replication under changing network conditions ⋮ \textsc{Tardigrade}: an atomic broadcast protocol for arbitrary network conditions ⋮ Permissionless clock synchronization with public setup ⋮ Completeness theorems for adaptively secure broadcast ⋮ Communication complexity of Byzantine agreement, revisited ⋮ Sublinear-round Byzantine agreement under corrupt majority ⋮ How Byzantine is a send corruption? ⋮ Making Byzantine consensus live

This page was built for publication: Synchronous Byzantine agreement with expected \(O(1)\) rounds, expected \(O(n^2)\) communication, and optimal resilience