Common Contracts
1 similar null contracts
Toward Optimal-Complexity Hash-Based Asynchronous MVBA with Optimal ResilienceOctober 16th, 2024
leader(k)’s valid proposal v⋆(k) in a majority (> 3t+1 ) of the received stored messages. Instead, if the adversary corrupts the leader and makes it dissemi- nate an additional adversarial digest, that adversarial digest might appear in a majority. Crucially, however, it is guaranteed that every correct process pi re- ceives z⋆(k) in (at least) t + 1 received stored messages. Indeed, as at least (n t) t = 2t + 1 correct processes have stored z⋆(k), any set of n t = 3t + 1 stored messages must include at least (n t) + (n 2t) n = t + 1 messages for z⋆(k). Therefore, in Reducer, once a correct process pi receives n t = 3t + 1 stored messages, pi marks any digest received in at least t+1 such messages as a candidate digest. Concretely, each correct process pi has its local list candidatesi that initially contains all digests received in t+1 stored messages. Importantly, given that k is a good iteration, z⋆(k) belongs to the candidatesi list at every cor- rect process pi. Moreover, since 3t
