Practical Byzantine Fault Tolerance
This project is aimed at developing algorithms and implementation
techniques to build practical Byzantine-fault-tolerant systems, that
is, systems that work correctly even when some components are faulty
and exhibit arbitrary behavior. We believe that these systems will be
increasingly important in the future because malicious attacks and
software errors are increasingly common and can cause faulty nodes to
exhibit arbitrary behavior.
Publications:
-
Practical
Byzantine Fault Tolerance
Technical Report MIT/LCS/TR-817. MIT Laboratory for Computer Science,
Cambridge, MA, January 2001. Ph.D. thesis. Miguel Castro
[
PostScript
| PDF]
-
Proactive
Recovery in a Byzantine-Fault-Tolerant System
Proceedings of the Fourth Symposium on Operating Systems Design and
Implementation (OSDI '00), San Diego, USA, October 2000. Miguel Castro
and Barbara Liskov.
-
Practical
Byzantine Fault Tolerance
Proceedings of the Third Symposium on Operating Systems Design and
Implementation (OSDI '99), New Orleans, USA, February 1999. Miguel Castro
and Barbara Liskov.
-
Authenticated
Byzantine Fault Tolerance Without Public-Key Cryptography
Technical Memo MIT/LCS/TM-589, MIT Laboratory for Computer
Science, June 1999. Miguel Castro and Barbara Liskov.
[
PostScript
| PDF]
-
A
Correctness Proof for a Practical Byzantine-Fault-Tolerant Replication
Algorithm
Technical Memo MIT/LCS/TM-590, MIT Laboratory for Computer
Science, June 1999. Miguel Castro and Barbara Liskov.
[
PostScript
| PDF]