Multi-hop Byzantine Reliable Broadcast Made Practical

  • Silvia Bonomi Sapienza Università di Roma
  • Giovanni Farina Sorbonne Université
  • Sebastien Tixeuil Sorbonne Université

Resumo


We revisit Byzantine-tolerant reliable broadcast algorithms in multi-hop networks. To tolerate up to f Byzantine nodes, previous solutions require an exponential number of messages to be sent over the network. We propose optimizations that preserve the safety and liveness properties of the original algorithms, while highly decreasing their observed message complexity when simulated on two families of random graphs.
Palavras-chave: Reliable Broadcast, Byzantine Failures
Publicado
08/10/2018
Como Citar

Selecione um Formato
BONOMI, Silvia; FARINA, Giovanni; TIXEUIL, Sebastien. Multi-hop Byzantine Reliable Broadcast Made Practical. In: LATIN-AMERICAN SYMPOSIUM ON DEPENDABLE COMPUTING (LADC), 8. , 2018, Foz do Iguaçu. Anais [...]. Porto Alegre: Sociedade Brasileira de Computação, 2018 . p. 155-160.