Abstract
Modern large-scale networks require the ability to withstand
arbitrary failures (i.e., Byzantine failures).
Byzantine reliable broadcast algorithms can be used to reliably
disseminate information in the
presence of Byzantine failures.
We design a novel Byzantine reliable broadcast
protocol for loosely connected and synchronous networks.
While previous such protocols all assume correct senders,
our protocol is the first to handle Byzantine senders.
To achieve this goal, we have developed new techniques for
fault detection and fault tolerance.
Our protocol is efficient, and
under normal circumstances,
no expensive public-key cryptographic operations are used.
We implement and evaluate our protocol,
demonstrating that our protocol has high throughput
and is superior to the existing protocols in uncivil executions.