Optimal Asynchronous Byzantine Consensus with Fair Separability

ePrint Report: Optimal Asynchronous Byzantine Consensus with Fair Separability

Vincent Gramoli, Zhenliang Lu, Qiang Tang, Pouriya Zarbafian

Despite ensuring both consistency and liveness, state machine replication protocols remain vulnerable to adversaries who manipulate the transaction order. To address this, researchers have proposed order-fairness techniques that rely either on building dependency graphs between transactions, or on assigning sequence numbers to transactions. Existing protocols that handle dependency graphs suffer from sub-optimal performance, resilience, or security.
On the other hand, Pompe (OSDI '20) …

address adversaries asynchronous building consistency dependency eprint report fair fairness graphs machine order protocols replication report researchers state state machine tang techniques transaction transactions vulnerable