Document Open Access Logo

BlindPerm: Efficient MEV Mitigation with an Encrypted Mempool and Permutation

Authors Alireza Kavousi, Duc V. Le, Philipp Jovanovic, George Danezis

PDF

File

Thumbnail PDF
PDF
LIPIcs.OPODIS.2025.36.pdf
  • Filesize: 1.37 MB
  • 21 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Security and privacy → Public key (asymmetric) techniques
Keywords
  • Encrypted mempool
  • maximal extractable value
  • distributed systems

Metrics

Abstract

Maximal Extractable Value (MEV) is a crucial challenge in blockchains and cryptocurrencies. A principal countermeasure is using encrypted mempools to hide the transaction payloads until they are committed in a block. However, the existing approaches based on encrypted mempools remain vulnerable to metadata leakage and may not provide sufficient mitigation against block producers due to their sole control in block preparation. In this paper, we propose techniques that utilize randomized permutation on the committed block, offering a multi-layer solution. With a focus on proof-of-stake (PoS) committee-based consensus, we then introduce BlindPerm, a framework that enhances an encrypted mempool with permutation and present various optimizations. Notably, we propose a construction where this enhancement comes at essentially no overhead by piggybacking on the encrypted mempool and without relying on any external entity such as randomness beacon. Further, we illustrate the effectiveness of our solutions by running simulations using historical Ethereum data.

Cite As Get BibTex

