Signature-Free Asynchronous Binary Byzantine Consensus with t

摘要: This article is on broadcast and agreement in asynchronous message-passing systems made up of n processes, where to t processes may have a Byzantine Behavior. Its first contribution powerful, yet simple, all-to-all communication abstraction suited binary values. abstraction, which copes with n/3 allows each process value, obtain set values such that (1) no value only by can belong the correct process, (2) if obtained contains single v, then any v. The second this new round-based consensus algorithm processes. based previous weak common coin. In addition being signature-free optimal respect t, has several noteworthy properties: expected number rounds decide constant; round composed constant steps involves O(n2) messages; message plus bits. Moreover, tolerates reordering adversary (i.e., processes).