Fast Asynchronous Byzantine Agreement with Optimal Resilience (1998)
by
Ran Canetti
,
Tal Rabin
| Citations: | 57 - 0 self |
BibTeX
@MISC{Canetti98fastasynchronous,
author = {Ran Canetti and Tal Rabin},
title = {Fast Asynchronous Byzantine Agreement with Optimal Resilience},
year = {1998}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
It is known that, in both asynchronous and synchronous networks, no Byzantine Agreement (BA) protocol for n players exists if d e of the players are faulty (in other words, no BA protocol is d e-resilient). The only known asynchronous (d e \Gamma 1)-resilient BA protocol runs in expected exponential time, and the best resilience achieved by an asynchronous protocol with polynomial complexity is (d 4 e \Gamma 1). The question whether there exists an asynchronous (d BA protocol with polynomial complexity remained open.
