Authenticated Byzantine Generals in Dual Failure Model

Pease et al. introduced the problem of Byzantine Generals (BGP) to study the effects of Byzantine faults in distributed protocols for reliable broadcast. It is well known that BGP among n players tolerating up to t faults is (efficiently) possible if and only if n > 3t. To overcome this severe limitation, Pease et al. introduced a variant of BGP, Authenticated Byzantine General (ABG). Here players are supplemented with digital signatures (or similar tools) to thwart the challenge posed by Byzantine faults. Subsequently, they proved that with the use of authentication, fault tolerance of protocols for reliable broadcast can be amazingly increased to n > t (which is a huge improvement over the n > 3t). Byzantine faults are the most generic form of faults. In a network not all faults are always malicious. Some faulty nodes may only leak their data while others are malicious. Motivated from this, we study the problem of ABG in (tb,tp)-mixed adversary model where the adversary ca...

• Type: Conference
• Year: 2010
• Where: ICDCN
• Authors: Anuj Gupta, Prasant Gopal, Piyush Bansal, Kannan Srinathan
• Keywords: Byzantine Faults, Byzantine General, Distributed Computing, ICDCN 2010, Reliable Broadcast