A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Filters
Excellent Practical Byzantine Fault Tolerance
2020
Journal of Cyber Security
Preserved Fulltext
Practical Byzantine Fault Tolerance (PBFT), as the first efficient consensus algorithm solving the Byzantine Generals Problem, plays an important role. But PBFT also has its problems. ...
For these problems, this paper proposes an Optimized consensus algorithm, Excellent Practical Byzantine Fault Tolerance (EPBFT), in which nodes can dynamically participate in the network by combining a ...
To solve these problems, we propose a better performance Byzantine fault-tolerant algorithm called Excellent Practical Byzantine Fault Tolerance (EPBFT). ...
doi:10.32604/jcs.2020.011341
fatcat:bbhksi5yw5egllvjyruw3ofxs4
Revisiting Fast Practical Byzantine Fault Tolerance
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Introduction A landmark solution in achieving replication with Byzantine fault tolerance has been the Practical Byzantine Fault Tolerance (PBFT) work by Castro and Liskov [3, 4] . ...
(In practice, the leader sends only the last request and a hash of the history of prior operations; a node can request the leader to re-send any missing operations.) ...
arXiv:1712.01367v1
fatcat:fyix2e2rijayrd2c4s5l6w2tmy
On the Practicality of Practical Byzantine Fault Tolerance
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Byzantine Fault Tolerant (BFT) systems are considered to be state of the art with regards to providing reliability in distributed systems. ...
Despite over a decade of research, however, BFT systems are rarely used in practice. ...
Original algorithm The Castro-Liskov algorithm for Practical Byzantine Fault Tolerance [3] (abbreviated as PBFT ) is a replication algorithm that can tolerate arbitrary faults. ...
doi:10.1007/978-3-642-35170-9_22
fatcat:cpdyfy3lkvdb5nesc6r2ntaav4
On the Practicality of `Practical' Byzantine Fault Tolerance
[article]
2011
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Byzantine Fault Tolerant (BFT) systems are considered by the systems research community to be state of the art with regards to providing reliability in distributed systems. ...
Despite this, BFT systems are still rarely used in practice. ...
Background
Original algorithm The Castro-Liskov algorithm for Practical Byzantine Fault Tolerance [8] (abbreviated as PBFT) is a replication algorithm that can tolerate arbitrary faults. ...
arXiv:1110.4854v1
fatcat:gmrqrum35vczph4asiati7zzfa
Practical byzantine fault tolerance and proactive recovery
2002
ACM Transactions on Computer Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Therefore, we believe that the BFT library can be used to build practical systems that tolerate Byzantine faults. ...
It shows, for the first time, how to build Byzantine-fault-tolerant systems that can be used in practice to implement real services because they do not rely on unrealistic assumptions and they perform ...
The SFS read-only file system [FKM00] can tolerate Byzantine faults. ...
doi:10.1145/571637.571640
fatcat:kesiyoinyjdhleg2mh36v5iaya
Alea-BFT: Practical Asynchronous Byzantine Fault Tolerance
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Traditional Byzantine Fault Tolerance (BFT) state machine replication protocols assume a partial synchrony model, leading to a design where a leader replica drives the protocol and is replaced after a ...
However, these protocols still fall short of being practical across a broad range of scenarios due to their cubic communication costs, use of expensive primitives, and overall protocol complexity. ...
Related Work The Byzantine consensus problem was formulated by Lamport et al. [15] , and led to a series of proposals for Byzantine fault tolerant replication protocols [12, 18, 24] . ...
arXiv:2202.02071v1
fatcat:ug2ao2jgdvdw3m2fcq5jh22chu
Queuing Theory of Improved Practical Byzantine Fault Tolerant Consensus
2022
Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Delegated proof of stake (DPoS) and practical Byzantine fault tolerant (PBFT) consensus mechanisms are key technologies in maintaining the security of blockchain system. ...
Second, the M/PH/1 queuing model is used to analyze the performance of the proposed consensus mechanism, and the performance of the improved practical Byzantine fault tolerant consensus mechanism is evaluated ...
Given that proof of work (PoW), delegated proof of stake (DPoS), and practical Byzantine fault tolerant (PBFT) consensus mechanisms have been proposed, the problems of blockchain system in security, availability ...
doi:10.3390/math10020182
fatcat:56xnzdvxwjeg5ajf4whirxz6fm
Revisiting Fast Practical Byzantine Fault Tolerance: Thelma, Velma, and Zelma
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
(In practice, the leader sends only the last request and a hash of the history of prior operations; a node can request the leader to re-send any missing operations.) ...
Borrowing from Zyzzyva, Velma provides an optimistically fast execution track in a fault model of n = 3f + 1 with the following guarantees. ...
arXiv:1801.10022v1
fatcat:vy3cxil2pve2pdmelzzyxwf6be
Cryptospatial blockchain sharia hotel based on practical Byzantine fault tolerance
2021
Telfor Journal
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
This research develops an application based on android that uses four interconnected nodes in a network with the Practical Byzantine fault tolerance (PBFT) blockchain method to value object geospatial ...
Cryptospatial Blockchain Sharia Hotel Based on
Practical Byzantine Fault Tolerance
Moch. ...
Practical Byzantine Fault Tolerance (PBFT) PBFT is a blockchain protocol mechanism that uses a simple algorithm but has high practicality with distributed database systems [21] . ...
doi:10.5937/telfor2101053s
fatcat:yk37d7zkjjab5mnkosrh7qz56a
Stochastic Performance Modeling for Practical Byzantine Fault Tolerance Consensus in Blockchain
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
The practical Byzantine fault tolerant (PBFT) consensus mechanism is one of the most basic consensus algorithms (or protocols) in blockchain technologies, thus its performance evaluation is an interesting ...
Based on the Byzantine generals problem, Pease et al. [53] and Lamport [32] provided the Byzantine fault tolerant (BFT) consensus mechanism. ...
Group two: The number f of Byzantine nodes, and the arrival rate λ of transaction packages at the client. ...
arXiv:2107.00183v1
fatcat:hpy73eztynaqnfaak5rnsdw44e
Scalable Dynamic Multi-Agent Practical Byzantine Fault-Tolerant Consensus in Permissioned Blockchain
2018
Applied Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
However, the Practical Byzantine Fault-Tolerant (PBFT) algorithm, which is currently adopted in such systems, sparks communication bottlenecks when the number of consensus nodes increases sharply, which ...
Figure 1 . 1 Basic communication pattern in PBFT (Practical Byzantine Fault-Tolerant).
Figure 1 . 1 Basic communication pattern in PBFT (Practical Byzantine Fault-Tolerant). ...
PoS: Proof of State; PoW: Proof of Work; PBFT: Practical Byzantine Fault-Tolerant. ...
doi:10.3390/app8101919
fatcat:qb5ypr7v7zfz3htuby44lkvcji
On the Viable Area of Wireless Practical Byzantine Fault Tolerance (PBFT) Blockchain Networks
2019
2019 IEEE Global Communications Conference (GLOBECOM)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this paper, we present an analytical modeling framework for Practical Byzantine Fault Tolerance (PBFT)-a consensus method for blockchain in IoT networks. ...
The proposed framework can serve as a theoretical guidance for practical PBFT based wireless blockchain network deployment. ...
Practical Byzantine Fault Tolerance (PBFT) The conventional PBFT network is made up of n replica nodes and it can tolerate a maximum of f faulty replica nodes. ...
doi:10.1109/globecom38437.2019.9013778
dblp:conf/globecom/OniretiZI19
fatcat:qhfmrge3lrehblechpcscvxlda
On the Practicality to Implement Byzantine Fault Tolerant Services Based on Tuple Space
2014
2014 IEEE 28th International Conference on Advanced Information Networking and Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In addition, the paper also presents an experimental evaluation of some protocols for replication of Byzantine fault tolerant systems for practical purposes. ...
This paper introduces a new architecture for replication of Byzantine fault tolerant service, based on the tuple space model. ...
The PBFT protocol [4] is one of the most successful works in the field of practical Byzantine fault tolerance systems, due to the set of optimizations implemented in it. ...
doi:10.1109/aina.2014.126
dblp:conf/aina/LuizLR14
fatcat:ccqdwuflqrfixdvphetllsprme
Intrusion Detection Analysis of Internet of Things considering Practical Byzantine Fault Tolerance (PBFT) Algorithm
2021
Wireless Communications and Mobile Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
This paper proposes a practical Byzantine fault-tolerant intrusion detection method for the use process of the Internet of things. ...
benefit function of practical Byzantine fault tolerance, the results of Internet of things intrusion detection model can be effectively calculated. ...
Practical Byzantine Fault Tolerant Intrusion Detection Method 3.4.1. ...
doi:10.1155/2021/6856284
fatcat:omgvmb6lsfbzffa2z23llg7wle
Practical framework for Byzantine fault-tolerant systems
2014
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
This framework offers a common ground to be able to make a fair performance comparison of distributed fault-tolerant protocols. The framework's practicality is of primary concern. ...
Having a modular framework to test distributed algorithms enables the use of novel ideas for storage networks, such as network coding, for Byzantine fault-tolerant algorithms. ...
", Practical Framework for Byzantine Fault-tolerant Systems
logger.trace("Writing from {}.", this.requestor);Practical Framework for Byzantine Fault-tolerant Systems ...
doi:10.34726/hss.2014.24266
fatcat:v5voorolenarll7cc6nivaplb4
« Previous
Showing results 1 — 15 out of 6,769 results