Broadcasting with locally bounded Byzantine faults

erved Background and problem. As communication net works grow in size, they become increasingly v nerable to component failures. Thus it is import to design fault-tolerant communication algorithms namely, algorithms that work correctly despite t existence of such faults in the network and witho knowing their location. Among all types of fault Byzantine faults model a wors t-case fault scenario faulty components can behave arbitrarily (even m liciously) as transmitters, by either stopping, rero ing, or altering transmitted messages in a way m detrimental to the communication process. Byzan failures that exhibit all these kinds of damaging beh ior rarely occur in practice. They may be caused b