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

@article{Berman2005ClotureVD,
  title={Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds},
  author={P. Berman and J. 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… Expand
37 Citations
Simple and Efficient Oracle-Based Consensus Protocols for Asynchronous Byzantine Systems
  • 41
Simple and efficient oracle-based consensus protocols for asynchronous Byzantine systems
  • 34
  • Highly Influenced
Randomized View Reconciliation in Permissionless Distributed Systems
  • 11
  • PDF
Continuous Consensus with Ambiguous Failures
  • 3
  • PDF
Average Binary Long-Lived Consensus: Quantifying the Stabilizing Role Played by Memory
  • 4
  • PDF
Continuous consensus with ambiguous failures
  • 5
Round Complexity of Authenticated Broadcast with a Dishonest Majority
  • 44
  • PDF
Optimum Simultaneous Consensus for General Omissions Is Equivalent to an NP Oracle
  • 1
Randomized View Reconciliation in Permissionless Distributed Systems
  • 1
  • PDF
Average long-lived binary consensus: Quantifying the stabilizing role played by memory
  • 3
...
1
2
3
4
...

References

SHOWING 1-10 OF 20 REFERENCES
Towards optimal distributed consensus
  • 98
  • PDF
Coordinated traversal: (t+1)-round Byzantine agreement in polynomial time
  • Y. Moses, Orli Waarts
  • Computer Science
  • [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science
  • 1988
  • 45
  • PDF
Modular construction of an efficient 1-bit Byzantine agreement protocol
  • 6
Families of Consensus Algorithms
  • 18
Reaching Agreement in the Presence of Faults
  • 2,172
  • PDF
A Lower Bound for the Time to Assure Interactive Consistency
  • 493
  • PDF
Efficient agreement using fault diagnosis
  • B. Coan
  • Computer Science
  • Distributed Computing
  • 2005
  • 9
Early stopping in Byzantine agreement
  • 247
  • PDF
...
1
2
...