3 search results - page 1 / 1 » Fast asynchronous byzantine agreement and leader election wi... |
SODA
2008
ACM
13 years 5 months ago
2008
ACM
We resolve two long-standing open problems in distributed computation by describing polylogarithmic protocols for Byzantine agreement and leader election in the asynchronous full ...
FOCS
2006
IEEE
13 years 10 months ago
2006
IEEE
We consider the problems of Byzantine Agreement and Leader Election, where a constant fraction b < 1/3 of processors are controlled by a malicious adversary. The first problem...
FOCS
2008
IEEE
13 years 10 months ago
2008
IEEE
We design efficient protocols for processors to extract private randomness over a network with Byzantine faults, when each processor has access to an independent weakly-random n-...