Byzantine Fault Detectors for Solving Consensus (2003)
| Venue: | The Computer Journal |
| Citations: | 24 - 2 self |
BibTeX
@ARTICLE{Kihlstrom03byzantinefault,
author = {Kim Potter Kihlstrom and Louise E. Moser and P. M . Melliar-Smith},
title = {Byzantine Fault Detectors for Solving Consensus},
journal = {The Computer Journal},
year = {2003},
volume = {46},
pages = {2003}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
this paper we extend the work of Chandra and Toueg [3] by considering unreliable fault detectors for solving consensus in an asynchronous distributed system that is subject to Byzantine faults. A Byzantine processor is a processor that behaves in an arbitrary manner, or even according to some malicious design. It might send, to different destinations, different messages that purport to be # A preliminary version of this paper appeared in the Proceedings of the International Conference on Principles of Distributed Systems [1]
Citations
| 1300 | Impossibility of distributed consensus with one faulty process - Fischer, Lynch, et al. - 1985 |
| 807 | Unreliable Failure Detectors for Reliable Distributed - Chandra, Toueg - 1996 |
| 400 | Consensus in the presence of partial synchrony - Dwork, Lynch, et al. - 1988 |
| 374 | The weakest failure detector for solving consensus - Chandra, Hadzilacos, et al. - 1996 |
| 62 | Unreliable intrusion detection in distributed computations - Malkhi, Reiter - 1997 |
| 38 | Solving consensus in a byzantine environment using an unreliable fault detector - Kihlstrom, Moser, et al. - 1997 |
| 32 | Muteness failure detectors: Specification and implementation - Doudou, Garbinato, et al. - 1999 |
| 19 | Muteness Detectors for Consensus with Byzantine Processes (Brief Announcement - Doudou, Schiper - 1998 |
