搜索结果: 1-15 共查到“军队指挥学 Byzantine”相关记录27条 . 查询时间(0.083 秒)
Although Byzantine Agreement (BA) has been studied for three decades, perhaps somewhat surprisingly, there still exist significant gaps in our understanding regarding its round complexity. First, alth...
On the Round Complexity of Randomized Byzantine Agreement
Byzantine agreement lower bound round complexity
2019/7/31
We prove lower bounds on the round complexity of randomized Byzantine agreement (BA) protocols, bounding the halting probability of such protocols after one and two rounds.
Another Look at Byzantine Fault Tolerance
cryptographic protocols Byzantine Fault Tolerance
2019/7/26
We review several solutions for the Byzantine Fault Tolerance (BFT) problem and discuss some aspects that are frequently overlooked by existing literatures. For example, PBFT and HotStuff BFT protocol...
In this paper, we introduce \emph{Polygraph}, the first accountable Byzantine consensus algorithm for partially synchronous systems. If among nn users t
Synchronous Byzantine Agreement with Expected $O(1)$ Rounds, Expected $O(n^2)$ Communication, and Optimal Resilience
Optimal Resilience authenticated setting
2018/11/2
We present new protocols for Byzantine agreement in the synchronous and authenticated setting, tolerating the optimal number of ff faults among n=2f+1n=2f+1 parties. Our protocols achieve an expected ...
Ouroboros-BFT: A Simple Byzantine Fault Tolerant Consensus Protocol
Byzantine Agreement Consensus
2018/11/2
We present a simple, deterministic protocol for ledger consensus that tolerates Byzantine faults. The protocol is executed by nn servers over a synchronous network and can tolerate any number tt of By...
ALGORAND AGREEMENT: Super Fast and Partition Resilient Byzantine Agreement
blockchain proof-of-stake consensus
2018/5/2
We present a simple Byzantine agreement protocol with leader election, that works under > 2/3 honest majority and does not rely on the participants having synchronized clocks. When honest messages are...
The problem of Byzantine Agreement (BA) is of interest to both distributed computing and cryptography community. Following well-known results from the distributed computing literature, BA problem in t...
Combining Asynchronous and Synchronous Byzantine Agreement: The Best of Both Worlds
cryptographic protocols Byzantine agreement
2018/3/9
In the problem of byzantine agreement (BA), a set of n parties wishes to agree on a value v by jointly running a distributed protocol. The protocol is deemed secure if it achieves this goal in spite o...
Solida: A Blockchain Protocol Based on Reconfigurable Byzantine Consensus
Reconfigurable Byzantine Consensus proof-of-work
2017/11/27
The decentralized cryptocurrency Bitcoin has experienced great success but also encountered many challenges. One of the challenges has been the long confirmation time. Another challenge is the lack of...
Algorand: Scaling Byzantine Agreements for Cryptocurrencies
Byzantine Agreement private keys
2017/5/26
Algorand is a new cryptocurrency system that can confirm transactions with latency on the order of a minute while scaling to many users. Algorand ensures that users never have divergent views of confi...
Practical Synchronous Byzantine Consensus
Byzantine state machine replication Byzantine agreement
2017/4/11
We present new protocols for Byzantine state machine replication and Byzantine agreement in the synchronous and authenticated setting. The celebrated PBFT state machine replication protocol tolerates ...
Optimal Extension Protocols for Byzantine Broadcast and Agreement
Byzantine Broadcast Byzantine Agreement Round complexity
2017/2/20
The problem of Byzantine Broadcast (BB) and Byzantine Agreement (BA) are of interest to both distributed computing and cryptography community. Often, these primitives require prohibitive communication...
SCP: A Computationally-Scalable Byzantine Consensus Protocol For Blockchains
consensus protocol byzantine agreement cryptocurrency
2015/12/18
In this paper, we design a new blockchain Byzantine
consensus protocol SCP where the throughput scales nearly linearly
with the computation: the more computing power available,
the more blocks sele...
All known protocols implementing broadcast from synchronous point-to-point channels tolerating any $t < n$ Byzantine corruptions have communication complexity at least $\Omega(\ell n^2)$. We give cryp...