{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T07:40:50Z","timestamp":1772264450551,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":51,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,11,27]],"date-time":"2023-11-27T00:00:00Z","timestamp":1701043200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"NWO Netherlands","award":["BLOCK.2019.004"],"award-info":[{"award-number":["BLOCK.2019.004"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,11,27]]},"DOI":"10.1145\/3590140.3629108","type":"proceedings-article","created":{"date-parts":[[2023,11,24]],"date-time":"2023-11-24T18:06:33Z","timestamp":1700849193000},"page":"98-110","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["LO"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7205-2913","authenticated-orcid":false,"given":"Bulat","family":"Nasrulin","sequence":"first","affiliation":[{"name":"Delft University of Technology, Delft, Netherlands"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9797-5140","authenticated-orcid":false,"given":"Georgy","family":"Ishmaev","sequence":"additional","affiliation":[{"name":"Delft University of Technology, Delft, Netherlands"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9143-3984","authenticated-orcid":false,"given":"J\u00e9r\u00e9mie","family":"Decouchant","sequence":"additional","affiliation":[{"name":"Delft University of Technology, Delft, Netherlands"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9882-1506","authenticated-orcid":false,"given":"Johan","family":"Pouwelse","sequence":"additional","affiliation":[{"name":"Delft University of Technology, Delft, Netherlands"}]}],"member":"320","published-online":{"date-parts":[[2023,11,27]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"[n.d.]. Cowswap. https:\/\/cowswap.exchange."},{"key":"e_1_3_2_1_2_1","unstructured":"[n. d.]. Ethereum Documentation. https:\/\/ethereum.org\/nl\/developers\/docs\/mev\/."},{"key":"e_1_3_2_1_3_1","unstructured":"[n. d.]. Flashbots Blockspace Auction. https:\/\/docs.flashbots.net\/flashbots-auction\/overview."},{"key":"e_1_3_2_1_4_1","volume-title":"BASALT: A rock-solid foundation for epidemic consensus algorithms in very large, very open networks. arXiv preprint arXiv:2102.04063","author":"Auvolat Alex","year":"2021","unstructured":"Alex Auvolat, Y\u00e9rom-David Bromberg, Davide Frey, and Fran\u00e7ois Ta\u00efani. 2021. BASALT: A rock-solid foundation for epidemic consensus algorithms in very large, very open networks. arXiv preprint arXiv:2102.04063 (2021)."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2016.127"},{"key":"e_1_3_2_1_6_1","volume-title":"Ferveo: Threshold Decryption for Mempool Privacy in BFT networks. Cryptology ePrint Archive, Paper 2022\/898. https:\/\/eprint.iacr.org\/2022\/898 https:\/\/eprint.iacr.org\/2022\/898.","author":"Bebel Joseph","year":"2022","unstructured":"Joseph Bebel and Dev Ojha. 2022. Ferveo: Threshold Decryption for Mempool Privacy in BFT networks. Cryptology ePrint Archive, Paper 2022\/898. https:\/\/eprint.iacr.org\/2022\/898 https:\/\/eprint.iacr.org\/2022\/898."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2009.03.008"},{"key":"e_1_3_2_1_8_1","unstructured":"Vitalik Buterin. 2021. State of research: increasing censorship resistance of transactions under proposer\/builder separation (PBS)."},{"key":"e_1_3_2_1_9_1","volume-title":"Casper the friendly finality gadget. arXiv:1710.09437","author":"Buterin Vitalik","year":"2017","unstructured":"Vitalik Buterin and Virgil Griffith. 2017. Casper the friendly finality gadget. arXiv:1710.09437 (2017)."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-18283-9_15"},{"key":"e_1_3_2_1_11_1","volume-title":"Polygraph: Accountable byzantine agreement","author":"Civit Pierre","year":"2021","unstructured":"Pierre Civit, Seth Gilbert, and Vincent Gramoli. 2021. Polygraph: Accountable byzantine agreement. In ICDCS. IEEE, 403--413."},{"key":"e_1_3_2_1_12_1","unstructured":"Code for the system [n. d.]. https:\/\/github.com\/tribler\/bami."},{"key":"e_1_3_2_1_13_1","volume-title":"Transaction Reordering, and Consensus Instability in Decentralized Exchanges. arXiv preprint arXiv:1904.05234","author":"Daian Philip","year":"2019","unstructured":"Philip Daian, Steven Goldfeder, Tyler Kell, Yunqi Li, Xueyuan Zhao, Iddo Bentov, Lorenz Breidenbach, and Ari Juels. 2019. Flash Boys 2.0: Frontrunning, Transaction Reordering, and Consensus Instability in Decentralized Exchanges. arXiv preprint arXiv:1904.05234 (2019)."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","unstructured":"George Danezis Lefteris Kokoris-Kogias Alberto Sonnino and Alexander Spiegelman. 2022. Narwhal and Tusk: a DAG-based mempool and efficient BFT consensus. In EuroSys. ACM Rennes France 34--50. https:\/\/doi.org\/10.1145\/3492321.3519594","DOI":"10.1145\/3492321.3519594"},{"key":"e_1_3_2_1_15_1","series-title":"SIAM journal on computing 38, 1","volume-title":"Fuzzy extractors: How to generate strong keys from biometrics and other noisy data","author":"Dodis Yevgeniy","year":"2008","unstructured":"Yevgeniy Dodis, Rafail Ostrovsky, Leonid Reyzin, and Adam Smith. 2008. Fuzzy extractors: How to generate strong keys from biometrics and other noisy data. SIAM journal on computing 38, 1 (2008), 97--139."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043164.2018462"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3212998"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","unstructured":"Arthur Gervais Hubert Ritzdorf Ghassan O. Karame and Srdjan Capkun. 2015. Tampering with the Delivery of Blocks and Transactions in Bitcoin. In CCS. ACM Denver Colorado USA 692--705. https:\/\/doi.org\/10.1145\/2810103.2813655","DOI":"10.1145\/2810103.2813655"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.14778\/3436905.3436906"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Andreas Haeberlen et al. 2007. PeerReview: Practical accountability for distributed systems. ACM SIGOPS operating systems review 41 6 (2007) 175--188.","DOI":"10.1145\/1323293.1294279"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3558535.3559784"},{"key":"e_1_3_2_1_22_1","volume-title":"Themis: Fast, strong order-fairness in byzantine consensus. Cryptology ePrint Archive","author":"Kelkar Mahimna","year":"2021","unstructured":"Mahimna Kelkar, Soubhik Deb, Sishan Long, Ari Juels, and Sreeram Kannan. 2021. Themis: Fast, strong order-fairness in byzantine consensus. Cryptology ePrint Archive (2021)."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56877-1_16"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3419614.3423263"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-63958-0_17"},{"key":"e_1_3_2_1_26_1","volume-title":"Maximal Extractable Value (MEV) Protection on a DAG. arXiv:2208.00940","author":"Malkhi Dahlia","year":"2022","unstructured":"Dahlia Malkhi and Pawel Szalachowski. 2022. Maximal Extractable Value (MEV) Protection on a DAG. arXiv:2208.00940 (2022)."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3560832.3563433"},{"key":"e_1_3_2_1_28_1","volume-title":"Sustainable Cooperation in Peer-To-Peer Networks. In 2023 IEEE 48th Conference on Local Computer Networks (LCN). IEEE, 1--9.","author":"Nasrulin Bulat","year":"2023","unstructured":"Bulat Nasrulin, Rowdy Chotkan, and Johan Pouwelse. 2023. Sustainable Cooperation in Peer-To-Peer Networks. In 2023 IEEE 48th Conference on Local Computer Networks (LCN). IEEE, 1--9."},{"key":"e_1_3_2_1_29_1","volume-title":"Bandwidth-efficient transaction relay for bitcoin. arXiv:1905.10518","author":"Naumenko Gleb","year":"2019","unstructured":"Gleb Naumenko, Gregory Maxwell, Pieter Wuille, Alexandra Fedorova, and Ivan Beschastnikh. 2019. Bandwidth-efficient transaction relay for bitcoin. arXiv:1905.10518 (2019)."},{"key":"e_1_3_2_1_30_1","unstructured":"Netem documentation [n. d.]. https:\/\/www.linux.org\/docs\/man8\/tc-netem.html."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/WETSEB.2019.00010"},{"key":"e_1_3_2_1_32_1","volume-title":"Extracting godl [sic] from the salt mines: Ethereum miners extracting value. arXiv preprint arXiv:2203.15930","author":"Piet Julien","year":"2022","unstructured":"Julien Piet, Jaiden Fairoze, and Nicholas Weaver. 2022. Extracting godl [sic] from the salt mines: Ethereum miners extracting value. arXiv preprint arXiv:2203.15930 (2022)."},{"key":"e_1_3_2_1_33_1","unstructured":"pmcgoohan. [n.d.]. zeromev-geth. https:\/\/github.com\/zeromev\/zeromev-geth\/blob\/master\/README.md. Accessed: 2023-01-12."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP46214.2022.9833734"},{"key":"e_1_3_2_1_35_1","volume-title":"The bloom clock. arXiv preprint arXiv:1905.13064","author":"Ramabaja Lum","year":"2019","unstructured":"Lum Ramabaja. 2019. The bloom clock. arXiv preprint arXiv:1905.13064 (2019)."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"crossref","unstructured":"Peiyao Sheng Gerui Wang Kartik Nayak Sreeram Kannan and Pramod Viswanath. 2021. BFT protocol forensics. In CCS. 1722--1743.","DOI":"10.1145\/3460120.3484566"},{"key":"e_1_3_2_1_37_1","unstructured":"ShutterNetwork. [n. d.]. Global Ping Statistics. https:\/\/github.com\/shutter-network\/shutter. Accessed: 2023-01-12."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2023.109701"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"crossref","unstructured":"Robbert Van Renesse Dan Dumitriu Valient Gough and Chris Thomas. 2008. Efficient reconciliation and flow control for anti-entropy protocols. In LADIS. 1--7.","DOI":"10.1145\/1529974.1529983"},{"key":"e_1_3_2_1_40_1","unstructured":"Anton Wahrst\u00e4tter Liyi Zhou Kaihua Qin Davor Svetinovic and Arthur Gervais. 2023. Time to Bribe: Measuring Block Construction Market. arXiv:2305.16468 [cs.NI]"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2021.3078181"},{"key":"e_1_3_2_1_42_1","unstructured":"WonderNetwork. [n. d.]. Global Ping Statistics. https:\/\/wondernetwork.com\/pings. Accessed: 2023-01-12."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3570639"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2021.3052038"},{"key":"e_1_3_2_1_45_1","volume-title":"SoK: MEV Countermeasures: Theory and Practice. arXiv:2212.05111","author":"Yang Sen","year":"2022","unstructured":"Sen Yang, Fan Zhang, Ken Huang, Xi Chen, Youwei Yang, and Feng Zhu. 2022. SoK: MEV Countermeasures: Theory and Practice. arXiv:2212.05111 (2022)."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2019.2900648"},{"key":"e_1_3_2_1_47_1","volume-title":"Lyra: Fast and Scalable Resilience to Reordering Attacks in Blockchains.","author":"Zarbafian Pouriya","year":"2023","unstructured":"Pouriya Zarbafian and Vincent Gramoli. 2023. Lyra: Fast and Scalable Resilience to Reordering Attacks in Blockchains. (2023)."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCSW56584.2022.00026"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.5555\/3488766.3488802"},{"key":"e_1_3_2_1_50_1","volume-title":"A2mm: Mitigating frontrunning, transaction reordering and consensus instability in decentralized exchanges. arXiv preprint arXiv:2106.07371v2","author":"Zhou Liyi","year":"2021","unstructured":"Liyi Zhou, Kaihua Qin, and Arthur Gervais. 2021. A2mm: Mitigating frontrunning, transaction reordering and consensus instability in decentralized exchanges. arXiv preprint arXiv:2106.07371v2 (2021)."},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP46215.2023.10179435"}],"event":{"name":"Middleware '23: 24th International Middleware Conference","location":"Bologna Italy","acronym":"Middleware '23","sponsor":["ACM Association for Computing Machinery","IFIP International Federation for Information Processing"]},"container-title":["Proceedings of the 24th International Middleware Conference on ZZZ"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3590140.3629108","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3590140.3629108","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T16:52:49Z","timestamp":1756486369000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3590140.3629108"}},"subtitle":["An Accountable Mempool for MEV Resistance"],"short-title":[],"issued":{"date-parts":[[2023,11,27]]},"references-count":51,"alternative-id":["10.1145\/3590140.3629108","10.1145\/3590140"],"URL":"https:\/\/doi.org\/10.1145\/3590140.3629108","relation":{},"subject":[],"published":{"date-parts":[[2023,11,27]]},"assertion":[{"value":"2023-11-27","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}