论文信息 - Are Byzantine Failures Really Different from Crash Failures?

Are Byzantine Failures Really Different from Crash Failures?

When considering n-process asynchronous systems, where up to t processes can fail, and communication is by read/write registers or reliable message-passing, are (from a computability point of view) Byzantine failures “different” from crash failures? This is the question addressed in this paper, which shows that the answer is “no” for systems where \(t

Michel Raynal | Damien Imbs | Julien Stainer

[1] Gil Neiger,et al. Automatically Increasing the Fault-Tolerance of Distributed Algorithms , 1990, J. Algorithms.

[2] Maurice Herlihy,et al. Distributed computability in Byzantine asynchronous systems , 2013, STOC.

[3] Danny Dolev,et al. Some Garbage In - Some Garbage Out: Asynchronous t-Byzantine as Asynchronous Benign t-resilient system with fixed t-Trojan-Horse Inputs , 2016, ArXiv.

[4] Rida A. Bazzi,et al. Optimally Simulating Crash Failures in a Byzantine Environment , 1991, WDAG.

[5] Michel Raynal,et al. From Byzantine Failures to Crash Failures in Message-Passing Systems: a BG Simulation-based approach , 2015, ArXiv.

[6] Robbert van Renesse,et al. Making Distributed Applications Robust , 2007, OPODIS.

[7] Maurice Herlihy,et al. Distributed Computing Through Combinatorial Topology , 2013 .

[8] Brian A. Coan,et al. A Compiler that Increases the Fault Tolerance of Asynchronous Protocols , 1988, IEEE Trans. Computers.

[9] Eli Gafni,et al. Generalized FLP impossibility result for t-resilient asynchronous computations , 1993, STOC.

[10] Sam Toueg,et al. Simulating authenticated broadcasts to derive simple fault-tolerant algorithms , 1987, Distributed Computing.

[11] Leslie Lamport,et al. The Byzantine Generals Problem , 1982, TOPL.