Fig. 7From: Multi-hop Byzantine reliable broadcast with honest dealer made practicalMulti-random policy n=100, f = ⌊(k−1)/2⌋ passive Byzantines, bounded channels, message complexity and broadcast latencyBack to article page