11 search results - page 1 / 3 » podc 2012 |
PODC
2012
ACM
11 years 7 months ago
2012
ACM
PODC
2012
ACM
11 years 7 months ago
2012
ACM
PODC
2012
ACM
11 years 7 months ago
2012
ACM
In recent years, there have been a few proposals to add a small amount of trusted hardware at each replica in a Byzantine fault tolerant system to cut back replication factors. Th...
PODC
2012
ACM
11 years 7 months ago
2012
ACM
This paper proves a necessary and sufficient condition for the existence of iterative algorithms that achieve approximate Byzantine consensus in arbitrary directed graphs, where e...
PODC
2012
ACM
11 years 7 months ago
2012
ACM
Two new algorithms are given for randomized consensus in a shared-memory model with an oblivious adversary. Each is based on a new construction of a conciliator, an object that gu...