### Faithful Simulation of Randomized BFT Protocols on Block DAGs

##### Abstract

Byzantine Fault-Tolerant (BFT) protocols that are based on Directed Acyclic Graphs (DAGs) are attractive due to their many advantages in asynchronous blockchain systems. Many DAG-based BFT protocols rely on randomization, since they are used for agreement and ordering of transaction, which cannot be achieved deterministically in asynchronous systems. Randomization is achieved either through local sources of randomness, or by employing shared objects that provide a common source of randomness, e.g., common coins. This paper shows how to simulate DAG-based BFT protocols that use public coins and shared objects, like common coins. Our simulation is faithful in the sense that it precisely preserves the safety and liveness properties of the original BFT protocol, and in particular, their probability distributions.

Available format(s)
Category
Applications
Publication info
Preprint.
Keywords
blockchainbyzantine fault tolerant protocolsdistributed computingDAG
Contact author(s)
nassarshafik @ gmail com
History
2023-02-15: approved
See all versions
Short URL
https://ia.cr/2023/192

CC BY

BibTeX

@misc{cryptoeprint:2023/192,
author = {Hagit Attiya and Constantin Enea and Shafik Nassar},
title = {Faithful Simulation of Randomized BFT Protocols on Block DAGs},
howpublished = {Cryptology ePrint Archive, Paper 2023/192},
year = {2023},
note = {\url{https://eprint.iacr.org/2023/192}},
url = {https://eprint.iacr.org/2023/192}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.