Results 1 - 10 of 698

Practical Byzantine fault tolerance

by Miguel Castro, Barbara Liskov , 1999
"... This paper describes a new replication algorithm that is able to tolerate Byzantine faults. We believe that Byzantinefault-tolerant algorithms will be increasingly important in the future because malicious attacks and software errors are increasingly common and can cause faulty nodes to exhibit arbi ..."
Abstract - Cited by 673 (15 self) - Add to MetaCart
This paper describes a new replication algorithm that is able to tolerate Byzantine faults. We believe that Byzantinefault-tolerant algorithms will be increasingly important in the future because malicious attacks and software errors are increasingly common and can cause faulty nodes to exhibit

Practical Byzantine fault tolerance and proactive recovery

by Miguel Castro, Barbara Liskov - ACM Transactions on Computer Systems , 2002
"... Our growing reliance on online services accessible on the Internet demands highly available systems that provide correct service without interruptions. Software bugs, operator mistakes, and malicious attacks are a major cause of service interruptions and they can cause arbitrary behavior, that is, B ..."
Abstract - Cited by 410 (7 self) - Add to MetaCart
, Byzantine faults. This article describes a new replication algorithm, BFT, that can be used to build highly available systems that tolerate Byzantine faults. BFT can be used in practice to implement real services: it performs well, it is safe in asynchronous environments such as the Internet

Zyzzyva: Speculative byzantine fault tolerance

by Ramakrishna Kotla, Lorenzo Alvisi, Mike Dahlin, Allen Clement, Edmund Wong - In Symposium on Operating Systems Principles (SOSP , 2007
"... We present Zyzzyva, a protocol that uses speculation to reduce the cost and simplify the design of Byzantine fault tolerant state machine replication. In Zyzzyva, replicas respond to a client’s request without first running an expensive three-phase commit protocol to reach agreement on the order in ..."
Abstract - Cited by 188 (16 self) - Add to MetaCart
We present Zyzzyva, a protocol that uses speculation to reduce the cost and simplify the design of Byzantine fault tolerant state machine replication. In Zyzzyva, replicas respond to a client’s request without first running an expensive three-phase commit protocol to reach agreement on the order

Byzantine Fault Tolerant Authentication

by Vivek Pathak, Liviu Iftode - Poster at ACM WISE Workshop , 2002
"... A Byzantine fault tolerant public key infrastructure is presented. It aims to fulfill the authentication requirements of large distributed systems consisting of semi-trusted parties. The distributed trust model does not demand the existence of predefined trusted parties and provides authentication i ..."
Abstract - Cited by 4 (1 self) - Add to MetaCart
A Byzantine fault tolerant public key infrastructure is presented. It aims to fulfill the authentication requirements of large distributed systems consisting of semi-trusted parties. The distributed trust model does not demand the existence of predefined trusted parties and provides authentication

Byzantine Fault Tolerant Authentication

by Vivek Pathak Rutgers, Vivek Pathak, Liviu Iftode - Poster at ACM WISE Workshop , 2002
"... We describe an autonomous Byzantine fault tolerant public key authentication architecture. It aims to satisfy the authentication requirements of large distributed systems consisting of semitrusted peers. The distributed trust model does not demand the existence of prede ned trusted parties and prov ..."
Abstract - Add to MetaCart
We describe an autonomous Byzantine fault tolerant public key authentication architecture. It aims to satisfy the authentication requirements of large distributed systems consisting of semitrusted peers. The distributed trust model does not demand the existence of prede ned trusted parties

Byzantine Fault Tolerant Authentication

by unknown authors
"... Abstract We describe an autonomous Byzantine fault tolerant public key authentication architecture. It aims to satisfy the authentication requirements of large distributed systems consisting of semi-trusted peers. The distributed trust model does not demand the existence of predefined trusted partie ..."
Abstract - Add to MetaCart
Abstract We describe an autonomous Byzantine fault tolerant public key authentication architecture. It aims to satisfy the authentication requirements of large distributed systems consisting of semi-trusted peers. The distributed trust model does not demand the existence of predefined trusted

Application-Aware Byzantine Fault Tolerance

by Wenbing Zhao
"... Abstract—Byzantine fault tolerance has been intensively stud-ied over the past decade as a way to enhance the intrusion resilience of computer systems. However, state-machine-based Byzantine fault tolerance algorithms require deterministic ap-plication processing and sequential execution of totally ..."
Abstract - Add to MetaCart
Abstract—Byzantine fault tolerance has been intensively stud-ied over the past decade as a way to enhance the intrusion resilience of computer systems. However, state-machine-based Byzantine fault tolerance algorithms require deterministic ap-plication processing and sequential execution of totally

Scalable byzantine fault-tolerant storage

by Ricardo Padilha, O Pedone - In HotDep , 2011
"... Abstract—Byzantine fault-tolerance is costly, both in terms of increased latency and limited scalability. Most recent contribu-tions in the area have addressed the latency aspect, leaving the throughput scalability problem largely untouched. We propose in this short paper to build scalable Byzantine ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
Abstract—Byzantine fault-tolerance is costly, both in terms of increased latency and limited scalability. Most recent contribu-tions in the area have addressed the latency aspect, leaving the throughput scalability problem largely untouched. We propose in this short paper to build scalable

High throughput Byzantine fault tolerance

by Ramakrishna Kotla, Mike Dahlin - In DSN , 2004
"... We argue for a simple change to Byzantine Fault Tolerant state machine replication libraries in order to provide high throughput. Traditional state machine replication based Byzantine fault tolerant (BFT) techniques provide high availability and security but fail to provide high throughput. This lim ..."
Abstract - Cited by 50 (12 self) - Add to MetaCart
We argue for a simple change to Byzantine Fault Tolerant state machine replication libraries in order to provide high throughput. Traditional state machine replication based Byzantine fault tolerant (BFT) techniques provide high availability and security but fail to provide high throughput

Byzantine fault tolerance can be fast

by Miguel Castro, Barbara Liskov - In International Conference on Dependable Systems and Networks , 2001
"... Byzantine fault tolerance is important because it can be used to implement highly-available systems that tolerate ar-bitrary behaviorfrom faulty components. This paper presents a detailed performance evaluation of BFT, a state-machine replication algorithm that tolerates Byzantine faults in asyn-chr ..."
Abstract - Cited by 5 (0 self) - Add to MetaCart
Byzantine fault tolerance is important because it can be used to implement highly-available systems that tolerate ar-bitrary behaviorfrom faulty components. This paper presents a detailed performance evaluation of BFT, a state-machine replication algorithm that tolerates Byzantine faults in asyn
Results 1 - 10 of 698