by Andr� Postma, Thijs Krol, Egbert Molenkamp
University of Twente
http://wwwes.cs.utwente.nl/caes/fade/r/../papers/PRFTS97.ps.gz
Add To MetaCart
Abstract:
In order to make a dependable distributed computer system resilient to arbitrary failures of its processors, deterministic Byzantine agreement protocols (BAPs) can be applied. Many BAPs found in literature require that communication takes place in synchronized rounds of information exchange and require that all correct processors know the start of the BAP and start the protocol simultaneously. It is hard to satisfy either or both requirements in a distributed system. As a consequence, it is hard to implement the above BAPs in a distributed system. Authenticated self-synchronizing BAPs evade this problem by guaranteeing Byzantine Agreement while allowing arbitrary clock skew between the clocks of the processors and not requiring correct processors to know the start of the BAP. However, authenticated self-synchronizing BAPs require much communication overhead. Therefore, in this paper, we introduce so-called optimized authenticated selfsynchronizing BAPs, that require fewer messages than the existing authenticated self-synchronizing BAPs. 1.
Citations
|
1976
|
A method for obtaining digital signatures and public key cryptosystems
– Rivest, Shamir, et al.
- 1978
|
|
1752
|
New directions in cryptography
– Diffie, Hellman
- 1976
|
|
1074
|
Impossibility of distributed consensus with one faulty process
– Fischer, Lynch, et al.
- 1985
|
|
806
|
The Byzantine generals problem
– Lamport, Shostak, et al.
- 1982
|
|
367
|
Reaching agreement in the presence of faults
– Pease, Shostak, et al.
- 1980
|
|
310
|
Consensus in the presence of partial synchrony
– Dwork, Lynch, et al.
- 1988
|
|
209
|
Atomic Broadcast: From Simple Message Diffusion To Byzantine Agreement
– Cristian, Aghili, et al.
- 1985
|
|
206
|
On the minimal synchronism needed for distributed consensus
– Dolev, Dwork, et al.
- 1987
|
|
178
|
Probabilistic clock synchronization
– Cristian
- 1989
|
|
148
|
Another Advantage of Free Choice: Completely Asynchrunous Agreement Protocols
– Ben-Or
- 1983
|
|
123
|
Fault Tolerance in Distributed Systems
– Jalote
- 1998
|
|
107
|
A lower bound for the time to assure interactive consistency
– Fischer, Lynch
- 1982
|
|
105
|
Fault-Tolerant Clock Synchronization
– Halpern, Simons, et al.
- 1984
|
|
104
|
Authenticated algorithms for Byzantine agreement
– Dolev, Strong
- 1983
|
|
87
|
A New Fault-Tolerant Algorithm for Clock Synchronization
– Welch, Lynch
- 1988
|
|
74
|
On the Possibility and Impossibility of Achieving Clock Synchronization
– Dolev, Halpern, et al.
- 1986
|
|
40
|
Byzantine agreement with authentication: Observations and applications in tolerating hybrid and link faults
– Gong, Lincoln, et al.
- 1995
|
|
25
|
An Introduction to Error Correcting Codes with Applications
– VANSTONE, OORSCHOT
- 1989
|
|
17
|
Resilient consensus protocols
– Bracha, Toueg
- 1983
|
|
14
|
The distributed firing squad problem
– Coan, Dolev, et al.
- 1985
|
|
13
|
Synchronization issues in real-time systems
– Suri, Hugue, et al.
- 1994
|
|
12
|
Distributed Systems, 2nd Edition
– Mullender
- 1993
|
|
10
|
The consensus Problem
– Barborak, Makek, et al.
- 1993
|
|
3
|
Interactive Consistency Algorithms Based on Authentication and Error-Correcting Codes
– Postma, Krol
- 1995
|
|
2
|
Randomized Byzantine Generals, in
– O
- 1983
|
|
2
|
Interactive Consistency in Quasi-Asynchronous Systems
– Postma, Krol
- 1996
|
|
1
|
A Generalization of Fault-Tolerance Based
– Krol
- 1991
|
