1 paper
Andrei Tonkikh, Luciano Freitas
The majority of fault-tolerant distributed algorithms are designed assuming a nominal corruption model, in which at most a fraction fn of parties can be corrupted by the adversa…