Maximal Extractable Value (MEV) Protection on a DAG

D. Malkhi, Pawel Szalachowski
{"title":"Maximal Extractable Value (MEV) Protection on a DAG","authors":"D. Malkhi, Pawel Szalachowski","doi":"10.48550/arXiv.2208.00940","DOIUrl":null,"url":null,"abstract":"Many cryptocurrency platforms are vulnerable to Maximal Extractable Value (MEV) attacks, where a malicious consensus leader can inject transactions or change the order of user transactions to maximize its profit. A promising line of research in MEV mitigation is to enhance the Byzantine fault tolerance (BFT) consensus core of blockchains by new functionalities, like hiding transaction contents, such that malicious parties cannot analyze and exploit them until they are ordered. An orthogonal line of research demonstrates excellent performance for BFT protocols designed around Directed Acyclic Graphs (DAG). They provide high throughput by keeping high network utilization, decoupling transactions' dissemination from their metadata ordering, and encoding consensus logic efficiently over a DAG representing a causal ordering of disseminated messages. This paper explains how to combine these two advances. It introduces a DAG-based protocol called Fino, that integrates MEV-resistance features into DAG-based BFT without delaying the steady spreading of transactions by the DAG transport and with zero message overhead. The scheme operates without complex secret share verifiability or recoverability, and avoids costly threshold encryption.","PeriodicalId":174732,"journal":{"name":"International Conference on Blockchain Economics, Security and Protocols","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"37","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Blockchain Economics, Security and Protocols","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.48550/arXiv.2208.00940","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 37

Abstract

Many cryptocurrency platforms are vulnerable to Maximal Extractable Value (MEV) attacks, where a malicious consensus leader can inject transactions or change the order of user transactions to maximize its profit. A promising line of research in MEV mitigation is to enhance the Byzantine fault tolerance (BFT) consensus core of blockchains by new functionalities, like hiding transaction contents, such that malicious parties cannot analyze and exploit them until they are ordered. An orthogonal line of research demonstrates excellent performance for BFT protocols designed around Directed Acyclic Graphs (DAG). They provide high throughput by keeping high network utilization, decoupling transactions' dissemination from their metadata ordering, and encoding consensus logic efficiently over a DAG representing a causal ordering of disseminated messages. This paper explains how to combine these two advances. It introduces a DAG-based protocol called Fino, that integrates MEV-resistance features into DAG-based BFT without delaying the steady spreading of transactions by the DAG transport and with zero message overhead. The scheme operates without complex secret share verifiability or recoverability, and avoids costly threshold encryption.
DAG上的最大可提取值(MEV)保护
许多加密货币平台容易受到最大可提取价值(MEV)攻击的影响,恶意的共识领导者可以注入交易或改变用户交易的顺序,以最大化其利润。缓解MEV的一个有前途的研究方向是通过新功能增强区块链的拜占庭容错(BFT)共识核心,比如隐藏交易内容,这样恶意方就无法分析和利用它们,直到它们被订购。正交研究表明,围绕有向无环图(DAG)设计的BFT协议具有优异的性能。它们通过保持高网络利用率、将事务的传播与其元数据顺序解耦以及在表示传播消息的因果顺序的DAG上有效地编码共识逻辑来提供高吞吐量。本文阐述了如何将这两方面的进展结合起来。它引入了一种名为Fino的基于DAG的协议,该协议将mev抗特性集成到基于DAG的BFT中,而不会延迟DAG传输的事务稳定传播,并且消息开销为零。该方案无需复杂的秘密共享可验证性或可恢复性,并且避免了昂贵的阈值加密。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信