Minimal Byzantine Fault Tolerance: Algorithm and Evaluation

@inproceedings{Veronese2009MinimalBF,
  title={Minimal Byzantine Fault Tolerance: Algorithm and Evaluation},
  author={Giuliana Santos Veronese and Miguel Correia and Alysson Neves Bessani and Lau Cheuk Lung and Paulo Ver{\'i}ssimo},
  year={2009}
}
This paper presents two asynchronous Byzantine faulttolerant state machine replication (BFT) algorithms that are minimal in several senses. First, they require only 2 f + 1 replicas, instead of the usual 3 f + 1. Second, the trusted service in which this reduction of replicas is based is arguably minimal, so it is simple to verify and implement (which is possible even using commercial trusted hardware). Third, in nice executions the two algorithms run in the minimum number of communication… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 45 REFERENCES

Similar Papers

Loading similar papers…