On the round complexity of randomized Byzantine agreement
From MaRDI portal
Publication:6487529
DOI10.4230/LIPICS.DISC.2019.12zbMath1515.68062MaRDI QIDQ6487529
Nikolaos Makriyannis, Alex Samorodnitsky, Matan Orland, Ran Cohen, Iftach Haitner
Publication date: 3 February 2023
Cryptography (94A60) Distributed systems (68M14) Randomized algorithms (68W20) Network protocols (68M12)
Related Items (6)
On the round complexity of randomized Byzantine agreement ⋮ Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party ⋮ Distributed CONGEST Algorithms against Mobile Adversaries ⋮ Round-preserving parallel composition of probabilistic-termination cryptographic protocols ⋮ Sublinear-round Byzantine agreement under corrupt majority ⋮ Broadcast-optimal two-round MPC
This page was built for publication: On the round complexity of randomized Byzantine agreement
