Quick Order Fairness
Quick Order Fairness
复制标题
快速订单公平性
DOI：
10.1007/978-3-031-18283-9_15
复制
发表时间：
2021
影响因子：
16.6
通讯作者：
Nathalie Steinhauer
中科院分区：
文献类型：
--
作者：
C. Cachin;Jovana Mi'ci'c;Nathalie Steinhauer
基于领导者的共识协议，即原子广播允许某些进程单方面影响事务的最终顺序。这已经成为区块链网络和去中心化金融的一个问题，因为它促进了前端运行和其他攻击。为了解决这个问题，最近引入了有效载荷消息的顺序公平性作为原子广播的新的安全属性，以补充传统的协议和活性。我们与秩序公平的共识协议的标准有效性概念，并强调现有的形式化的一些局限性。在此基础上，我们引入了一个新的微分阶公平属性，解决了这些问题。我们还提出了快速订单公平原子广播协议，保证有效载荷的消息传递在一个差异公平的顺序，是比现有的订单公平的共识协议更有效。它适用于异步和最终同步的网络，具有最佳的弹性，容忍高达三分之一的进程损坏。以前的解决方案要求故障少于四分之一。此外，我们的协议只会产生二次成本，在摊销的消息复杂性，每个交付的有效载荷。
Leader-based protocols for consensus, i.e., atomic broadcast, allow some processes to unilaterally affect the final order of transactions. This has become a problem for blockchain networks and decentralized finance because it facilitates front-running and other attacks. To address this, order fairness for payload messages has been introduced recently as a new safety property for atomic broadcast complementing traditional agreement and liveness. We relate order fairness to the standard validity notions for consensus protocols and highlight some limitations with the existing formalization. Based on this, we introduce a new differential order fairness property that fixes these issues. We also present the quick order-fair atomic broadcast protocol that guarantees payload message delivery in a differentially fair order and is much more efficient than existing order-fair consensus protocols. It works for asynchronous and for eventually synchronous networks with optimal resilience, tolerating corruptions of up to one third of the processes. Previous solutions required there to be less than one fourth of faults. Furthermore, our protocol incurs only quadratic cost, in terms of amortized message complexity per delivered payload.