6 search results - page 1 / 2 » Simple and efficient asynchronous byzantine agreement with o... |
111
Voted
PODC
2009
ACM
16 years 1 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...
94
Voted
WDAG
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. We give randomized agreement algorithms with constant expected running time in asynchronous systems subject to process failures, where up to a minority of processes may f...
81
Voted
OPODIS
2004
15 years 2 months ago
2004
Consider an asynchronous system where each process begins with an arbitrary real value. Given some fixed > 0, an approximate agreement algorithm must have all non-faulty process...
88
Voted
CORR
2008
Springer
15 years 1 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...
110
Voted
OPODIS
2010
14 years 11 months ago
2010
: Provide application processes with strong agreement guarantees despite failures is a fundamental problem of fault-tolerant distributed computing. Correct processes have not to be...