Byzantine-Tolerant Reliable Broadcast in the Presence of Silent Churn - Archive ouverte HAL Access content directly
Conference Papers Year : 2021

Byzantine-Tolerant Reliable Broadcast in the Presence of Silent Churn

(1, 2, 3) , (1, 2, 3) , (1, 2, 3) , (1, 2, 3)
1
2
3

Abstract

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.
Not file

Dates and versions

hal-03515541 , version 1 (06-01-2022)

Identifiers

Cite

Davide Frey, Timothé Albouy, Michel Raynal, François Taïani. Byzantine-Tolerant Reliable Broadcast in the Presence of Silent Churn. SSS 2021 - 23rd International Symposium on Stabilizing, Safety, and Security of Distributed Systems, Nov 2021, Virtual, France. pp.21-33, ⟨10.1007/978-3-030-91081-5_2⟩. ⟨hal-03515541⟩
44 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More