New Efficient Error-Free Multi-Valued Consensus with Byzantine Failures
Guanfeng Liang, Nitin Vaidya
TL;DR
This paper presents two new algorithms for multi-valued Byzantine consensus, improving efficiency over previous methods and achieving different validity guarantees in distributed systems.
Contribution
Introduces two novel algorithms for multi-valued Byzantine consensus, one with traditional validity and another with stronger q-validity, enhancing efficiency.
Findings
Algorithms are more efficient than previous solutions
One algorithm achieves traditional validity
Another achieves stronger q-validity
Abstract
In this report, we investigate the multi-valued Byzantine consensus problem. We introduce two algorithms: the first one achieves traditional validity requirement for consensus, and the second one achieves a stronger "q-validity" requirement. Both algorithms are more efficient than the ones introduces in our recent PODC 2011 paper titled "Error-Free Multi-Valued Consensus with Byzantine Failures".
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed systems and fault tolerance · Logic, Reasoning, and Knowledge · Cryptography and Data Security