Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds

@article{Berman2005ClotureVD,
  title={Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds},
  author={Piotr Berman and Juan A. Garay},
  journal={Mathematical systems theory},
  year={2005},
  volume={26},
  pages={3-19}
}
AbstractTheDistributed Consensus problem involvesn processors each of which holds an initial binary value. At mostt processors may be faulty and ignore any protocol (even behaving maliciously), yet it is required that the nonfaulty processors eventually agree on a value that was initially held by one of them. We measure the quality of a consensus protocol using the following parameters; total number of processorsn, number of rounds of message exchanger, and maximal message sizem. The known… 
View on Springer
wikidata.org
40 Citations
Highly Influential Citations
5
Background Citations
18
Methods Citations
9

40 Citations

Citation Type

Citation Type

Simple and efficient oracle-based consensus protocols for asynchronous Byzantine systems
TLDR
Two families of Byzantine asynchronous consensus protocols are presented, designed to be particularly simple and efficient in terms of communication steps, the number of messages they generate in each step, and the size of messages.
Randomized View Reconciliation in Permissionless Distributed Systems
TLDR
This paper proposes a novel view reconciliation protocol with a time complexity of only $\Theta(\frac{\ln N}{\ln\ln N})$ and aggressively exploit randomization to achieve an exponential improvement.
Continuous Consensus with Ambiguous Failures
TLDR
The continuous consensus problem in the face of harsher failures: general omissions and authenticated Byzantine failures is considered, and a weaker form of uniform CC is defined, and protocols achieving it are presented.
Average Binary Long-Lived Consensus: Quantifying the Stabilizing Role Played by Memory
TLDR
The results are average case versions of previous works where the sequence of input vectors was assumed to be, in addition to smooth, geodesic: the i-th entry of the input vector was allowed to change at most once over the sequence.
Round Complexity of Authenticated Broadcast with a Dishonest Majority
TLDR
This work presents a randomized broadcast protocol that runs in expected O(k2) rounds and obtains expected constant-round pivtocols for t = n/2 + O(1), and shows upper/lower bounds on how much randomization can help.
Optimum Simultaneous Consensus for General Omissions Is Equivalent to an NP Oracle
  • Y. Moses
  • Computer Science, Mathematics
    DISC
  • 2009
The general omissions failure model, in which a faulty process may omit both to send and to receive messages is inherently more complex than the more popular sending omissions model. This fact is…
Randomized View Reconciliation in Permissionless Distributed Systems
TLDR
This paper proposes a novel view reconciliation protocol whose time complexity is only <inline-formula> <tex-math notation="LaTeX">$\Theta ({\ln N}/{\ln \ln N})$ </tex- maths> time complexity, and aggressively exploit randomization.
Average long-lived binary consensus: Quantifying the stabilizing role played by memory
Average Binary Long-Lived Consensus and the Stabilizing Role Played by Memory ∗
TLDR
The results are average case versions of previous works where the sequence of input vectors was assumed to be, in addition to smooth, geodesic: the i-th entry of the input vector was allowed to change at most once over the sequence.
Fast Agreement in Networks with Byzantine Nodes
TLDR
An algorithm for Consensus running in time t + D2t with nodes subject to Byzantine faults, and a lower bound on the running time of any deterministic solution to Consensus in (t + 1)-connected networks, if t nodes may crash.
...
...

References

SHOWING 1-10 OF 20 REFERENCES
Towards optimal distributed consensus
TLDR
Three protocols that take further steps in this direction are presented, one of which is asymptotically optimal in all three quality parameters while using the optimal number of processors.
Modular construction of nearly optimal Byzantine agreement protocols
TLDR
The new protocol is constructed by recursively applying a simple, yet general, transformation that changes the rounds and total message bits required by a Byzantine agreement protocol, but preserves correctness, number of processor faults tolerated, and total number of processors.
Coordinated traversal: (t+1)-round Byzantine agreement in polynomial time
  • Y. Moses, Orli Waarts
  • Computer Science, Mathematics
    [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science
  • 1988
The problem of efficiently performing Byzantine agreement in t+1 rounds in the face of arbitrarily malicious failures is treated. A communication-efficient polynomial-time protocol is presented for…
Modular construction of an efficient 1-bit Byzantine agreement protocol
  • B. Coan, J. Welch
  • Computer Science, Mathematics
    Mathematical systems theory
  • 2005
TLDR
This paper presents a new Byzantine agreement protocol that toleratest processor faults using O(t·logt) processors,t + 1 rounds,O(t2 +o·t) total message bits, and messages of maximum size 1 bit, which is the first Byzantine agreement Protocol that is simultaneously optimal in rounds, messagebits, and message size.
Families of Consensus Algorithms
TLDR
Two families of algorithms are presented, each achieving the lower bound for one parameter and a trade-off between the other two, based on a very simple algorithm with (2t+1) processors using the minimal number of rounds and the minimal message size (one bit).
Efficient distributed consensus with n=(3 + ɛ)t processors
TLDR
The quality of a consensus protocol is measured by the total number of processors n, the number of rounds of message exchange r, and the communication complexity, given by the maximal message size.
Reaching Agreement in the Presence of Faults
TLDR
It is shown that the problem is solvable for, and only for, n ≥ 3m + 1, where m is the number of faulty processors and n is the total number and this weaker assumption can be approximated in practice using cryptographic methods.
A Lower Bound for the Time to Assure Interactive Consistency
Efficient agreement using fault diagnosis
  • B. Coan
  • Computer Science
    Distributed Computing
  • 2005
TLDR
By adding explicit fault diagnosis to the first protocol, this protocol produces a some-what more complicated protocol that uses O(t1.5) processors, min(f+2,t+1) rounds, O(n·t2·f·log|V|) total message bits, andO(t·log |V |) maximum message size.
Early stopping in Byzantine agreement
TLDR
The number of rounds of message exchange required to reach Byzantine Agreement of either kind (BA), and an algorithm for EBA is presented that achieves the lower bound, provided that t is on the order of the square root of the total number of processors.
...
...