Q-RTOP: Quantum-Secure Random Transaction Ordering Protocol for Mitigating Maximal Extractable Value Attacks in Blockchains With a Priority Gas-Fee Policy

Abstract

Public blockchains, such as Ethereum, rely on decentralized networks of peer-to-peer nodes known as validators or miners to verify all transactions and create new valid blocks. These validators can prioritize transactions, primarily based on high gas fees, allowing miners to maximize their block rewards, a concept referred to as maximal extractable value (MEV). However, MEV is vulnerable to front-running, back-running, and sandwich attacks (FBSAs), and is exploited by malicious nodes and bots to manipulate users’ valuable transactions. These malicious activities adversely impact the Blockchain’s scalability, transparency, and security. Flashbots, as one of the solutions, introduces centralization since all nodes have to forward all blocks to the central node. To address these issues, we have designed a new Blockchain transaction ordering protocol called Quantum Random Transaction Ordering Protocol (Q-RTOP). The proposed protocol operates on top of the existing Blockchain transaction ordering mechanism. However, instead of allowing validators to select transactions based on high gas fees, decentralized nodes running Q-RTOP securely randomize all transactions and then forward them to the validators, which proceed with the block validation without any change. Our protocol primarily focuses on randomizing transactions before being processed by the validators by utilizing a quantum random generator as a secure source of randomness. The final results demonstrated that Q-RTOP effectively secured user transactions and randomized 8192 transactions within 25 milliseconds.

Keywords

• Back-running
• front-running
• maximal extractable value (MEV)
• quantum computing
• quantum-resistance algorithm
• quantum random number