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
Improved Fault-Tolerant Consensus Based on the PBFT Algorithm
2022
IEEE Access
Preserved Fulltext
Nowadays Practical Byzantine Fault Tolerance (PBFT) algorithm has become the most extensive consensus algorithm in the alliance chain. ...
Second, to ensure the fault-tolerant ability of the grouping consensus, the nodal decision broadcast model and threshold vote-counting model are proposed first. ...
Byzantine fault tolerance algorithm was introduced into the engineering field. ...
doi:10.1109/access.2022.3153701
fatcat:kpsfeu2yzffjxj7eah3sie7zfy
Boosting Byzantine Protocols in Large Sparse Networks with High System Assumption Coverage
[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.
To improve the overall efficiency and reliability of Byzantine protocols in large sparse networks, we propose a new system assumption for developing multi-scale fault-tolerant systems, with which several ...
By extending the traditional Byzantine adversary to the multi-scale adversaries, it is shown that efficient deterministic Byzantine broadcast and Byzantine agreement can be built in logarithmic-degree ...
., being Byzantine [1] , in designing high-reliable fault-tolerant systems. ...
arXiv:2203.03320v1
fatcat:hpnc47zlvrftnihucezxncrw2a
Basilic: Resilient Optimal Consensus Protocols With Benign and Deceitful Faults
[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.
Byzantine faults, in what we call the Byzantine-deceitful-benign fault model. ...
Finally, we study the fault tolerance of the Basilic class of consensus protocols in the context of blockchains that need to solve the weaker problem of eventual consensus. ...
decide to tolerate t = ⌈n/3⌉ − 1 Byzantine faults. ...
arXiv:2204.08670v1
fatcat:p6hvapyv6zcztett4pfacknxhy
Byzantine Fault Tolerance, from Theory to Reality
[chapter]
2003
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 2005; you can also visit the original URL.
The file type is application/pdf.
Since its introduction nearly 20 years ago, the Byzantine Generals Problem has been the subject of many papers having the scrutiny of the fault tolerance community. ...
Numerous Byzantine tolerant algorithms and architectures have been proposed. ...
SAFEbus is the only standard bus topology that can tolerate a Byzantine fault, made possible by SAFEbus 's fullcoverage, fault-tolerant hardware. ...
doi:10.1007/978-3-540-39878-3_19
fatcat:hgnepeo2jfgwnmaemysj2ualli
Fault-scalable Byzantine fault-tolerant services
2005
ACM SIGOPS Operating Systems Review
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 2008; you can also visit the original URL.
The file type is application/pdf.
A fault-scalable service can be configured to tolerate increasing numbers of faults without significant decreases in performance. ...
Moreover, the performance of the Q/U protocol decreases by only 36% as the number of Byzantine faults tolerated increases from one to five, whereas the performance of the replicated state machine decreases ...
Our experience is that Byzantine fault-tolerant agreement-based approaches are not fault-scalable: their performance drops rapidly as more faults are tolerated because of server-to-server broadcast communication ...
doi:10.1145/1095809.1095817
fatcat:cwvaqftc3zcu7llyqcbbhgiq3m
Fault-scalable Byzantine fault-tolerant services
2005
Proceedings of the twentieth ACM symposium on Operating systems principles - SOSP '05
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 2008; you can also visit the original URL.
The file type is application/pdf.
A fault-scalable service can be configured to tolerate increasing numbers of faults without significant decreases in performance. ...
Moreover, the performance of the Q/U protocol decreases by only 36% as the number of Byzantine faults tolerated increases from one to five, whereas the performance of the replicated state machine decreases ...
Our experience is that Byzantine fault-tolerant agreement-based approaches are not fault-scalable: their performance drops rapidly as more faults are tolerated because of server-to-server broadcast communication ...
doi:10.1145/1095810.1095817
dblp:conf/sosp/Abd-El-MalekGGRW05
fatcat:wprlhckrtbgzxh34nf4pwqkchu
Evaluating Byzantine Quorum Systems
2007
Symposium on Reliable Distributed Systems. Proceedings
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.
Byzantine Quorum Systems (BQS) have been proposed as a solution to guarantee the consistency of that kind of services, even if some of the replicas fail arbitrarily. ...
We thank Eduardo Alchieri for his contribution on the Byzantine Paxos implementation. ...
multi-reader atomic registers and tolerates Byzantine clients. ...
doi:10.1109/srds.2007.4365701
fatcat:zffrdmkn5ffa3nvmhyarsp7hmu
Evaluating Byzantine Quorum Systems
2007
2007 26th IEEE International Symposium on Reliable Distributed Systems (SRDS 2007)
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.
Byzantine Quorum Systems (BQS) have been proposed as a solution to guarantee the consistency of that kind of services, even if some of the replicas fail arbitrarily. ...
We thank Eduardo Alchieri for his contribution on the Byzantine Paxos implementation. ...
multi-reader atomic registers and tolerates Byzantine clients. ...
doi:10.1109/srds.2007.34
dblp:conf/srds/DantasBFC07
fatcat:r6yuguijqne35ihamb57ulyhia
Secure and Efficient Asynchronous Broadcast Protocols
[chapter]
2001
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 2019; you can also visit the original URL.
The file type is application/pdf.
Broadcast protocols are a fundamental building block for implementing replication in fault-tolerant distributed systems. ...
We present a randomized atomic broadcast protocol based on a new, efficient multi-valued asynchronous Byzantine agreement primitive with an external validity condition. ...
Introduction Broadcast protocols are a fundamental building block for fault-tolerant distributed systems. ...
doi:10.1007/3-540-44647-8_31
fatcat:6tcue5nvt5er5pxwjdefgjjxai
A Byzantine Sensing Network Based on Majority-Consensus Data Aggregation Mechanism
2021
Sensors
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.
Many Byzantine fault tolerance mechanisms in wireless sensor networks (WSNs) were proposed from Byzantine agreement which even with a few faulty nodes in a sensor network, most healthy nodes can reach ...
Moreover, the operating performance of the network can be maintained even when problems such as node failure and faults occur within the fault tolerance range. ...
[19] proposed a fault tolerance threshold: f ≤ n − 1/3 (1) where f is the number of faults and n is the total number of processors. ...
doi:10.3390/s21010248
pmid:33401656
fatcat:za5ydqw4hffkzg4limohbydrxq
Probabilistic Quorum Systems
2001
Information and Computation
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.
We explore probabilistic quorum systems both for services tolerant of benign server failures and for services tolerant of arbitrary (Byzantine) ones. ...
b of tolerated Byzantine faults, and on the error probability ε. ...
TABLE 2 2 Properties of Various Quorum Systems ε-intersecting
Threshold
Grid
Quorum
Fault
Quorum
Fault
Quorum
Fault
n
l
size
tolerance
size
tolerance
size
tolerance
25
1.80
9
17 ...
doi:10.1006/inco.2001.3054
fatcat:wif3vovwszfnjctcqchvgofbqe
State Machine Replication with Byzantine Faults
[chapter]
2010
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 2008; you can also visit the original URL.
The file type is application/pdf.
This paper gives an introduction to state machine replication in groups subject to arbitrary or "Byzantine" faults. ...
It explains the principles of such protocols and covers the following topics: broadcast primitives, distributed cryptosystems, randomized Byzantine agreement protocols, and atomic broadcast protocols. ...
BFT is actually a Byzantine-fault-tolerant version of the Paxos protocol [Lam98, Lam01a, Lam01b] . ...
doi:10.1007/978-3-642-11294-2_9
fatcat:ipbwcimym5h55m5z3r2r3hhtzi
Byzantine Fault-Tolerant Distributed Machine Learning Using Stochastic Gradient Descent (SGD) and Norm-Based Comparative Gradient Elimination (CGE)
[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.
Other Versions
This paper considers the Byzantine fault-tolerance problem in distributed stochastic gradient descent (D-SGD) method - a popular algorithm for distributed multi-agent machine learning. ...
We show that the CGE gradient-filter guarantees fault-tolerance against a bounded fraction of Byzantine agents under standard stochastic assumptions, and is computationally simpler compared to many existing ...
. • A new algorithm and its fault-tolerance property: We show that our algorithm, D-SGD method with CGE gradient-filter, guarantees Byzantine fault-tolerance under standard assumptions [7] . ...
arXiv:2008.04699v2
fatcat:v3bvhnb4vvffrp3t7dsawb3etu
Holistic Verification of Blockchain Consensus
[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.
We decompose directly the algorithm pseudocode in two parts – an inner broadcast algorithm and an outer decision algorithm – each modelled as a threshold automaton [36], and we formalize their expected ...
Byzantine) participants. Malicious participants exploit regularly weaknesses of these blockchain consensus algorithms, with sometimes devastating consequences. ...
In particular, Coq helped prove the Raft consensus algorithm [67] , which is not Byzantine fault tolerant but part of crash fault tolerant distributed ledgers [5, 12] , and the Byzantine consensus algorithm ...
arXiv:2206.04489v1
fatcat:egiz5d4jabexzbl4ynep65mzei
A Survey on Fault-tolerance in Distributed Optimization and Machine Learning
[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.
Other Versions
This survey investigates the current state of fault-tolerance research in distributed optimization, and aims to provide an overview of the existing studies on both fault-tolerant distributed optimization ...
Adversary models The majority of the fault-tolerant optimization researches focus on Byzantine fault-tolerance, both in theory and in practice. ...
Other fault-tolerant distributed optimization problems Outside the scope of our discussion in Byzantine fault-tolerance distributed optimization in Section 3, some other problems related to fault-tolerance ...
arXiv:2106.08545v2
fatcat:g6fys4icrbbr5k3bd3ycylaptu
« Previous
Showing results 1 — 15 out of 1,979 results