Sciweavers

Share
CORR
2008
Springer

An Almost-Surely Terminating Polynomial Protocol for Asynchronous Byzantine Agreement with Optimal Resilience

8 years 3 months ago
An Almost-Surely Terminating Polynomial Protocol for Asynchronous Byzantine Agreement with Optimal Resilience
Consider an asynchronous system with private channels and n processes, up to t of which may be faulty. We settle a longstanding open question by providing a Byzantine agreement protocol that simultaneously achieves three properties:
Ittai Abraham, Danny Dolev, Joseph Y. Halpern
Added 09 Dec 2010
Updated 09 Dec 2010
Type Journal
Year 2008
Where CORR
Authors Ittai Abraham, Danny Dolev, Joseph Y. Halpern
Comments (0)
books