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.
Dettaglio pubblicazione
2018, 2018 Eighth Latin-American Symposium on Dependable Computing (LADC), Pages 155-160
Multi-hop Byzantine Reliable Broadcast Made Practical (04b Atto di convegno in volume)
Bonomi Silvia, Farina Giovanni, Tixeuil Sébastien
ISBN: 978-153868489-4
Gruppo di ricerca: Distributed Systems
keywords