Swiper and Dora: efficient solutions to weighted distributed problems

ePrint Report: Swiper and Dora: efficient solutions to weighted distributed problems

Luciano Freitas, Andrei Tonkikh

The majority of fault-tolerant distributed algorithms are designed assuming a nominal corruption model, in which at most a fraction $f_n$ of parties can be corrupted by the adversary. However, due to the infamous Sybil attack, nominal models are not sufficient to express the trust assumptions in open (i.e., permissionless) settings. Instead, permissionless systems typically operate in a weighted model, where each participant is associated with …

adversary algorithms attack corruption distributed dora eprint report problems report solutions