Byzantine Agreement with Faulty Majority using Bounded Broadcast

Details Byzantine Agreement with Faulty Majority using Bounded Broadcast Byzantine Agreement with Faulty Majority using Bounded Broadcast

2000-12-26

arxiv.org/abs/cs/0012024v4

Computer Science

Distributed, Parallel, and Cluster Computing

4 pages; round-up gap between bounds removed

Scientific paper

Byzantine Agreement introduced in [Pease, Shostak, Lamport, 80] is a widely used building block of reliable distributed protocols. It simulates broadcast despite the presence of faulty parties within the network, traditionally using only private unicast links. Under such conditions, Byzantine Agreement requires more than 2/3 of the parties to be compliant. [Fitzi, Maurer, 00], constructed a Byzantine Agreement protocol for any compliant majority based on an additional primitive allowing transmission to any two parties simultaneously. They proposed a problem of generalizing these results to wider channels and fewer compliant parties. We prove that 2f < kh condition is necessary and sufficient for implementing broadcast with h compliant and f faulty parties using k-cast channels.

Affiliated with

Also associated with

No associations

Rating

Byzantine Agreement with Faulty Majority using Bounded Broadcast 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 Byzantine Agreement with Faulty Majority using Bounded Broadcast, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Byzantine Agreement with Faulty Majority using Bounded Broadcast will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-429223