On the Number of Synchronous Rounds Sufficient for Authenticated Byzantine Agreement

DOI10.1007/978-3-642-04355-0_46zbMath1261.68025OpenAlexW1600012864MaRDI QIDQ3646243

Jesper Buus Nielsen, Matthias Fitzi

Publication date: 19 November 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04355-0_46

Mathematics Subject Classification ID

Distributed systems (68M14) Network protocols (68M12)

Related Items (6)

On the round complexity of randomized Byzantine agreement ⋮ Round-optimal Byzantine agreement ⋮ Synchronous consensus with optimal asynchronous fallback guarantees ⋮ Gossiping for communication-efficient broadcast ⋮ \textsc{Tardigrade}: an atomic broadcast protocol for arbitrary network conditions ⋮ Sublinear-round Byzantine agreement under corrupt majority

This page was built for publication: On the Number of Synchronous Rounds Sufficient for Authenticated Byzantine Agreement