Blockchain-Enabled Decentralized Edge Intelligence for Trustworthy 6G Consumer Electronics

X Wang, A Shankar, K Li… - IEEE Transactions on …, 2024 - ieeexplore.ieee.org
As 6G communication technology advances, there is a growing trend of incorporating
blockchain technology, which has already demonstrated its effectiveness in multiple areas …

Shoal: Improving dag-bft latency and robustness

A Spiegelman, B Arun, R Gelashvili, Z Li - arxiv preprint arxiv:2306.03058, 2023 - arxiv.org
The Narwhal system is a state-of-the-art Byzantine fault-tolerant scalable architecture that
involves constructing a directed acyclic graph (DAG) of messages among a set of validators …

The Bedrock of Byzantine Fault Tolerance: A Unified Platform for {BFT} Protocols Analysis, Implementation, and Experimentation

MJ Amiri, C Wu, D Agrawal, A El Abbadi… - … USENIX Symposium on …, 2024 - usenix.org
Byzantine Fault-Tolerant (BFT) protocols cover a broad spectrum of design dimensions from
infrastructure settings, such as the communication topology, to more technical features, such …

Expected linear round synchronization: The missing link for linear byzantine smr

O Naor, I Keidar - Distributed Computing, 2024 - Springer
Abstract State Machine Replication (SMR) solutions often divide time into rounds, with a
designated leader driving decisions in each round. Progress is guaranteed once all correct …

Consensus in data management: From distributed commit to blockchain

F Nawab, M Sadoghi - Foundations and Trends® in …, 2023 - nowpublishers.com
The problem of distributed consensus has played a major role in the development of
distributed data management systems. This includes the development of distributed atomic …

Byzantine Consensus is\Theta (n^ 2): The Dolev-Reischuk Bound is Tight even in Partial Synchrony![Extended Version]

P Civit, MA Dzulfikar, S Gilbert, V Gramoli… - arxiv preprint arxiv …, 2022 - arxiv.org
The Dolev-Reischuk bound says that any deterministic Byzantine consensus protocol has
(at least) quadratic communication complexity in the worst case. While it has been shown …

Revisiting optimal resilience of fast byzantine consensus

P Kuznetsov, A Tonkikh, YX Zhang - … of the 2021 ACM Symposium on …, 2021 - dl.acm.org
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 …

Liveness and latency of Byzantine state-machine replication

M Bravo, G Chockler, A Gotsman - Distributed Computing, 2024 - Springer
Byzantine state-machine replication (SMR) ensures the consistency of replicated state in the
presence of malicious replicas and lies at the heart of the modern blockchain technology …

BeeGees: stayin'alive in chained BFT

N Giridharan, F Suri-Payer, M Ding, H Howard… - Proceedings of the …, 2023 - dl.acm.org
Modern chained Byzantine Fault Tolerant (BFT) systems leverage a combination of
pipelining and leader rotation to obtain both efficiency and fairness. These protocols …

Tenderbake--A Solution to Dynamic Repeated Consensus for Blockchains

L Aştefanoaei, P Chambart, A Del Pozzo… - arxiv preprint arxiv …, 2020 - arxiv.org
First-generation blockchains provide probabilistic finality: a block can be revoked, albeit the
probability decreases as the block sinks deeper into the chain. Recent proposals revisited …