缓解抢先交易攻击：通过公平且具有韧性的交易传播机制
Mitigating Front-Running Attacks through Fair and Resilient Transaction Dissemination
- Univ. of Luxembourg（卢森堡大学）
- Delft University of Technology（代尔夫特理工大学）
- Univ. Bordeaux, CNRS, Bordeaux-INP, LaBRI UMR5800（波尔多大学，法国国家科学研究中心，波尔多理工学院，LaBRI实验室）
机构由 AI 辅助整理，请以论文原文为准。
AI总结：
本文提出HERMES传播协议，通过随机化覆盖结构并强制节点证明合规，在内存池层面实现公平传播，有效缓解抢先交易攻击，并在许可链和无许可链上显著提升性能。
AI中文摘要：
在现代区块链中，高效、公平且容错的信息传播对于性能和安全性至关重要。交易生命周期的多个阶段受到影响，从交易的创建和传播，到共识层中区块的传播。内存池协议（如L{Ø}）已经解决了现代区块链的部分安全威胁。然而，除非将公平性最根本地嵌入到这些协议用于共享交易和区块以及协调内存池的传播层中，否则其他威胁仍然存在。本文介绍了HERMES，一种新颖的内存池传播协议，它利用稳健的最小化结构来优化数据传播、平衡负载，并确保在故障和拜占庭行为者存在下的公平性。具体而言，我们通过随机化覆盖结构的选择，同时强制节点证明其遵守内存池的传播策略以及所做的随机选择，来应对抢先交易攻击。实验结果表明，与传统的广播协议相比，在许可链和无许可链上均实现了显著的性能提升。
英文摘要：
In modern blockchains, efficient, fair, and faulttolerant information dissemination is critical for performance and security. Several stages of the transaction lifecycle are affected, from the creation and dissemination of transactions to the dissemination of blocks in the consensus layer. Mempool protocols, such as L{Ø}, already address some of modern blockchains' security threats. However, others remain unless fairness is embedded most fundamentally in the dissemination layer used by these protocols to share transactions and blocks and to reconcile mempools. This paper introduces HERMES, a novel dissemination protocol for mempools that leverages robust minimal structures to optimize data propagation, balance load, and ensure fairness despite faults and Byzantine actors. Specifically, we address front-running attacks by randomizing the choice of an overlay structure while forcing nodes to prove adherence to the mempools' dissemination policies and the random choice made. Experimental results show significant performance improvements compared to traditional broadcast protocols for both permissioned and permissionless blockchains.
