English

New Efficient Error-Free Multi-Valued Consensus with Byzantine Failures

Distributed, Parallel, and Cluster Computing 2011-06-10 v1

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".

Keywords

Cite

@article{arxiv.1106.1846,
  title  = {New Efficient Error-Free Multi-Valued Consensus with Byzantine Failures},
  author = {Guanfeng Liang and Nitin Vaidya},
  journal= {arXiv preprint arXiv:1106.1846},
  year   = {2011}
}
R2 v1 2026-06-21T18:20:05.454Z