Results 171 to 180 of about 1,031,501 (207)

RBFT: Redundant Byzantine Fault Tolerance

2013 IEEE 33rd International Conference on Distributed Computing Systems, 2013
Byzantine 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.
Pierre-Louis Aublin, Sonia Ben Mokhtar, Vivien Quéma   +2 more
openaire   +2 more sources

Parallel Byzantine Fault Tolerance

2015
The 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

Dynamic Practical Byzantine Fault Tolerance

2018 IEEE Conference on Communications and Network Security (CNS), 2018
This 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, Yu Long 0001, Zhiqiang Liu 0001, Zhen Liu 0008, Dawu Gu   +4 more
openaire   +2 more sources

Making Byzantine Fault Tolerant Systems Tolerate Byzantine Faults.

2009
This paper argues for a new approach to building Byzantine fault tolerant replication systems. We observe that although recently developed BFT state machine replication protocols are quite fast, they don't tolerate Byzantine faults very well: a single faulty client or server is capable of rendering PBFT, Q/U, HQ, and Zyzzyva virtually unusable. In this
Clement, Allen, Wong, Edmund, Alvisi, Lorenzo, Dahlin, Mike, MARCHETTI, Mirco   +4 more
openaire   +2 more sources

CloudBFT: Elastic Byzantine Fault Tolerance

2014 IEEE 20th Pacific Rim International Symposium on Dependable Computing, 2014
Cloud computing is increasingly important, with the industry moving towards outsourcing computational resources as a means to reduce investment and management costs, while improving security, dependability and performance. Cloud operators use multi-tenancy, by grouping virtual machines (VMs) into a few physical machines (PMs), to pool computing ...
Rodrigo Nogueira, Filipe Araújo, Raul Barbosa   +2 more
openaire   +2 more sources

Availability Model for Byzantine Fault-Tolerant Systems

2023
The 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, Orhan Gemikonakli, Eser Gemikonakli, Enver Ever, Leonardo Mostarda   +4 more
openaire   +1 more source

Byzantine Fault Tolerance for Agent Systems

2006 International Conference on Dependability of Computer Systems, 2006
This 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   +2 more sources

Trebiz: Byzantine Fault Tolerance with Byzantine Merchants

Proceedings of the 38th Annual Computer Security Applications Conference, 2022
Xiaohai Dai, Liping Huang, Jiang Xiao 0001, Zhaonan Zhang, Xia Xie 0003, Hai Jin 0001   +5 more
openaire   +2 more sources

Quorum Selection for Byzantine Fault Tolerance

2019 IEEE 39th International Conference on Distributed Computing Systems (ICDCS), 2019
Systems 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

Byzantine Fault Tolerant Authentication

2004
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 if more than a threshold of the participants are honest.
Pathak, Vivek, Iftode, Liviu
openaire   +1 more source