83 search results - page 12 / 17 » Consensus in byzantine asynchronous systems |
CORR
2006
Springer
13 years 7 months ago
2006
Springer
We pose and study the problem of Byzantine-robust topology discovery in an arbitrary asynchronous network. The problem straction of fault-tolerant routing. We formally state the we...
WDAG
2010
Springer
13 years 5 months ago
2010
Springer
Abstract: Due the multiplicity of loci of control, a main issue distributed systems have to cope with lies in the uncertainty on the system state created by the adversaries that ar...
SIAMCOMP
2010
13 years 2 months ago
2010
This paper studies the inherent trade-off between termination probability and total step complexity of randomized consensus algorithms. It shows that for every integer k, the prob...
SIAMCOMP
2010
13 years 2 months ago
2010
We study efficient and robust implementations of an atomic read-write data structure over an asynchronous distributed message-passing system made of reader and writer processes, as...
ICDCS
2009
IEEE
14 years 4 months ago
2009
IEEE
Although distributed key generation (DKG) has been studied for some time, it has never been examined outside of the synchronous setting. We present the first realistic DKG archit...