5 citations · 14 across the 9 of their papers we have counts for
12 papers
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…
CryptoConcurrency: (Almost) Consensusless Asset Transfer with Shared Accounts
Andrei Tonkikh, Pavel Ponomarev, Petr Kuznetsov +1
A typical blockchain protocol uses consensus to make sure that mutually mistrusting users agree on the order in which their operations on shared data are executed. However, it is k…
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…
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…
RandSolomon: Optimally Resilient Random Number Generator with Deterministic Termination
Luciano Freitas de Souza, Andrei Tonkikh, Sara Tucci-Piergiovanni +4
Multi-party random number generation is a key building-block in many practical protocols. While straightforward to solve when all parties are trusted to behave correctly, the probl…
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…
Asynchronous Reconfiguration with Byzantine Failures
Petr Kuznetsov, Andrei Tonkikh
Replicated services are inherently vulnerable to failures and security breaches. In a long-running system, it is, therefore, indispensable to maintain a reconfiguration mechanism t…
Online Payments by Merely Broadcasting Messages (Extended Version)
Daniel Collins, Rachid Guerraoui, Jovan Komatovic +7
We address the problem of online payments, where users can transfer funds among themselves. We introduce Astro, a system solving this problem efficiently in a decentralized, determ…
Dynamic Byzantine Reliable Broadcast [Technical Report]
Rachid Guerraoui, Jovan Komatovic, Petr Kuznetsov +3
Reliable broadcast is a communication primitive guaranteeing, intuitively, that all processes in a distributed system deliver the same set of messages. The reason why this primitiv…