2 citations · 2 across the 3 of their papers we have counts for
8 papers · 1 filter
Prefix Consensus For Censorship Resistant BFT
Zhuolun Xiang, Andrei Tonkikh, Alexander Spiegelman
Despite broad adoption of BFT consensus in blockchains, censorship resistance remains weak: existing designs offer limited inclusion guarantees and allow leaders to exclude transac…
DAGs for the Masses
Michael Anoprenko, Andrei Tonkikh, Alexander Spiegelman +3
A recent approach to building consensus protocols on top of Directed Acyclic Graphs (DAGs) shows much promise due to its simplicity and stable throughput. However, as each node in…
Raptr: Prefix Consensus for Robust High-Performance BFT
Andrei Tonkikh, Balaji Arun, Zhuolun Xiang +2
In this paper, we present Raptr--a Byzantine fault-tolerant state machine replication (BFT SMR) protocol that combines strong robustness with high throughput, while attaining near-…
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…
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…
Revisiting Optimal Resilience of Fast Byzantine Consensus (Extended Version)
Petr Kuznetsov, Andrei Tonkikh, Yan X Zhang
It is a common belief that Byzantine fault-tolerant solutions for consensus are significantly slower than their crash fault-tolerant counterparts. Indeed, in PBFT, the most widely…