Asynchronous Byzantine Atomic Broadcast (ABAB) promises, in comparison to partially synchronous approaches, simplicity in implementation, increased performance, and increased robustness. For partially synchronous approaches, it is well-known that small Trusted Execution Environments (TEE), e.g., MinBFT's unique sequential identifier generator (USIG), are capable of reducing the communication effort while increasing the fault tolerance. For ABAB, the research community assumes that the use of TEEs increases performance and robustness. However, despite the existence of a fault-model compiler, a concrete TEE-based approach is not directly available yet. In this brief announcement, we show that the recently proposed DAG-Rider approach can be transformed to provide ABAB with $n\geq 2f+1$ processes, of which $f$ are faulty. We leverage MinBFT's USIG to implement Reliable Broadcast with $n>f$ processes and show that the quorum-critical proofs of DAG-Rider still hold when adapting the quorum size to $\lfloor \frac{n}{2} \rfloor + 1$.

翻译：异步拜占庭原子广播（ABAB）与部分同步方法相比，具有实现简单、性能更优及鲁棒性更强的优势。针对部分同步方法，已有研究表明，小型可信执行环境（TEE，如MinBFT的惟一序列标识生成器USIG）能够在降低通信开销的同时提升容错能力。对于ABAB，学术界认为TEE的使用可提升性能与鲁棒性，然而尽管存在故障模型编译器，目前尚未直接提出基于TEE的具体方案。在本简报中，我们证明近期提出的DAG-Rider方法可被改造为支持$n\geq 2f+1$个进程（其中$f$为拜占庭故障进程）的ABAB。我们利用MinBFT的USIG实现了$n>f$个进程下的可靠广播，并证明当将仲裁大小调整为$\lfloor \frac{n}{2} \rfloor + 1$时，DAG-Rider的仲裁关键证明依然成立。