Byzantine-Tolerant Reliable Broadcast in the Presence of Silent Churn
Résumé
This paper introduces a new reliable broadcast communication abstraction suited to n-process asynchronous message-passing systems in which up to t processes may behave arbitrarily (Byzantine processes) and where (due to transient disconnections or message losses) up to d correct processes may not receive a message broadcast by a correct (i.e., not Byzantine) process. Then the paper presents and proves correct an algorithm implementing such a communication abstraction where the system parameters n, t, and d are such that n>3t+2d.