Authenticated Byzantine generals in dual failure model

  • Authors:

  • Anuj Gupta;Prasant Gopal;Piyush Bansal;Kannan Srinathan

  • Affiliations:

  • Center for Security, Theory and Algorithmic Research, International Institute of Information Technology, Hyderabad, India;Center for Security, Theory and Algorithmic Research, International Institute of Information Technology, Hyderabad, India;Center for Security, Theory and Algorithmic Research, International Institute of Information Technology, Hyderabad, India;Center for Security, Theory and Algorithmic Research, International Institute of Information Technology, Hyderabad, India

  • Venue:
  • ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 iff 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 can corrupt up to any tb players actively and control up to any other tp players passively. We prove that in such a setting, ABG over a completely connected synchronous network of n nodes tolerating a (tb, tp)-adversary is possible iff n 2tb+min(tb, tp) when tp 0. Interestingly, our results can also be seen as an attempt to unify the extant literature on BGP and ABG.