Error-Free Multi-Valued Consensus with Byzantine Failures

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

2011-01-18

arxiv.org/abs/1101.3520v1

Computer Science

Distributed, Parallel, and Cluster Computing

Scientific paper

In this paper, we present an efficient deterministic algorithm for consensus in presence of Byzantine failures. Our algorithm achieves consensus on an $L$-bit value with communication complexity $O(nL + n^4 L^{0.5} + n^6)$ bits, in a network consisting of $n$ processors with up to $t$ Byzantine failures, such that $t

Affiliated with

Also associated with

No associations

Rating

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 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 Error-Free Multi-Valued Consensus with Byzantine Failures will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-287389