Alireza Kavousi, Duc V. Le, Philipp Jovanovic, and George Danezis. BlindPerm: Efficient MEV Mitigation with an Encrypted Mempool and Permutation. In 29th International Conference on Principles of Distributed Systems (OPODIS 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 361, pp. 36:1-36:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.OPODIS.2025.36

Author Details

Alireza Kavousi
  • University College London, UK
Duc V. Le
  • Visa Research, Palo Alto, CA, USA
Philipp Jovanovic
  • University College London, UK
George Danezis
  • Mysten Labs, London, UK
  • University College London, UK

References

  1. Flashbots, 2022. URL: https://docs.flashbots.net/.
  2. Orestis Alpos, Ignacio Amores-Sesar, Christian Cachin, and Michelle Yeo. Eating sandwiches: Modular and lightweight elimination of transaction reordering attacks. In 27th International Conference on Principles of Distributed Systems, 2024. Google Scholar
  3. Guillermo Angeris, Tarun Chitra, Theo Diamonds, and Kshitij Kulkarni. The specter (and spectra) of miner extractable value. arXiv preprint arXiv:2310.07865, 2023. URL: https://doi.org/10.48550/arXiv.2310.07865.
  4. Kushal Babel, Nerla Jean-Louis, Yan Ji, Ujval Misra, Mahimna Kelkar, Kosala Yapa Mudiyanselage, Andrew Miller, and Ari Juels. Prof: Protected order flow in a profit-seeking world. arXiv preprint arXiv:2408.02303, 2024. Google Scholar
  5. Axel Bacher, Olivier Bodini, Hsien-Kuei Hwang, and Tsung-Hsi Tsai. Generating random permutations by coin tossing: Classical algorithms, new analysis, and modern implementation. ACM Trans. Algorithms, 13(2):24-1, 2017. Google Scholar
  6. Maryam Bahrani, Pranav Garimidi, and Tim Roughgarden. Transaction fee mechanism design in a post-mev world. In 6th Conference on Advances in Financial Technologies, 2024. Google Scholar
  7. Joseph Bebel and Dev Ojha. Ferveo: Threshold decryption for mempool privacy in bft networks. Cryptology ePrint Archive, 2022. Google Scholar
  8. Michael Ben-Or. Another advantage of free choice (extended abstract) completely asynchronous agreement protocols. In Proceedings of the second annual ACM symposium on Principles of distributed computing, pages 27-30, 1983. Google Scholar
  9. Iddo Bentov, Yan Ji, Fan Zhang, Lorenz Breidenbach, Philip Daian, and Ari Juels. Tesseract: Real-time cryptocurrency exchange using trusted hardware. In Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, pages 1521-1538, 2019. URL: https://doi.org/10.1145/3319535.3363221.
  10. Dan Boneh and Matt Franklin. Identity-based encryption from the weil pairing. In Annual international cryptology conference, pages 213-229. Springer, 2001. Google Scholar
  11. Dan Boneh, Ben Lynn, and Hovav Shacham. Short signatures from the weil pairing. In International conference on the theory and application of cryptology and information security, pages 514-532. Springer, 2001. URL: https://doi.org/10.1007/3-540-45682-1_30.
  12. Lorenz Breidenbach, Christian Cachin, Benedict Chan, Alex Coventry, Steve Ellis, Ari Juels, Farinaz Koushanfar, Andrew Miller, Brendan Magauran, Daniel Moroz, et al. Chainlink 2.0: Next steps in the evolution of decentralized oracle networks. Chainlink Labs, 1, 2021. Google Scholar
  13. Jeffrey Burdges and Luca De Feo. Delay encryption. In Advances in Cryptology-EUROCRYPT 2021: 40th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, October 17-21, 2021, Proceedings, Part I, pages 302-326. Springer, 2021. URL: https://doi.org/10.1007/978-3-030-77870-5_11.
  14. Christian Cachin, Jovana Mićić, Nathalie Steinhauer, and Luca Zanolini. Quick order fairness. In Financial Cryptography and Data Security: 26th International Conference, FC 2022, Grenada, May 2-6, 2022, Revised Selected Papers, pages 316-333. Springer, 2022. URL: https://doi.org/10.1007/978-3-031-18283-9_15.
  15. Ignacio Cascudo and Bernardo David. Scrape: Scalable randomness attested by public entities. In International Conference on Applied Cryptography and Network Security, pages 537-556. Springer, 2017. URL: https://doi.org/10.1007/978-3-319-61204-1_27.
  16. Ignacio Cascudo, Bernardo David, Lydia Garms, and Anders Konring. Yolo yoso: fast and simple encryption and secret sharing in the yoso model. In Advances in Cryptology-ASIACRYPT 2022: 28th International Conference on the Theory and Application of Cryptology and Information Security, Taipei, Taiwan, December 5-9, 2022, Proceedings, Part I, pages 651-680. Springer, 2023. URL: https://doi.org/10.1007/978-3-031-22963-3_22.
  17. James Hsin-yu Chiang, Bernardo David, Ittay Eyal, and Tiantian Gong. Fairpos: Input fairness in proof-of-stake with adaptive security. Cryptology ePrint Archive, 2022. Google Scholar
  18. Arka Rai Choudhuri, Sanjam Garg, Julien Piet, and Guru-Vamsi Policharla. Mempool privacy via batched threshold encryption: Attacks and defenses. In 33rd USENIX Security Symposium (USENIX Security 24), pages 3513-3529, 2024. Google Scholar
  19. Philip Daian, Steven Goldfeder, Tyler Kell, Yunqi Li, Xueyuan Zhao, Iddo Bentov, Lorenz Breidenbach, and Ari Juels. Flash boys 2.0: Frontrunning in decentralized exchanges, miner extractable value, and consensus instability. In 2020 IEEE Symposium on Security and Privacy (SP), pages 910-927. IEEE, 2020. URL: https://doi.org/10.1109/SP40000.2020.00040.
  20. George Danezis, Lefteris Kokoris-Kogias, Alberto Sonnino, and Alexander Spiegelman. Narwhal and tusk: a dag-based mempool and efficient bft consensus. In Proceedings of the Seventeenth European Conference on Computer Systems, pages 34-50, 2022. URL: https://doi.org/10.1145/3492321.3519594.
  21. Wanning Ding, Yuzhe Tang, and Yibo Wang. Asymmetric mempool dos security: Formal definitions and provable secure designs. In 2025 IEEE Symposium on Security and Privacy (SP), pages 1584-1602. IEEE, 2025. URL: https://doi.org/10.1109/SP61157.2025.00061.
  22. Sisi Duan, Michael K Reiter, and Haibin Zhang. Secure causal atomic broadcast, revisited. In 2017 47th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN), pages 61-72. IEEE, 2017. URL: https://doi.org/10.1109/DSN.2017.64.
  23. Cynthia Dwork, Nancy Lynch, and Larry Stockmeyer. Consensus in the presence of partial synchrony. Journal of the ACM (JACM), 35(2):288-323, 1988. URL: https://doi.org/10.1145/42282.42283.
  24. Paul Feldman and Silvio Micali. Byzantine agreement in constant expected time. In 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), pages 267-276. IEEE, 1985. Google Scholar
  25. Nicolas Gailly, Kelsey Melissaris, and Yolan Romailler. tlock: practical timelock encryption from threshold bls. Cryptology ePrint Archive, 2023. Google Scholar
  26. Sanjam Garg, Dimitris Kolonelos, Guru-Vamsi Policharla, and Mingyuan Wang. Threshold encryption with silent setup. In annual international cryptology conference, pages 352-386. Springer, 2024. URL: https://doi.org/10.1007/978-3-031-68394-7_12.
  27. William V Gehrlein. Condorcet’s paradox. Theory and Decision, 15(2):161-197, 1983. Google Scholar
  28. Tivas Gupta, Mallesh M Pai, and Max Resnick. The centralizing effects of private order flow on proposer-builder separation. In 5th Conference on Advances in Financial Technologies (AFT 2023). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. URL: https://doi.org/10.4230/LIPIcs.AFT.2023.20.
  29. Lioba Heimbach and Roger Wattenhofer. Sok: Preventing transaction reordering manipulations in decentralized finance. In 4th ACM Conference on Advances in Financial Technologies (AFT), 2022. Google Scholar
  30. Mahimna Kelkar, Soubhik Deb, Sishan Long, Ari Juels, and Sreeram Kannan. Themis: Fast, strong order-fairness in byzantine consensus. In Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, pages 475-489, 2023. URL: https://doi.org/10.1145/3576915.3616658.
  31. Mahimna Kelkar, Fan Zhang, Steven Goldfeder, and Ari Juels. Order-fairness for byzantine consensus. In Advances in Cryptology-CRYPTO 2020: 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17-21, 2020, Proceedings, Part III 40, pages 451-480. Springer, 2020. URL: https://doi.org/10.1007/978-3-030-56877-1_16.
  32. Ahmed Kosba, Andrew Miller, Elaine Shi, Zikai Wen, and Charalampos Papamanthou. Hawk: The blockchain model of cryptography and privacy-preserving smart contracts. In 2016 IEEE symposium on security and privacy (SP), pages 839-858. IEEE, 2016. URL: https://doi.org/10.1109/SP.2016.55.
  33. Klaus Kursawe. Wendy, the good little fairness widget: Achieving order fairness for blockchains. In Proceedings of the 2nd ACM Conference on Advances in Financial Technologies, pages 25-36, 2020. URL: https://doi.org/10.1145/3419614.3423263.
  34. Dahlia Malkhi and Kartik Nayak. Hotstuff-2: Optimal two-phase responsive bft. Cryptology ePrint Archive, 2023. Google Scholar
  35. Dahlia Malkhi and Pawel Szalachowski. Maximal extractable value (mev) protection on a dag. In 4th International Conference on Blockchain Economics, Security and Protocols, page 1, 2023. Google Scholar
  36. Akaki Mamageishvili, Christoph Schlegel, and Benny Sudakov. Searcher competition in block building. In 6th Conference on Advances in Financial Technologies (AFT 2024), pages 21-1. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. URL: https://doi.org/10.4230/LIPIcs.AFT.2024.21.
  37. Peyman Momeni, Sergey Gorbunov, and Bohan Zhang. Fairblock: Preventing blockchain front-running with minimal overheads. In International Conference on Security and Privacy in Communication Systems, pages 250-271. Springer, 2022. URL: https://doi.org/10.1007/978-3-031-25538-0_14.
  38. Torben Pryds Pedersen. A threshold cryptosystem without a trusted party. In Advances in Cryptology—EUROCRYPT’91: Workshop on the Theory and Application of Cryptographic Techniques Brighton, UK, April 8-11, 1991 Proceedings 10, pages 522-526. Springer, 1991. Google Scholar
  39. Julien Piet, Jaiden Fairoze, and Nicholas Weaver. Extracting godl [sic] from the salt mines: Ethereum miners extracting value. arXiv preprint arXiv:2203.15930, 2022. URL: https://doi.org/10.48550/arXiv.2203.15930.
  40. Kaihua Qin, Liyi Zhou, and Arthur Gervais. Quantifying blockchain extractable value: How dark is the forest? In 2022 IEEE Symposium on Security and Privacy (SP), pages 198-214. IEEE, 2022. URL: https://doi.org/10.1109/SP46214.2022.9833734.
  41. Michael K Reiter and Kenneth P Birman. How to securely replicate services. ACM Transactions on Programming Languages and Systems (TOPLAS), 16(3):986-1009, 1994. URL: https://doi.org/10.1145/177492.177745.
  42. Ronald L Rivest, Adi Shamir, and David A Wagner. Time-lock puzzles and timed-release crypto. Technical report, Massachusetts Institute of Technology. Laboratory for Computer Science, 1996. Google Scholar
  43. Antoine Rondelet and Quintus Kilbourn. Threshold encrypted mempools: Limitations and considerations. arXiv preprint arXiv:2307.10878, 2023. URL: https://doi.org/10.48550/arXiv.2307.10878.
  44. Fred B Schneider. Implementing fault-tolerant services using the state machine approach: A tutorial. ACM Computing Surveys (CSUR), 22(4):299-319, 1990. URL: https://doi.org/10.1145/98163.98167.
  45. Adi Shamir. How to share a secret. Communications of the ACM, 22(11):612-613, 1979. URL: https://doi.org/10.1145/359168.359176.
  46. Alexander Spiegelman, Neil Giridharan, Alberto Sonnino, and Lefteris Kokoris-Kogias. Bullshark: Dag bft protocols made practical. In Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, pages 2705-2718, 2022. URL: https://doi.org/10.1145/3548606.3559361.
  47. Christof Ferreira Torres, Albin Mamuti, Ben Weintraub, Cristina Nita-Rotaru, and Shweta Shinde. Rolling in the shadows: Analyzing the extraction of mev across layer-2 rollups. arXiv preprint arXiv:2405.00138, 2024. URL: https://doi.org/10.48550/arXiv.2405.00138.
  48. Anton Wahrstätter, Jens Ernstberger, Aviv Yaish, Liyi Zhou, Kaihua Qin, Taro Tsuchiya, Sebastian Steinhorst, Davor Svetinovic, Nicolas Christin, Mikolaj Barczentewicz, et al. Blockchain censorship. arXiv preprint arXiv:2305.18545, 2023. Google Scholar
  49. Lei Yang, Seo Jin Park, Mohammad Alizadeh, Sreeram Kannan, and David Tse. DispersedLedger:High-Throughput byzantine consensus on variable bandwidth networks. In 19th USENIX Symposium on Networked Systems Design and Implementation (NSDI 22), pages 493-512, 2022. URL: https://www.usenix.org/conference/nsdi22/presentation/yang.
  50. Sen Yang, Kartik Nayak, and Fan Zhang. Decentralization of ethereum’s builder market. arXiv preprint arXiv:2405.01329, 2024. URL: https://doi.org/10.48550/arXiv.2405.01329.
  51. Maofan Yin, Dahlia Malkhi, Michael K Reiter, Guy Golan Gueta, and Ittai Abraham. Hotstuff: Bft consensus with linearity and responsiveness. In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, pages 347-356, 2019. URL: https://doi.org/10.1145/3293611.3331591.
  52. Haoqian Zhang, Louis-Henri Merino, Ziyan Qu, Mahsa Bastankhah, Vero Estrada-Galiñanes, and Bryan Ford. F3b: A low-overhead blockchain architecture with per-transaction front-running protection. In 5th Conference on Advances in Financial Technologies, 2023. Google Scholar
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact