Dumbo: Faster asynchronous bft protocols

B Guo, Z Lu, Q Tang, J Xu, Z Zhang - Proceedings of the 2020 ACM …, 2020 - dl.acm.org
HoneyBadgerBFT, proposed by Miller et al.[34] as the first practical asynchronous atomic
broadcast protocol, demonstrated impressive performance. The core of HoneyBadgerBFT …

Red belly: A secure, fair and scalable open blockchain

T Crain, C Natoli, V Gramoli - 2021 IEEE Symposium on …, 2021 - ieeexplore.ieee.org
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 …

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 …

Practical asynchronous distributed key generation

S Das, T Yurek, Z **ang, A Miller… - … IEEE Symposium on …, 2022 - ieeexplore.ieee.org
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 …

Asymptotically optimal validated asynchronous byzantine agreement

I Abraham, D Malkhi, A Spiegelman - … of the 2019 ACM Symposium on …, 2019 - dl.acm.org
We provide a new protocol for Validated Asynchronous Byzantine Agreement in the
authenticated setting. Validated (multi-valued) Asynchronous Byzantine Agreement is a key …

Dbft: Efficient leaderless byzantine consensus and its application to blockchains

T Crain, V Gramoli, M Larrea… - 2018 IEEE 17th …, 2018 - ieeexplore.ieee.org
This paper introduces a new leaderless Byzantine consensus called the Democratic
Byzantine Fault Tolerance (DBFT) for blockchains. While most blockchain consensus …

FIN: practical signature-free asynchronous common subset in constant time

S Duan, X Wang, H Zhang - Proceedings of the 2023 ACM SIGSAC …, 2023 - dl.acm.org
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 …

Asynchronous Distributed Key Generation for Computationally-Secure Randomness, Consensus, and Threshold Signatures.

E Kokoris Kogias, D Malkhi, A Spiegelman - Proceedings of the 2020 …, 2020 - dl.acm.org
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 …

Asynchronous consensus without trusted setup or public-key cryptography

S Das, S Duan, S Liu, A Momose, L Ren… - Proceedings of the 2024 …, 2024 - dl.acm.org
Byzantine consensus is a fundamental building block in distributed cryptographic problems.
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 …