Results 141 to 150 of about 1,046 (174)
Some of the next articles are maybe not open access.
RBFT: Redundant Byzantine Fault Tolerance
2013 IEEE 33rd International Conference on Distributed Computing Systems, 2013Byzantine Fault Tolerant state machine replication (BFT) protocols are replication protocols that tolerate arbitrary faults of a fraction of the replicas. Although significant efforts have been recently made, existing BFT protocols do not provide acceptable performance when faults occur.
Aublin, Pierre-Louis +2 more
openaire +2 more sources
The Performance of Byzantine Fault Tolerant Blockchains
2020 IEEE 19th International Symposium on Network Computing and Applications (NCA), 2020Blockchains have captured the attention of many, resulting in an abundance of new systems available for use. However, selecting an appropriate blockchain for an application is challenging due to the lack of comparative information discussing core metrics such as throughput, latency and scalability.
Gary Shapiro +2 more
openaire +1 more source
Dynamic Practical Byzantine Fault Tolerance
2018 IEEE Conference on Communications and Network Security (CNS), 2018This paper describes a novel Byzantine fault tolerant protocol that allows replicas to join and exit dynamically. With the astonishing success of cryptocurrencies, people attach great importance in “blockchain” and robust Byzantine fault tolerant (BFT) protocols for consensus. Among the conventional wisdom, the Practical Byzantine Fault Tolerance (PBFT)
Hao Xu +4 more
openaire +1 more source
Byzantine fault tolerance can be fast
Proceedings International Conference on Dependable Systems and Networks, 2002Byzantine fault tolerance is important because it can be used to implement highly-available systems that tolerate arbitrary behavior from faulty components. We present a detailed performance evaluation of BFT, a state-machine replication algorithm that tolerates Byzantine faults in asynchronous systems.
Miguel Castro 0001, Barbara Liskov
openaire +1 more source
Parallel Byzantine Fault Tolerance
2015The increasing popularity of distributed systems and applications has generated the need for algorithms guaranteeing high availability and reliability of such solutions. As an answer to this demand, various Byzantine fault-tolerant algorithms have been designed, allowing the systems to provide the correct service even in the presence of faults, either ...
openaire +1 more source
Availability Model for Byzantine Fault-Tolerant Systems
2023The growth in the complexity and extensibility of computer systems have caused vulnerabilities such as exploitable software bugs and configuration flaws. In turn, confirming computer security is becoming an increasingly important task. Byzantine fault-tolerant algorithms are popularly used to allow systems automatically continue operating. In addition,
Marco Marcozzi +4 more
openaire +1 more source
Byzantine Fault Tolerance for Agent Systems
2006 International Conference on Dependability of Computer Systems, 2006This paper presents a Byzantine fault tolerance method for agent systems. We extend Castro and Liskov?s well-known practical Byzantine fault tolerance method for the serverclient model to a method for the agent system model. There are two main differences between the methods.
openaire +1 more source
Quorum Selection for Byzantine Fault Tolerance
2019 IEEE 39th International Conference on Distributed Computing Systems (ICDCS), 2019Systems tolerating arbitrary failures use significant resources to constantly mask omission and timing failures from faulty processes. This paper presents Quorum Selection, a mechanism that allows to select well functioning processes for active participation in a system.
openaire +1 more source
Trebiz: Byzantine Fault Tolerance with Byzantine Merchants
Proceedings of the 38th Annual Computer Security Applications Conference, 2022Xiaohai Dai +5 more
openaire +1 more source
Byzantine Fault Tolerant Authentication
2004A 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 if more than a threshold of the participants are honest.
Pathak, Vivek, Iftode, Liviu
openaire +1 more source