Dumbo: Faster asynchronous bft protocols
HoneyBadgerBFT, proposed by Miller et al.[34] as the first practical asynchronous atomic
broadcast protocol, demonstrated impressive performance. The core of HoneyBadgerBFT …
broadcast protocol, demonstrated impressive performance. The core of HoneyBadgerBFT …
Red belly: A secure, fair and scalable open blockchain
Blockchain has found applications to track ownership of digital assets. Yet, several
blockchains were shown vulnerable to network attacks. It is thus crucial for companies to …
blockchains were shown vulnerable to network attacks. It is thus crucial for companies to …
From blockchain consensus back to Byzantine consensus
V Gramoli - Future Generation Computer Systems, 2020 - Elsevier
Consensus is a fundamental problem of distributed computing. While this problem has been
known to be unsolvable since 1985, existing protocols were designed these past three …
known to be unsolvable since 1985, existing protocols were designed these past three …
Practical asynchronous distributed key generation
Distributed Key Generation (DKG) is a technique to bootstrap threshold cryptosystems
without a trusted third party and is a building block to decentralized protocols such as …
without a trusted third party and is a building block to decentralized protocols such as …
Asymptotically optimal validated asynchronous byzantine agreement
We provide a new protocol for Validated Asynchronous Byzantine Agreement in the
authenticated setting. Validated (multi-valued) Asynchronous Byzantine Agreement is a key …
authenticated setting. Validated (multi-valued) Asynchronous Byzantine Agreement is a key …
Dbft: Efficient leaderless byzantine consensus and its application to blockchains
This paper introduces a new leaderless Byzantine consensus called the Democratic
Byzantine Fault Tolerance (DBFT) for blockchains. While most blockchain consensus …
Byzantine Fault Tolerance (DBFT) for blockchains. While most blockchain consensus …
FIN: practical signature-free asynchronous common subset in constant time
Asynchronous common subset (ACS) is a powerful paradigm enabling applications such as
Byzantine fault-tolerance (BFT) and multi-party computation (MPC). The most efficient ACS …
Byzantine fault-tolerance (BFT) and multi-party computation (MPC). The most efficient ACS …
Asynchronous Distributed Key Generation for Computationally-Secure Randomness, Consensus, and Threshold Signatures.
In this paper, we present the first Asynchronous Distributed Key Generation (ADKG)
algorithm which is also the first distributed key generation algorithm that can generate …
algorithm which is also the first distributed key generation algorithm that can generate …
Asynchronous consensus without trusted setup or public-key cryptography
Byzantine consensus is a fundamental building block in distributed cryptographic problems.
Despite decades of research, most existing asynchronous consensus protocols require a …
Despite decades of research, most existing asynchronous consensus protocols require a …
[BOOK][B] Fault-tolerant message-passing distributed systems: an algorithmic approach
M Raynal - 2018 - books.google.com
This book presents the most important fault-tolerant distributed programming abstractions
and their associated distributed algorithms, in particular in terms of reliable communication …
and their associated distributed algorithms, in particular in terms of reliable communication …