Fully polynomial Byzantine agreement in t + 1 rounds

DOI10.1145/167088.167101zbMath1310.68040OpenAlexW1990071731MaRDI QIDQ5248469

Juan A. Garay, Yoram Moses

Publication date: 7 May 2015

Published in: Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/167088.167101

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (8)

On the round complexity of randomized Byzantine agreement ⋮ Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party ⋮ Gossiping for communication-efficient broadcast ⋮ Completeness theorems for adaptively secure broadcast ⋮ On the impact of link faults on Byzantine agreement ⋮ Must the communication graph of MPC protocols be an expander? ⋮ Player-Centric Byzantine Agreement ⋮ Efficient agreement using fault diagnosis.

This page was built for publication: Fully polynomial Byzantine agreement in t + 1 rounds