Faithful simulation of randomized BFT protocols on block DAGs

DOI10.4230/LIPICS.CONCUR.2023.27MaRDI QIDQ6967319zbMATH OpenFDO

Authors Hagit Attiya, Constantin Enea, Shafik Nassar

Publication date 26 June 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.CONCUR.2023.27

zbMATH Keywords

Byzantine failuresforward simulationhyperproperties

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites work

• All You Need is DAG
• Byzantine agreement in polynomial time with near-optimal resilience
• Efficient and Adaptively Secure Asynchronous Binary Agreement via Binding Crusader Agreement
• Embedding a Deterministic BFT Protocol in a Block DAG
• Faithful simulation of randomized BFT protocols on block DAGs
• Fast asynchronous Byzantine agreement with optimal resilience
• Forward and backward simulations. I. Untimed Systems
• Linearizable implementations do not suffice for randomized distributed computation
• Putting strong linearizability in context: preserving hyperproperties in programs that use concurrent objects
• The Byzantine generals strike again
• Time, clocks, and the ordering of events in a distributed system
• Weak progressive forward simulation is necessary and sufficient for strong observational refinement

Cited in

(1)

• Faithful simulation of randomized BFT protocols on block DAGs

This page was built for publication: Faithful simulation of randomized BFT protocols on block DAGs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6967319)