New Efficient Error-Free Multi-Valued Consensus with Byzantine Failures
classification
💻 cs.DC
keywords
consensusbyzantinemulti-valuedachievesalgorithmsefficienterror-freefailures
read the original 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".
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.