Fig. 17From: Multi-hop Byzantine reliable broadcast with honest dealer made practicalMulti-Shortest policy, Barababasi-Albert Network, bounded channels, f = ⌊(k−1)/2⌋. Message complexity, n=100,150,200(a) passive Byzantines, (b) active omniscient Byzantines. Broadcast latency, passive Byzantines (c) n=100, (d) n=150, (e) n=200Back to article page