Results 11 to 20 of about 2,103 (211)
Optimistic Byzantine fault tolerance [PDF]
International Journal of Parallel, Emergent and Distributed Systems, 2015 The primary concern of traditional Byzantine fault tolerance is to ensure strong replica consistency by executing incoming requests sequentially according to a total order. Speculative execution at both clients and server replicas has been proposed as a way of reducing the end-to-end latency.
Zhao, Wenbing
openaire +2 more sources
Multi-Threshold Byzantine Fault Tolerance [PDF]
Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security, 2021 Classic Byzantine fault tolerant (BFT) protocols are designed for a specific timing model, most often one of the following: synchronous, asynchronous or partially synchronous. It is well known that the timing model and fault tolerance threshold present inherent trade-offs. Synchronous protocols tolerate up to n/2 Byzantine faults, while asynchronous or
Momose, Atsuki, Ren, Ling
openaire +4 more sources
Byzantine Fault Tolerance for Nondeterministic Applications [PDF]
Third IEEE International Symposium on Dependable, Autonomic and Secure Computing (DASC 2007), 2007 To appear in the proceedings of the 3rd IEEE International Symposium on Dependable, Autonomic and Secure Computing ...
Wenbing Zhao
openaire +5 more sources
Scalable Byzantine fault-tolerant storage [PDF]
2011 IEEE/IFIP 41st International Conference on Dependable Systems and Networks Workshops (DSN-W), 2011 Byzantine fault-tolerance is costly, both in terms of increased latency and limited scalability. Most recent contributions 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 fault-tolerant storage systems based on the concept of mini ...
Ricardo Padilha, Fernando Pedone
openaire +3 more sources
High throughput Byzantine fault tolerance [PDF]
International Conference on Dependable Systems and Networks, 2004, 2004 This paper argues for a simple change to Byzantine fault tolerant (BFT) state machine replication libraries. Traditional BFT state machine replication techniques provide high availability and security but fail to provide high throughput. This limitation stems from the fundamental assumption of generalized state machine replication techniques that all ...
Ramakrishna Kotla, Michael Dahlin
openaire +3 more sources
Byzantine Fault Tolerance as a Service [PDF]
, 2012 In this paper, we argue for the need and benefits for providing Byzantine fault tolerance as a service to mission critical Web applications. In this new approach to Byzantine fault tolerance, an application server can partition the incoming requests into different domains for concurrent processing, decide which set of messages that should be totally ...
Hua Chai, Wenbing Zhao
openaire +2 more sources
Egalitarian Byzantine Fault Tolerance [PDF]
2021 IEEE 26th Pacific Rim International Symposium on Dependable Computing (PRDC), 2021 Minimizing end-to-end latency in geo-replicated systems usually makes it necessary to compromise on resilience, resource efficiency, or throughput performance, because existing approaches either tolerate only crashes, require additional replicas, or rely on a global leader for consensus.
Michael Eischer, Tobias Distler
openaire +2 more sources
Strengthened Fault Tolerance in Byzantine Fault Tolerant Replication [PDF]
2021 IEEE 41st International Conference on Distributed Computing Systems (ICDCS), 2021 Byzantine fault tolerant (BFT) state machine replication (SMR) is an important building block for constructing permissioned blockchain systems. In contrast to Nakamoto Consensus where any block obtains higher assurance as buried deeper in the blockchain, in BFT SMR, any committed block is secure has a fixed resilience threshold.
Zhuolun Xiang +3 more
openaire +2 more sources
Efficient Byzantine Fault-Tolerance [PDF]
IEEE Transactions on Computers, 2013 We present two asynchronous Byzantine fault-tolerant state machine replication (BFT) algorithms, which improve previous algorithms in terms of several metrics. First, they require only 2f+1 replicas, instead of the usual 3f+1. Second, the trusted service in which this reduction of replicas is based is quite simple, making a verified implementation ...
Giuliana Santos Veronese +4 more
openaire +1 more source
Joint Reputation Based Grouping and Hierarchical Byzantine Fault Tolerance Consensus Protocol
IEEE Access, 2023 Consensus protocol has challenges in terms of low consensus efficiency and centralization, as well as poor fault tolerance. A joint reputation model based grouping and hierarchical byzantine fault tolerance consensus protocol has been proposed.
Hao Qin, Yepeng Guan
doaj +1 more source