A survey on consensus mechanisms and mining strategy management in blockchain networks
The past decade has witnessed the rapid evolution in blockchain technologies, which has
attracted tremendous interests from both the research communities and industries. The …
attracted tremendous interests from both the research communities and industries. The …
Bft in blockchains: From protocols to use cases
A blockchain is a distributed system that achieves strong security guarantees in storing,
managing, and processing data. All blockchains achieve a common goal: building a …
managing, and processing data. All blockchains achieve a common goal: building a …
All you need is dag
We present DAG-Rider, the first asynchronous Byzantine Atomic Broadcast protocol that
achieves optimal resilience, optimal amortized communication complexity, and optimal time …
achieves optimal resilience, optimal amortized communication complexity, and optimal time …
Spectre: A fast and scalable cryptocurrency protocol
A growing body of research on Bitcoin and other permissionless cryptocurrencies that utilize
Nakamoto's blockchain has shown that they do not easily scale to process a high throughput …
Nakamoto's blockchain has shown that they do not easily scale to process a high throughput …
Dumbo-mvba: Optimal multi-valued validated asynchronous byzantine agreement, revisited
Multi-valued validated asynchronous Byzantine agreement (MVBA), proposed in the elegant
work of Cachin et al.(CRYPTO'01), is fundamental for critical fault-tolerant services such as …
work of Cachin et al.(CRYPTO'01), is fundamental for critical fault-tolerant services such as …
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 …
[LIVRE][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 …
Speeding dumbo: Pushing asynchronous bft closer to practice
Asynchronous BFT consensus can implement robust mission-critical decentralized services
in the unstable or even adversarial wide-area network without relying on any form of timing …
in the unstable or even adversarial wide-area network without relying on any form of timing …
Pace: Fully parallelizable bft from reproposable byzantine agreement
H Zhang, S Duan - Proceedings of the 2022 ACM SIGSAC Conference …, 2022 - dl.acm.org
The classic asynchronous Byzantine fault tolerance (BFT) framework of Ben-Or, Kemler, and
Rabin (BKR) and its descendants rely on reliable broadcast (RBC) and asynchronous binary …
Rabin (BKR) and its descendants rely on reliable broadcast (RBC) and asynchronous binary …