Communication Dans Un Congrès Année : 2023

Faithful Simulation of Randomized BFT Protocols on Block DAGs

Résumé

Byzantine Fault-Tolerant (BFT) protocols that are based on Directed Acyclic Graphs (DAGs) are attractive due to their many advantages in asynchronous blockchain systems. These DAG-based protocols can be viewed as a simulation of some BFT protocol on a DAG. Many DAG-based BFT protocols rely on randomization, since they are used for agreement and ordering of transactions, 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. A DAG simulation of a randomized protocol should be faithful, in the sense that it precisely preserves the properties of the original BFT protocol, and in particular, their probability distributions. We argue that faithfulness is ensured by a forward simulation. We show how to faithfully simulate any BFT protocol that uses public coins and shared objects, like common coins.

Fichier principal
Vignette du fichier
concur23.pdf (672.74 Ko) Télécharger le fichier
Origine Fichiers éditeurs autorisés sur une archive ouverte
Licence

Dates et versions

hal-04465413 , version 1 (19-02-2024)

Licence

Identifiants

Citer

Hagit Attiya, Constantin Enea, Shafik Nassar. Faithful Simulation of Randomized BFT Protocols on Block DAGs. 34th International Conference on Concurrency Theory, {CONCUR} 2023,, Sep 2023, Antwerp, Belgium. ⟨10.4230/LIPIcs.CONCUR.2023.27⟩. ⟨hal-04465413⟩
103 Consultations
107 Téléchargements

Altmetric

Partager

  • More