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

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

2011-06-09

arxiv.org/abs/1106.1846v1

Computer Science

Distributed, Parallel, and Cluster Computing

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

New Efficient Error-Free Multi-Valued Consensus with Byzantine Failures does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with New Efficient Error-Free Multi-Valued Consensus with Byzantine Failures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and New Efficient Error-Free Multi-Valued Consensus with Byzantine Failures will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-580652