搜索结果: 1-15 共查到“Byzantine agreement”相关记录17条 . 查询时间(0.046 秒)
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.
In this paper, we introduce \emph{Polygraph}, the first accountable Byzantine consensus algorithm for partially synchronous systems. If among nn users t are malicious then it ensures consensus,...
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 ...
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...
Error-free Multi-valued Broadcast and Byzantine Agreement with Optimal Communication Complexity
Asynchronous ulti-valued A-cast Byzantine Agreement
2011/7/25
In this paper we present first ever error-free, asynchronous broadcast (called as A-cast) and Byzantine Agreement (called as ABA) protocols with optimal communication complexity and fault tolerance.
Error-free Multi-valued Broadcast and Byzantine Agreement with Optimal Communication Complexity
cryptographic protocols / Asynchronous Multi-valued, A-cast Byzantine Agreement Communication Complexity
2012/3/28
In this paper we present first ever error-free, asynchronous broadcast (called as A-cast) and Byzantine Agreement (called as ABA) protocols with optimal communication complexity and fault tolerance. O...
Studies on Verifiable Secret Sharing, Byzantine Agreement and Multiparty Computation
Verifiable Secret Byzantine Agreement Multiparty Computation
2010/7/13
In brief, our work in this thesis has made significant advancement in the state-of-the-art research on VSS, BA and MPC by presenting several inherent lower bounds and efficient/optimal solutions for t...
Communication Optimal Multi-Valued Asynchronous Broadcast and Asynchronous Byzantine Agreement
Asynchronous Broadcast Asynchronous Byzantine Agreement Unbounded Computing Power
2009/9/11
Asynchronous Broadcast (known as A-cast) and Asynchronous Byzantine Agreement (ABA)
are the fundamental primitives used as a building block in many asynchronous distributed crypto-
graphic tasks, su...
Simple and Efficient Asynchronous Byzantine Agreement with Optimal Resilience
Unbounded Computing Power VSS Byzantine Agreement
2009/6/9
Consider a completely asynchronous network consisting of n parties where every two parties
are connected by a private channel. An adversary At with unbounded computing power actively
controls at mos...
On the Number of Synchronous Rounds Required for Byzantine Agreement
Synchronous Rounds Byzantine Agreement non-deterministic case
2009/6/9
Byzantine agreement is typically considered with respect to either a fully synchronous
network or a fully asynchronous one. In the synchronous case, either t+1 deterministic
rounds are necessary in ...
Random Oracles in Constantinople:Practical Asynchronous Byzantine Agreement using Cryptography
Asynchronous Consensus Byzantine Faults Threshold Signatures
2009/4/17
Byzantine agreement requires a set of parties in a distributed system to agree on a value
even if some parties are corrupted. A new protocol for Byzantine agreement in a completely
asynchronous netw...
Extended Validity and Consistency in Byzantine Agreement
Extended Validity Consistency Byzantine Agreement
2009/4/14
A broadcast protocol allows a sender to distribute a value among a set of players such that
it is guaranteed that all players receive the same value (consistency), and if the sender is honest,
then ...