Sciweavers

Share
SODA
2008
ACM

Fast asynchronous byzantine agreement and leader election with full information

8 years 11 months ago
Fast asynchronous byzantine agreement and leader election with full information
We resolve two long-standing open problems in distributed computation by describing polylogarithmic protocols for Byzantine agreement and leader election in the asynchronous full information model with a nonadaptive malicious adversary. All past protocols for asynchronous Byzantine Agreement had been exponential, and no protocol for asynchronous leader election had been known. Our protocols tolerate up to n 6+ faulty processors, for any positive constant . They are Monte Carlo, succeeding with probability 1 - o(1) for Byzantine agreement, and constant probability for leader election. A key technical contribution of our paper is a new approach for emulating Feige's lightest bin protocol, even with adversarial message scheduling.
Bruce M. Kapron, David Kempe, Valerie King, Jared
Added 30 Oct 2010
Updated 30 Oct 2010
Type Conference
Year 2008
Where SODA
Authors Bruce M. Kapron, David Kempe, Valerie King, Jared Saia, Vishal Sanwalani
Comments (0)
books