Faithful Simulation of Randomized BFT Protocols on Block DAGs

Hagit Attiya; Constantin Enea; Shafik Nassar

Paper 2023/192

Faithful Simulation of Randomized BFT Protocols on Block DAGs

Hagit Attiya

, Technion – Israel Institute of Technology

Constantin Enea

, Computer Science Laboratory of the École Polytechnique

Shafik Nassar

, Technion – Israel Institute of Technology

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.

Metadata

Available format(s): PDF
Category: Applications
Publication info: Preprint.
Keywords: blockchain byzantine fault tolerant protocols distributed computing DAG
Contact author(s): nassarshafik @ gmail com
History: 2023-02-15: approved; 2023-02-14: received; See all versions
Short URL: https://ia.cr/2023/192
License: 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}
}