Byzantine fault detectors for solving consensus

Computer Journal

Volumn 46, Issue 1, 2003, Pages 16-35

  Kihlstrom, Kim Potter ^a   Moser, Louise E ^b   Melliar Smith, P M ^b  

^a WESTMONT COLLEGE   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DISTRIBUTED COMPUTER SYSTEMS; MATHEMATICAL MODELS; RELIABILITY;

ASYNCHRONOUS DISTRIBUTED SYSTEMS; BYZANTINE FAULTS; CONSENSUS PROBLEM; FAULT DETECTORS;

FAULT TOLERANT COMPUTER SYSTEMS;

EID: 0037238345     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/46.1.16     Document Type: Article

References (19)

1. Kihlstrom, K. P., Moser, L. E. and Melliar-Smith, P. M. (1997) Solving consensus in a Byzantine environment using an unreliable fault detector. In Proc. Int. Conf. on Principles of Distributed Systems, Chantilly, France, December 10-12, pp. 61-75. Editions Hermes, Paris.
2. Fischer, M. J., Lynch, N. A. and Paterson, M. S. (1985) Impossibility of distributed consensus with one faulty process. J. ACM, 32, 374-382.
3. Chandra, T. and Toueg, S. (1996) Unreliable failure detectors for reliable distributed systems. J. ACM, 43, 225-267.
4. Chandra, T., Hadzilacos, V. and Toueg, S. (1996) The weakest failure detector for solving consensus. J. ACM, 43, 685-722.
5. Dwork, C., Lynch, N. and Stockmeyer, L. (1988) Consensus in the presence of partial synchrony. J. ACM, 35, 288-323.
6. Malkhi, D. and Reiter, M. (1997) Unreliable intrusion detection in distributed computations. In Proc. 10th Computer Security Foundations Workshop, Rockport, MA, June 10-12, pp. 116-124. IEEE Computer Society Press, Los Alamitos, CA.
7. Doudou, A. and Schiper, A. (1998) Muteness detectors for consensus with Byzantine processes. In Proc. 17th Ann. ACM Symp. on Principles of Distributed Computing, Puerto Vallarta, Mexico, June 28-July 2, p. 315. ACM, New York, (Brief announcement.)
8. Doudou, A., Garbinato, B., Guerraoui, R. and Schiper, A. (1999) Muteness failure detectors: specification and implementation. In Proc. 3rd Eur. Dependable Computing Conf., Prague, Czech Republic, September 15-17. Lecture Notes in Computer Science, 1667, 71-87. Springer, Berlin.
9. Alvisi, L., Malkhi, D., Pierce, E. and Reiter, M. K. (2001) Fault detection for Byzantine quorum systems. IEEE Trans. Parallel Distrib. Syst., 12, 996-1007.
10. Rivest, R. L., Shamir, A. and Adleman, L. (1978) A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM, 21, 120-126.
11. Rivest, R. L. (1992) The MD5 Message Digest Algorithm. RFC 1321, Network Working Group, MIT Laboratory for Computer Science and RSA Data Security, Inc., Cambridge, MA. Available at: http://www.faqs.org/rfcs/rfc1321.html.
12. Bracha, G. (1987) Asynchronous Byzantine agreement protocols. Inform. Computat., 75, 130-143.
13. Coan, B. A. (1988) A compiler that increases the fault tolerance of asynchronous protocols. IEEE Trans. Comput., 37, 1541-1553.
14. Neiger, G. and Toueg, S. (1990) Automatically increasing the fault-tolerance of distributed algorithms. J. Algorithms, 11, 374-419.
15. Reiter, M. K. (1994) Secure agreement protocols: reliable and atomic group multicast in Rampart. In Proc. 2nd ACM Conf. on Computer and Communications Security, Fairfax, VA, November 2-4, pp. 68-80. ACM, New York.
16. Bracha, G. and Toueg, S. (1985) Asynchronous consensus and broadcast protocols. J. ACM, 32, 824-840.
17. Guerraoui, R. and Schiper, A. (1996) 'Γ-accurate' failure detectors. In Proc. 10th Int. Workshop on Distributed Algorithms, Bologna, Italy, October 9-11. Lecture Notes in Computer Science, 1151, 269-286. Springer, Berlin.
18. Schiper, A. (1997) Early consensus in an asynchronous system with a weak failure detector. Distrib. Comput., 10, 149-157.
19. Malkhi, D. and Reiter, M. (1997) A high-throughput secure reliable multicast protocol. J. Comput. Security, 5, 113-127.