Minimal Byzantine Fault Tolerance: Algorithm and Evaluation
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 mini...
| Autor principal: | |
|---|---|
| Outros Autores: | , , , |
| Formato: | report |
| Idioma: | eng |
| Publicado em: |
2009
|
| Texto completo: | http://hdl.handle.net/10451/14260 |
| País: | Portugal |
| Oai: | oai:repositorio.ul.pt:10451/14260 |