148 search results - page 15 / 30 » Self-stabilization of Byzantine Protocols |
DSN
2003
IEEE
14 years 3 months ago
2003
IEEE
This paper presents a formal model for asynchronous distributed systems with servers that may exhibit Byzantine faults or crash and subsequently recover. The model is computationa...
ICDCS
2010
IEEE
14 years 1 months ago
2010
IEEE
—There are several analytical results on distributed hash tables (DHTs) that can tolerate Byzantine faults. Unfortunately, in such systems, operations such as data retrieval and ...
SOSP
2005
ACM
14 years 6 months ago
2005
ACM
This paper describes a general approach to constructing cooperative services that span multiple administrative domains. In such environments, protocols must tolerate both Byzantin...
SRDS
2005
IEEE
14 years 3 months ago
2005
IEEE
Quorum protocols offer several benefits when used to maintain replicated data but techniques for reducing overheads associated with them have not been explored in detail. It is d...
STOC
2006
ACM
14 years 10 months ago
2006
ACM
We present a randomized Byzantine Agreement (BA) protocol with an expected running time of O(log n) rounds, in a synchronous full-information network of n players. For any constan...