{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T17:53:42Z","timestamp":1772042022075,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,11,21]],"date-time":"2023-11-21T00:00:00Z","timestamp":1700524800000},"content-version":"vor","delay-in-days":6,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1704615, CNS-1933655, CNS-2112751, CCF-1908003, CCF-1651236"],"award-info":[{"award-number":["CNS-1704615, CNS-1933655, CNS-2112751, CCF-1908003, CCF-1651236"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,11,15]]},"DOI":"10.1145\/3576915.3616658","type":"proceedings-article","created":{"date-parts":[[2023,11,21]],"date-time":"2023-11-21T12:35:13Z","timestamp":1700570113000},"page":"475-489","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":38,"title":["Themis: Fast, Strong Order-Fairness in Byzantine Consensus"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-4268-4681","authenticated-orcid":false,"given":"Mahimna","family":"Kelkar","sequence":"first","affiliation":[{"name":"Cornell Tech, New York, NY, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4854-7203","authenticated-orcid":false,"given":"Soubhik","family":"Deb","sequence":"additional","affiliation":[{"name":"University of Washington Seattle, Seattle, WA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8417-3248","authenticated-orcid":false,"given":"Sishan","family":"Long","sequence":"additional","affiliation":[{"name":"Cornell Tech, New York, NY, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-1143-5504","authenticated-orcid":false,"given":"Ari","family":"Juels","sequence":"additional","affiliation":[{"name":"Cornell Tech, New York, NY, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8843-2964","authenticated-orcid":false,"given":"Sreeram","family":"Kannan","sequence":"additional","affiliation":[{"name":"University of Washington Seattle, Seattle, WA, USA"}]}],"member":"320","published-online":{"date-parts":[[2023,11,21]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2018. libhotstuff: A general-purpose BFT state machine replication library with modularity and simplicity. https:\/\/github.com\/hot-stuff\/libhotstuff."},{"key":"e_1_3_2_1_2_1","unstructured":"Accessed 2023. BlockPI. https:\/\/blockpi.io\/."},{"key":"e_1_3_2_1_3_1","unstructured":"Accessed 2023. Condorcet Paradox. wikipedia.org\/wiki\/Condorcet_paradox."},{"key":"e_1_3_2_1_4_1","unstructured":"Accessed 2023. DefiLlama Dashboard. defillama.com."},{"key":"e_1_3_2_1_5_1","unstructured":"Accessed 2023. Pocket Network. https:\/\/www.pokt.network\/."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Mathieu Baudet George Danezis and Alberto Sonnino. 2020. FastPay: High- Performance Byzantine Fault Tolerant Settlement. In ACM AFT. 163--177.","DOI":"10.1145\/3419614.3423249"},{"key":"e_1_3_2_1_7_1","unstructured":"Lorenz Breidenbach Phil Daian Ari Juels and Florian Tram\u00e8r. 2017. To Sink Frontrunners Send in the Submarines. https:\/\/hackingdistributed.com\/2017\/08\/ 28\/submarine-sends\/."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Christian Cachin Klaus Kursawe Frank Petzold and Victor Shoup. 2001. Secure and Efficient Asynchronous Broadcast Protocols. In CRYPTO. 524--541.","DOI":"10.1007\/3-540-44647-8_31"},{"key":"e_1_3_2_1_9_1","unstructured":"Christian Cachin Jovana Mi\u0107i\u0107 Nathalie Steinhauer and Luca Zanolini. 2021. Quick Order Fairness. arXiv:2112.06615 arXiv:2112.06615."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Christian Cachin Jovana Mi\u0107i\u0107 Nathalie Steinhauer and Luca Zanolini. 2022. Quick Order Fairness. In FC. 316--333.","DOI":"10.1007\/978-3-031-18283-9_15"},{"key":"e_1_3_2_1_11_1","first-page":"2151","article-title":"Chemins et circuits hamiltoniens des graphes complets","volume":"249","author":"Camion Paul","year":"1959","unstructured":"Paul Camion. 1959. Chemins et circuits hamiltoniens des graphes complets. Comptes Rendus de l'Acad\u00e9mie des Sciences de Paris 249 (1959), 2151--2152.","journal-title":"Comptes Rendus de l'Acad\u00e9mie des Sciences de Paris"},{"key":"e_1_3_2_1_12_1","unstructured":"Miguel Castro and Barbara Liskov. 1999. Practical Byzantine Fault Tolerance. In OSDI. 173--186."},{"key":"e_1_3_2_1_13_1","unstructured":"Chainlink. 2022. SmartCon 2022 Research and Product Development Highlights. https:\/\/blog.chain.link\/smartcon-research-updates\/."},{"key":"e_1_3_2_1_14_1","volume-title":"Miner Extractable Value, and Consensus Instability","author":"Daian Philip","unstructured":"Philip Daian, Steven Goldfeder, Tyler Kell, Yunqi Li, Xueyuan Zhao, Iddo Bentov, Lorenz Breidenbach, and Ari Juels. 2020. Flash Boys 2.0: Frontrunning in Decentralized Exchanges, Miner Extractable Value, and Consensus Instability. In IEEE S&P. 585--602."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/42282.42283"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Shayan Eskandari Seyedehmahsa Moosavi and Jeremy Clark. 2019. SoK: Transparent Dishonesty: Front-Running Attacks on Blockchain. In FC. 170--189.","DOI":"10.1007\/978-3-030-43725-1_13"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Juan Garay and Aggelos Kiayias. 2020. SoK: A Consensus Taxonomy in the Blockchain Era. In CT-RSA. 284--318.","DOI":"10.1007\/978-3-030-40186-3_13"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Jens Groth. 2016. On the Size of Pairing-based Non-interactive Arguments. In EUROCRYPT. 305--326.","DOI":"10.1007\/978-3-662-49896-5_11"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Chi Ho Danny Dolev and Robbert van Renesse. 2007. Making distributed systems robust. In OPODIS. 232--246.","DOI":"10.1007\/978-3-540-77096-1_17"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Mahimna Kelkar Soubhik Deb and Sreeram Kannan. 2022. Order-Fair Consensus in the Permissionless Setting. In APKC. 3--14.","DOI":"10.1145\/3494105.3526239"},{"key":"e_1_3_2_1_21_1","volume-title":"Themis: Fast, Strong Order-Fairness in Byzantine Consensus. Cryptology ePrint Archive, Report 2021\/1465.","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, Report 2021\/1465."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Mahimna Kelkar Fan Zhang Steven Goldfeder and Ari Juels. 2020. Order-Fairness for Byzantine Consensus. In CRYPTO. 451--480.","DOI":"10.1007\/978-3-030-56877-1_16"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Claire Kenyon-Mathieu and Warren Schudy. 2007. How to Rank with Few Errors. In STOC. 95--103.","DOI":"10.1145\/1250790.1250806"},{"key":"e_1_3_2_1_24_1","volume-title":"Deleveraging Spirals and Stablecoin Attacks. CES 1, 2","author":"Klages-Mundt Ariah","year":"2021","unstructured":"Ariah Klages-Mundt and Andreea Minca. 2021. (In)Stability for the Blockchain: Deleveraging Spirals and Stablecoin Attacks. CES 1, 2 (2021)."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Klaus Kursawe. 2020. Wendy the Good Little Fairness Widget: Achieving Order Fairness for Blockchains. In ACM AFT. 25--36.","DOI":"10.1145\/3419614.3423263"},{"key":"e_1_3_2_1_26_1","unstructured":"Klaus Kursawe. 2021. Wendy grows up. vega.xyz\/papers\/Wendy_Grows_Up.pdf."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357176"},{"key":"e_1_3_2_1_28_1","unstructured":"Yunqi Li Sylvain Bellemare Mikerah Quintyne-Collins and Andrew Miller. 2021. HoneyBadgerSwap: Making MPC as a Sidechain. https:\/\/medium.com\/initc3org\/ honeybadgerswap-making-mpc-as-a-sidechain-364bebdb10a5."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(92)90233-Z"},{"key":"e_1_3_2_1_30_1","unstructured":"Alex Manuskin. Jul 2020. The fastest draw on the Blockchain: Ethereum Back- running. https:\/\/medium.com\/@amanusk\/the-fastest-draw-on-the-blockchain- bzrx-example-6bd19fabdbe1."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"crossref","unstructured":"Andrew Miller Yu Xia Kyle Croman Elaine Shi and Dawn Song. 2016. The Honey Badger of BFT Protocols. In ACM CCS. 31--42.","DOI":"10.1145\/2976749.2978399"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"Rafael Pass and Elaine Shi. 2017. FruitChains: A Fair Blockchain. In PODC. 315--324.","DOI":"10.1145\/3087801.3087809"},{"key":"e_1_3_2_1_33_1","volume-title":"Quantifying Blockchain Ex- tractable Value: How dark is the forest?","author":"Qin Kaihua","unstructured":"Kaihua Qin, Liyi Zhou, and Arthur Gervais. 2022. Quantifying Blockchain Ex- tractable Value: How dark is the forest?. In IEEE S&P. 198--214."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/177492.177745"},{"key":"e_1_3_2_1_35_1","volume-title":"Presenting: VeeDo a STARK-based VDF Service. https: \/\/medium.com\/starkware\/presenting-veedo-e4bbff77c7ae.","year":"2020","unstructured":"StarkWare. 2020. Presenting: VeeDo a STARK-based VDF Service. https: \/\/medium.com\/starkware\/presenting-veedo-e4bbff77c7ae."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"crossref","unstructured":"Chrysoula Stathakopoulou Signe R\u00fcsch Marcus Brandenburger and Marko Vukoli\u0107. 2021. Adding Fairness to Order: Preventing Front-Running Attacks in BFT Protocols using TEEs. In SRDS. 34--45.","DOI":"10.1109\/SRDS53918.2021.00013"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1137\/0201010"},{"key":"e_1_3_2_1_38_1","unstructured":"Wonderproxy. 2020. A day in the life of the Internet. https:\/\/wonderproxy.com\/ blog\/a-day-in-the-life-of-the-internet\/."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"crossref","unstructured":"Maofan Yin Dahlia Malkhi Michael K. Reiter Guy Golan-Gueta and Ittai Abra- ham. 2019. HotStuff: BFT Consensus with Linearity and Responsiveness. In PODC. 347--356.","DOI":"10.1145\/3293611.3331591"},{"key":"e_1_3_2_1_40_1","unstructured":"Yunhao Zhang Srinath Setty Qi Chen Lidong Zhou and Lorenzo Alvisi. 2020. Byzantine Ordered Consensus without Byzantine Oligarchy. In OSDI. 633--649."},{"key":"e_1_3_2_1_41_1","volume-title":"Duc V Le, and Arthur Gervais.","author":"Zhou Liyi","year":"2021","unstructured":"Liyi Zhou, Kaihua Qin, Christof Ferreira Torres, Duc V Le, and Arthur Gervais. 2021. High-Frequency Trading on Decentralized On-Chain Exchanges. In IEEE S&P. 428--445"}],"event":{"name":"CCS '23: ACM SIGSAC Conference on Computer and Communications Security","location":"Copenhagen Denmark","acronym":"CCS '23","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3576915.3616658","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3576915.3616658","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3576915.3616658","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T01:42:12Z","timestamp":1755740532000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3576915.3616658"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,15]]},"references-count":41,"alternative-id":["10.1145\/3576915.3616658","10.1145\/3576915"],"URL":"https:\/\/doi.org\/10.1145\/3576915.3616658","relation":{},"subject":[],"published":{"date-parts":[[2023,11,15]]},"assertion":[{"value":"2023-11-21","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}