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.
Multi-hop Byzantine Reliable Broadcast Made Practical / Bonomi, Silvia; Farina, Giovanni; Tixeuil, Sébastien. - (2018), pp. 155-160. (Intervento presentato al convegno 8th Latin-American Symposium on Dependable Computing, LADC 2018 tenutosi a Foz do Iguacu; Brazil) [10.1109/LADC.2018.00026].
Multi-hop Byzantine Reliable Broadcast Made Practical
Silvia Bonomi;Giovanni Farina
;
2018
Abstract
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.| File | Dimensione | Formato | |
|---|---|---|---|
|
Bonomi_Multi-hop_2018.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
457.7 kB
Formato
Adobe PDF
|
457.7 kB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
