Sciweavers

Share
CORR
2008
Springer
97views Education» more  CORR 2008»
8 years 4 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 pr...
Ittai Abraham, Danny Dolev, Joseph Y. Halpern
WDAG
2004
Springer
105views Algorithms» more  WDAG 2004»
8 years 9 months ago
On Byzantine Agreement over (2, 3)-Uniform Hypergraphs
In a Byzantine agreement protocol, a synchronous network of n interconnected processes of which t may be faulty, starts with an initial binary value associated with each process; a...
D. V. S. Ravikant, Muthuramakrishnan Venkitasubram...
books