Research note: On Byzantine generals with alternative plans

Authors:
Miguel Correia;Alysson Neves Bessani;Paulo Veríssimo
Affiliations:
Universidade de Lisboa, Faculdade de Ciências, LASIGE, Campo Grande, Bloco C6, Piso 3, 1749-016 Lisboa, Portugal;Universidade de Lisboa, Faculdade de Ciências, LASIGE, Campo Grande, Bloco C6, Piso 3, 1749-016 Lisboa, Portugal;Universidade de Lisboa, Faculdade de Ciências, LASIGE, Campo Grande, Bloco C6, Piso 3, 1749-016 Lisboa, Portugal
Venue:
Journal of Parallel and Distributed Computing
Year:
2008

Citing 17
Cited 0

Generative communication in Linda

ACM Transactions on Programming Languages and Systems (TOPLAS)
Consensus in the presence of partial synchrony

Journal of the ACM (JACM)
Implementing fault-tolerant services using the state machine approach: a tutorial

ACM Computing Surveys (CSUR)
More choices allow more faults: set consensus problems in totally asynchronous systems

Information and Computation
Impossibility of distributed consensus with one faulty process

Journal of the ACM (JACM)
The Byzantine Generals Problem

ACM Transactions on Programming Languages and Systems (TOPLAS)
Encapsulating Failure Detection: From Crash to Byzantine Failures

Ada-Europe '02 Proceedings of the 7th Ada-Europe International Conference on Reliable Software Technologies
Unreliable Intrusion Detection in Distributed Computations

CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
An asynchronous [(n - 1)/3]-resilient consensus protocol

PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Consensus in byzantine asynchronous systems

Journal of Discrete Algorithms
Byzantine quorum systems

Distributed Computing
Simple and Efficient Oracle-Based Consensus Protocols for Asynchronous Byzantine Systems

IEEE Transactions on Dependable and Secure Computing
BTS: a Byzantine fault-tolerant tuple space

Proceedings of the 2006 ACM symposium on Applied computing
Sharing Memory between Byzantine Processes using Policy-Enforced Tuple Spaces

ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
From Consensus to Atomic Broadcast: Time-Free Byzantine-Resistant Protocols without Signatures

The Computer Journal
Intrusion Tolerance in Wireless Environments: An Experimental Evaluation

PRDC '07 Proceedings of the 13th Pacific Rim International Symposium on Dependable Computing
DepSpace: a byzantine fault-tolerant coordination service

Proceedings of the 3rd ACM SIGOPS/EuroSys European Conference on Computer Systems 2008

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a variation of the Byzantine generals problem (or Byzantine consensus). Each general has a set of good plans and a set of bad plans. The problem is to make all loyal generals agree on a good plan proposed by a loyal general, and never on a bad plan.