5 citations · 6 across the 2 of their papers we have counts for
3 papers
cs.DC2023★ 1 cited
Swiper: a new paradigm for efficient weighted distributed protocols
Andrei Tonkikh, Luciano Freitas
The majority of fault-tolerant distributed algorithms are designed assuming a nominal corruption model, in which at most a fraction of parties can be corrupted by the adversa…
cs.CR2022★ 5 cited
Homomorphic Sortition -- Secret Leader Election for PoS Blockchains
Luciano Freitas, Andrei Tonkikh, Adda-Akram Bendoukha +4
In a single secret leader election protocol (SSLE), one of the system participants is chosen and, unless it decides to reveal itself, no other participant can identify it. SSLE has…
cs.DC2022
Distributed Randomness from Approximate Agreement
Luciano Freitas, Petr Kuznetsov, Andrei Tonkikh
Randomisation is a critical tool in designing distributed systems. The common coin primitive, enabling the system members to agree on an unpredictable random number, has proven to…