Practical Byzantine Fault Tolerance cs实用的拜占庭式的故障容错政务司司长.cornell.pptVIP

Byzantine Techniques II Presenter: Georgios Piliouras Partly based on slides by Justin W. Hart Rodrigo Rodrigues Papers Practical Byzantine Fault Tolerance. Miguel Castro et. al. (OSDI 1999) BAR Fault Tolerance for Cooperative Services. Amitanand S. Aiyer, et. al. (SOSP 2005) Motivation Computer systems provide crucial services Problem Computer systems provide crucial services Computer systems fail natural disasters hardware failures software errors malicious attacks Replication Replication Assumptions are a Problem Replication algorithms make assumptions: behavior of faulty processes synchrony bound on number of faults Service fails if assumptions are invalid Assumptions are a Problem Replication algorithms make assumptions: behavior of faulty processes synchrony bound on number of faults Service fails if assumptions are invalid attacker will work to invalidate assumptions Contributions Practical replication algorithm: weak assumptions ? tolerates attacks good performance Implementation BFT: a generic replication toolkit BFS: a replicated file system Performance evaluation Talk Overview Problem Assumptions Algorithm Implementation Performance Conclusions Bad Assumption: Benign Faults Traditional replication assumes: replicas fail by stopping or omitting steps Bad Assumption: Benign Faults Traditional replication assumes: replicas fail by stopping or omitting steps Invalid with malicious attacks: compromised replica may behave arbitrarily single fault may compromise service decreased resiliency to malicious attacks BFT Tolerates Byzantine Faults Byzantine fault tolerance: no assumptions about faulty behavior Tolerates successful attacks service available when hacker controls replicas Byzantine-Faulty Clients Bad assumption: client faults are benign clients easier to compromise than replicas Byzantine-Faulty Clients Bad assumption: client faults are benign clients easier to compromise than replicas BFT tolerates Byzantine-faulty clients: