Multi-hop Byzantine Reliable Broadcast Made Practical

Abstract : We revisit Byzantine tolerant reliable broadcast algorithms in multi-hop networks. To tolerate up to f Byzantine nodes, previous solutions require a factorial number of messages to be sent over the network if the messages are not authenticated (e.g. digital signatures are not available). We propose optimizations that preserve the safety and liveness properties of the original unauthenticated protocols, while highly decreasing their observed message complexity when simulated on several classes of graph topologies.
Complete list of metadatas
Contributor : Giovanni Farina <>
Submitted on : Thursday, March 21, 2019 - 11:28:49 AM
Last modification on : Tuesday, May 14, 2019 - 10:12:54 AM


Files produced by the author(s)


  • HAL Id : hal-01826865, version 2
  • ARXIV : 1903.08988


Silvia Bonomi, Giovanni Farina, Sébastien Tixeuil. Multi-hop Byzantine Reliable Broadcast Made Practical. [Technical Report] Sorbonne Université, CNRS, Laboratoire d'Informatique de Paris 6, LIP6, F-75005 Paris, France; Dipartimento di Ingegneria Informatica Automatica e Gestionale "Antonio Ruberti'', Sapienza Università di Roma, Rome, Italy. 2019. ⟨hal-01826865v2⟩



Record views


Files downloads