Revisiting asynchronous fault tolerant computation with optimal resilience

DOI10.1007/s00446-021-00416-4OpenAlexW4226228654MaRDI QIDQ2166363

Gilad Stern, Ittai Abraham, Danny Dolev

Publication date: 24 August 2022

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

Full work available at URL: https://arxiv.org/abs/2006.16686

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Cites Work

• Easy impossibility proofs for distributed consensus problems
• Asynchronous byzantine agreement protocols
• An almost-surely terminating polynomial protocol for asynchronous byzantine agreement with optimal resilience
• Impossibility of distributed consensus with one faulty process
• Asynchronous Computational VSS with Reduced Communication Complexity
• Asymptotically Optimal Validated Asynchronous Byzantine Agreement
• Distributed computing meets game theory
• Fast asynchronous Byzantine agreement with optimal resilience
• Asynchronous secure computation
• Asynchronous secure computations with optimal resilience (extended abstract)

This page was built for publication: Revisiting asynchronous fault tolerant computation with optimal resilience