FairBlock: Preventing Blockchain Front-running with Minimal Overheads
FairBlock: Preventing Blockchain Front-running with Minimal Overheads
复制标题
DOI：
10.1007/978-3-031-25538-0_14
复制
发表时间：
2022
影响因子：
10.9
通讯作者：
Peyman Momeni;S. Gorbunov;Bohan Zhang-
中科院分区：
文献类型：
--
作者：
Peyman Momeni;S. Gorbunov;Bohan Zhang-
虽然区块链系统正在迅速普及，但抢先交易仍然是公平交易的主要障碍。在本文中，我们将展示如何应用基于身份的加密（IBE），以防止前端运行最小的带宽开销。在我们的方法中，要解密N个交易块，通过网络发送的消息数量只会随着解密委员会的大小S线性增长。也就是说，要解密一组在特定块上排序的N个交易，委员会只需要交换S个解密份额（与N无关）。相比之下，以前的解决方案是基于阈值解密方案的，其中块中的每个交易必须由委员会单独解密，导致带宽开销。沿着的方式，我们提出了一个公平块处理模型，并建立了一个原型实现。我们发现，在1000个验证器的1000条消息的样本上，我们的系统节省了42.53 MB的带宽，与标准阈值解密范式相比，节省了99.6%。
While blockchain systems are quickly gaining popularity, front-running remains a major obstacle to fair exchange. In this paper, we show how to apply identity-based encryption (IBE) to prevent front-running with minimal bandwidth overheads. In our approach, to decrypt a block ofNtransactions, the number of messages sent across the network only grows linearly with the size of decrypting committees,S. That is, to decrypt a set ofNtransactions sequenced at a specific block, a committee only needs to exchangeSdecryption shares (independent ofN). In comparison, previous solutions are based on threshold decryption schemes, where each transaction in a block must be decrypted separately by the committee, resulting in bandwidth overhead of. Along the way, we present a model for fair block processing and build a prototype implementation. We show that on a sample of 1000 messages with 1000 validators our system saves 42.53 MB of bandwidth which is 99.6% less compared with the standard threshold decryption paradigm.