219 search results - page 13 / 44 » Byzantine Quorum Systems |
JSAC
2010
13 years 8 months ago
2010
Abstract—Random linear network coding can be used in peerto-peer networks to increase the efficiency of content distribution and distributed storage. However, these systems are ...
WDAG
2007
Springer
14 years 4 months ago
2007
Springer
We present the first optimally resilient, bounded, wait-free implementation of a distributed atomic register, tolerating Byzantine readers and (up to one-third of) Byzantine serve...
LADC
2011
Springer
13 years 22 days ago
2011
Springer
Abstract—Replication is a well-established approach to increasing database availability. Many database replication protocols have been proposed for the crash-stop failure model, ...
EUROCRYPT
1998
Springer
14 years 2 months ago
1998
Springer
Abstract. This paper describes e cient protocols for multi-party computations that are information-theoretically secure against passive attacks. The results presented here apply to...
JISE
2000
13 years 9 months ago
2000
methods. If a pair of methods op1 and op2 are compatible, the summation of the quorum numbers of op1 and op2 can be smaller than the number of replicas in the QOL protocol even if ...