Andrei Tonkikh

Andrei Tonkikh
National Research University Higher School of Economics | HSE · School of Applied Mathematics and Information Science

Master of Science

About

12
Publications
402
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
45
Citations
Citations since 2017
12 Research Items
45 Citations
201720182019202020212022202305101520
201720182019202020212022202305101520
201720182019202020212022202305101520
201720182019202020212022202305101520

Publications

Publications (12)
Preprint
Full-text available
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. It is known, however, that asset transfer systems, by far the most popular application of blockchains, can be implemented without consensus. Assuming that no account can be accessed conc...
Preprint
Full-text available
In a secret single leader election protocol (SSLE), one of the system members is chosen as a leader and no other member can know who the leader is, unless she decides to reveal herself. Leader-election oracles are known to be instrumental in designing efficient consensus protocols, and one can expect that secret leader election may help in developi...
Preprint
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 be particularly useful. We observe, however, that it is impossible to implement a truly random common coin protocol in a fault-prone asynchronous system. To circumvent th...
Article
Full-text available
Replicated services are inherently vulnerable to failures and security breaches. In a long-running system, it is, therefore, indispensable to maintain a reconfiguration mechanism that would replace faulty replicas with correct ones. An important challenge is to enable reconfiguration without affecting the availability and consistency of the replica...
Preprint
Full-text available
Most modern asset transfer systems use consensus to maintain a totally ordered chain of transactions. It was recently shown that consensus is not always necessary for implementing asset transfer. More efficient, asynchronous solutions can be built using reliable broadcast instead of consensus. This approach has been originally used in the closed (p...
Preprint
Full-text available
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 known Byzantine fault-tolerant consensus protocol, it takes three message delays to decide a value, in contrast with just two in Paxos. This motivates the search for fast...
Preprint
Full-text available
Replicated services are inherently vulnerable to failures and security breaches. In a long-running system, it is, therefore, indispensable to maintain a \emph{reconfiguration} mechanism that would replace faulty replicas with correct ones. An important challenge is to enable reconfiguration without affecting the availability and consistency of the...
Preprint
Full-text available
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, deterministic, and completely asynchronous manner. Astro builds on the insight that consensus is unnecessary to prevent double-spending. Instead of consensus, Astro relies on a...

Network

Cited By