# Trading off t-Resilience for Efficiency in Asynchronous Byzantine Reliable Broadcast

arXiv: https://arxiv.org/abs/1510.06882 · HTML: https://mlsanity.com/paper/1510.06882/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 23 Oct 2015.

## Built on by (most cited first, 1 of 1)

- [Learning to generate Reliable Broadcast Algorithms](https://mlsanity.com/paper/2208.00525/) (2022)

## Abstract (arXiv)

This paper presents a simple and efficient reliable broadcast algorithm for asynchronous message-passing systems made up of n processes, among which up to t<n/5 may behave arbitrarily (Byzantine processes). This algorithm requires two communication steps and n2-1 messages. When compared to Bracha's algorithm, which is resilience optimal (t<n/3) and requires three communication steps and 2n2-n-1 messages, the proposed algorithm shows an interesting tradeoff between communication efficiency and t-resilience.