37 search results - page 3 / 8 » Tolerating Byzantine Faulty Clients in a Quorum System |
DSN
2002
IEEE
13 years 12 months ago
2002
IEEE
In this paper we present two protocols for asynchronous Byzantine Quorum Systems (BQS) built on top of reliable channels—one for self-verifying data and the other for any data. ...
OPODIS
2008
13 years 8 months ago
2008
Probabilistic quorum systems can tolerate a larger fraction of faults than can traditional (strict) quorum systems, while guaranteeing consistency with an arbitrarily high probabi...
DSN
2000
IEEE
13 years 11 months ago
2000
IEEE
Byzantine quorum systems [13] enhance the availability and efficiency of fault-tolerant replicated services when servers may suffer Byzantine failures. An important limitation of...
ICPADS
2008
IEEE
14 years 1 months ago
2008
IEEE
The use of good random numbers is essential to the integrity of many mission-critical systems. However, when such systems are replicated for Byzantine fault tolerance, a serious i...
OPODIS
2010
13 years 4 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...