A systematization of fair message ordering consensus that introduces a modular framework for adding fairness to BFT consensus and a latency-optimized variant of Themis.
Eating sandwiches: Modular and lightweight elimination of transaction reordering attacks
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Traditional blockchains grant the miner of a block full control not only over which transactions but also their order. This constitutes a major flaw discovered with the introduction of decentralized finance and allows miners to perform MEV attacks. In this paper, we address the issue of sandwich attacks by providing a construction that takes as input a blockchain protocol and outputs a new blockchain protocol with the same security but in which sandwich attacks are not profitable. Furthermore, our protocol is fully decentralized with no trusted third parties or heavy cryptography primitives and carries a linear increase in latency and minimum computation overhead.
fields
cs.DC 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
SoK: Consensus for Fair Message Ordering
A systematization of fair message ordering consensus that introduces a modular framework for adding fairness to BFT consensus and a latency-optimized variant of Themis.