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
- Computer Science
- IEEE Trans. Dependable Secur. Comput.
- 2005
- 41
Simple and efficient oracle-based consensus protocols for asynchronous Byzantine systems
- Computer Science
- Proceedings of the 23rd IEEE International Symposium on Reliable Distributed Systems, 2004.
- 2004
- 34
- Highly Influenced
Randomized View Reconciliation in Permissionless Distributed Systems
- Computer Science
- IEEE INFOCOM 2018 - IEEE Conference on Computer Communications
- 2018
- 11
- PDF
Average Binary Long-Lived Consensus: Quantifying the Stabilizing Role Played by Memory
- Mathematics, Computer Science
- SIROCCO
- 2008
- 4
- PDF
Round Complexity of Authenticated Broadcast with a Dishonest Majority
- Computer Science
- 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07)
- 2007
- 44
- PDF
Optimum Simultaneous Consensus for General Omissions Is Equivalent to an NP Oracle
- Computer Science
- DISC
- 2009
- 1
Randomized View Reconciliation in Permissionless Distributed Systems
- Computer Science
- IEEE/ACM Transactions on Networking
- 2020
- 1
- PDF
Average long-lived binary consensus: Quantifying the stabilizing role played by memory
- Computer Science
- Theor. Comput. Sci.
- 2010
- 3
References
SHOWING 1-10 OF 20 REFERENCES
Towards optimal distributed consensus
- Computer Science
- 30th Annual Symposium on Foundations of Computer Science
- 1989
- 98
- PDF
Coordinated traversal: (t+1)-round Byzantine agreement in polynomial time
- 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
- Computer Science
- Mathematical systems theory
- 2005
- 6
A Lower Bound for the Time to Assure Interactive Consistency
- Computer Science
- Inf. Process. Lett.
- 1982
- 493
- PDF