Simple Protocols for Byzantine Broadcast (1)
f = 1 即只有一个Byzantine节点
- t=0, sender发送v*并签名
- t=1, 所有节点接收到v*并签名，同时echo至其他节点
- t=2, 每个节点根据majority vote决定output
假设n>=4，honest non-sender接收到
- v* from the honest sender
- v* echo from n-3 other honest non-senders
- in total n-2 votes for v*
- n-2 > 1 byzantine node
- 满足validity，即honest sender情况下可以正确输出
如果是byzantine sender，意味着non-sender都是honest，t-1同样echo，t-2获得相同votes，输出一致，满足agreement