On the number of authenticated rounds in Byzantine Agreement

DOI10.1007/bfb0022150zbMath1524.68024OpenAlexW1563958629MaRDI QIDQ6084559

Malte Borcherding

Publication date: 1 December 2023

Published in: Distributed Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0022150

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items

Authenticated Byzantine Generals in Dual Failure Model

Cites Work

• A lower bound for the time to assure interactive consistency
• Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement
• Authenticated Algorithms for Byzantine Agreement
• The Byzantine Generals Problem