Near-Optimal Communication Byzantine Broadcast under Message Adversary Model
A new Byzantine Reliable Broadcast algorithm leverages erasure codes to achieve near-optimal $O(|m| + nkappa)$ communication complexity, securing asynchronous systems against message-dropping adversaries.
