Asynchronous Byzantine Atomic Broadcast (ABAB) promises simplicity in implementation as well as increased performance and robustness in comparison to partially synchronous approaches. We adapt the recently proposed DAG-Rider approach to achieve ABAB with $n\geq 2f+1$ processes, of which $f$ are faulty, with only a constant increase in message size. We leverage a small Trusted Execution Environment (TEE) that provides a unique sequential identifier generator (USIG) to implement Reliable Broadcast with $n>f$ processes and show that the quorum-critical proofs still hold when adapting the quorum size to $\lfloor \frac{n}{2} \rfloor + 1$. This first USIG-based ABAB preserves the simplicity of DAG-Rider and serves as starting point for further research on TEE-based ABAB.

翻译：摘要：异步拜占庭原子广播（ABAB）与部分同步方法相比，具有实现简单、性能更高和鲁棒性更强的优势。我们改进了近期提出的DAG-Rider方法，在仅增加消息大小的常量开销下，实现了包含$f$个失效节点的$n\geq 2f+1$进程的ABAB。我们利用提供唯一顺序标识符生成器（USIG）的小型可信执行环境（TEE），实现了$n>f$进程的可靠广播，并证明了当仲裁大小调整为$\lfloor \frac{n}{2} \rfloor + 1$时，仲裁关键性证明仍然成立。这一首个基于USIG的ABAB保留了DAG-Rider的简洁性，并可作为进一步研究基于TEE的ABAB的起点。