2 search results - page 1 / 1 » An Almost-Surely Terminating Polynomial Protocol for Asynchr... |
CORR
2008
Springer
13 years 4 months ago
2008
Springer
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...
PODC
2009
ACM
14 years 4 months ago
2009
ACM
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...