{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T09:19:32Z","timestamp":1773825572401,"version":"3.50.1"},"reference-count":62,"publisher":"Association for Computing Machinery (ACM)","issue":"9","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2024,5]]},"abstract":"<jats:p>\n            Distributed data management systems use state Machine Replication (SMR) to provide fault tolerance. The SMR algorithm enables Byzantine Fault-Tolerant (BFT) protocols to guarantee safety and liveness despite the malicious failure of nodes. However, SMR does not prevent the adversarial manipulation of the order of transactions, where the order assigned by a malicious leader differs from the order in that transactions are received from clients. While\n            <jats:italic>order-fairness<\/jats:italic>\n            has been recently studied in a few protocols, such protocols rely on synchronized clocks, suffer from liveness issues, or incur significant performance overhead. This paper presents\n            <jats:italic>Rashnu<\/jats:italic>\n            , a high-performance fair ordering protocol. Rashnu is motivated by the fact that fair ordering among two transactions is needed only when both transactions access a shared resource. Based on this observation, we define the notion of\n            <jats:italic>data-dependent order fairness<\/jats:italic>\n            where replicas capture only the order of data-dependent transactions and the leader uses these orders to propose a dependency graph that represents fair ordering among transactions. Replicas then execute transactions using the dependency graph, resulting in the parallel execution of independent transactions. We implemented a prototype of Rashnu where our experimental evaluation reveals the low overhead of providing order-fairness in Rashnu.\n          <\/jats:p>","DOI":"10.14778\/3665844.3665861","type":"journal-article","created":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T22:19:07Z","timestamp":1722982747000},"page":"2335-2348","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Rashnu: Data-Dependent Order-Fairness"],"prefix":"10.14778","volume":"17","author":[{"given":"Heena","family":"Nagda","sequence":"first","affiliation":[{"name":"University of Pennsylvania"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shubhendra Pal","family":"Singhal","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad Javad","family":"Amiri","sequence":"additional","affiliation":[{"name":"Stony Brook University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Boon Thau","family":"Loo","sequence":"additional","affiliation":[{"name":"University of Pennsylvania"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,8,6]]},"reference":[{"key":"e_1_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_2_1_2_1","volume-title":"Solida: A Blockchain Protocol Based on Reconfigurable Byzantine Consensus. In Int. Conf. on Principles of Distributed Systems (OPODIS). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.","author":"Abraham Ittai","year":"2017","unstructured":"Ittai Abraham, Dahlia Malkhi, Kartik Nayak, Ling Ren, and Alexander Spiegelman. 2017. Solida: A Blockchain Protocol Based on Reconfigurable Byzantine Consensus. In Int. Conf. on Principles of Distributed Systems (OPODIS). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1137\/0201008","article-title":"The transitive reduction of a directed graph","volume":"1","author":"Aho Alfred V.","year":"1972","unstructured":"Alfred V. Aho, Michael R Garey, and Jeffrey D. Ullman. 1972. The transitive reduction of a directed graph. SIAM J. Comput. 1, 2 (1972), 131--137.","journal-title":"SIAM J. Comput."},{"key":"e_1_2_1_4_1","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1109\/TDSC.2010.70","article-title":"Prime: Byzantine replication under attack","volume":"8","author":"Amir Yair","year":"2011","unstructured":"Yair Amir, Brian Coan, Jonathan Kirsch, and John Lane. 2011. Prime: Byzantine replication under attack. Transactions on Dependable and Secure Computing 8, 4 (2011), 564--577.","journal-title":"Transactions on Dependable and Secure Computing"},{"key":"e_1_2_1_5_1","volume-title":"Int. Conf. on Network Protocols (ICNP). IEEE, 55--65","author":"Asayag Avi","year":"2018","unstructured":"Avi Asayag, Gad Cohen, Ido Grayevsky, Maya Leshkowitz, Ori Rottenstreich, Ronen Tamari, and David Yakira. 2018. A fair consensus protocol for transaction ordering. In Int. Conf. on Network Protocols (ICNP). IEEE, 55--65."},{"key":"e_1_2_1_7_1","volume-title":"Conf. on Innovative Data Systems Research (CIDR).","author":"Baker Jason","year":"2011","unstructured":"Jason Baker, Chris Bond, James C Corbett, JJ Furman, Andrey Khorlin, James Larson, Jean-Michel Leon, Yawei Li, Alexander Lloyd, and Vadim Yushprakh. 2011. Megastore: Providing scalable, highly available storage for interactive services. In Conf. on Innovative Data Systems Research (CIDR)."},{"key":"e_1_2_1_8_1","volume-title":"Bernardo David, Tore Kasper Frederiksen, and Lorenzo Gentile.","author":"Baum Carsten","year":"2021","unstructured":"Carsten Baum, James Hsin-yu Chiang, Bernardo David, Tore Kasper Frederiksen, and Lorenzo Gentile. 2021. Sok: Mitigation of front-running in decentralized finance. Cryptology ePrint Archive (2021)."},{"key":"e_1_2_1_9_1","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1109\/TSE.1985.232242","article-title":"Implementing fault-tolerant distributed objects","volume":"6","author":"Birman Kenneth P","year":"1985","unstructured":"Kenneth P Birman, Thomas A Joseph, Thomas Raeuchle, and Amr El Abbadi. 1985. Implementing fault-tolerant distributed objects. Trans. on Software Engineering 6 (1985), 502--508.","journal-title":"Trans. on Software Engineering"},{"key":"e_1_2_1_10_1","volume-title":"Symposium on Principles of Distributed Computing (PODC). ACM, 154--162","author":"Bracha Gabriel","year":"1984","unstructured":"Gabriel Bracha. 1984. An asynchronous [(n-1)\/3]-resilient consensus protocol. In Symposium on Principles of Distributed Computing (PODC). ACM, 154--162."},{"key":"e_1_2_1_11_1","doi-asserted-by":"crossref","first-page":"824","DOI":"10.1145\/4221.214134","article-title":"Asynchronous consensus and broadcast protocols","volume":"32","author":"Bracha Gabriel","year":"1985","unstructured":"Gabriel Bracha and Sam Toueg. 1985. Asynchronous consensus and broadcast protocols. Journal of the ACM (JACM) 32, 4 (1985), 824--840.","journal-title":"Journal of the ACM (JACM)"},{"key":"e_1_2_1_12_1","volume-title":"Annual Technical Conf. (ATC). USENIX Association, 49--60","author":"Bronson Nathan","year":"2013","unstructured":"Nathan Bronson, Zach Amsden, George Cabrera, Prasad Chakka, Peter Dimov, Hui Ding, Jack Ferris, Anthony Giardullo, Sachin Kulkarni, and Harry Li. 2013. TAO: Facebook's Distributed Data Store for the Social Graph. In Annual Technical Conf. (ATC). USENIX Association, 49--60."},{"key":"e_1_2_1_13_1","volume-title":"Annual Int. Cryptology Conf. Springer, 524--541","author":"Cachin Christian","year":"2001","unstructured":"Christian Cachin, Klaus Kursawe, Frank Petzold, and Victor Shoup. 2001. Secure and efficient asynchronous broadcast protocols. In Annual Int. Cryptology Conf. Springer, 524--541."},{"key":"e_1_2_1_14_1","volume-title":"Quick Order Fairness. In Int. Conf. on Financial Cryptography and Data Security (FC). Springer, 1--18","author":"Cachin Christian","year":"2022","unstructured":"Christian Cachin, Jovana Mi\u0107i\u0107, and Nathalie Steinhauer. 2022. Quick Order Fairness. In Int. Conf. on Financial Cryptography and Data Security (FC). Springer, 1--18."},{"key":"e_1_2_1_15_1","volume-title":"Symposium on Operating Systems Design and Implementation (OSDI). USENIX Association, 173--186","author":"Castro Miguel","year":"1999","unstructured":"Miguel Castro and Barbara Liskov. 1999. Practical Byzantine fault tolerance. In Symposium on Operating Systems Design and Implementation (OSDI). USENIX Association, 173--186."},{"key":"e_1_2_1_16_1","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1145\/571637.571640","article-title":"Practical Byzantine fault tolerance and proactive recovery","volume":"20","author":"Castro Miguel","year":"2002","unstructured":"Miguel Castro and Barbara Liskov. 2002. Practical Byzantine fault tolerance and proactive recovery. Transactions on Computer Systems (TOCS) 20, 4 (2002), 398--461.","journal-title":"Transactions on Computer Systems (TOCS)"},{"key":"e_1_2_1_17_1","unstructured":"Chainlink. 2023. What Is Maximal Extractable Value (MEV)? https:\/\/chain.link\/education-hub\/maximal-extractable-value-mev."},{"key":"e_1_2_1_18_1","volume-title":"Symposium on Networked Systems Design and Implementation (NSDI)","volume":"9","author":"Clement Allen","year":"2009","unstructured":"Allen Clement, Edmund L Wong, Lorenzo Alvisi, Michael Dahlin, and Mirco Marchetti. 2009. Making Byzantine Fault Tolerant Systems Tolerate Byzantine Faults.. In Symposium on Networked Systems Design and Implementation (NSDI), Vol. 9. USENIX Association, 153--168."},{"key":"e_1_2_1_19_1","first-page":"8","article-title":"Spanner: Google's globally distributed database","volume":"31","author":"Corbett James C","year":"2013","unstructured":"James C Corbett, Jeffrey Dean, Michael Epstein, Andrew Fikes, Christopher Frost, Jeffrey John Furman, Sanjay Ghemawat, Andrey Gubarev, Christopher Heiser, and Peter Hochschild. 2013. Spanner: Google's globally distributed database. Transactions on Computer Systems (TOCS) 31, 3 (2013), 8.","journal-title":"Transactions on Computer Systems (TOCS)"},{"key":"e_1_2_1_20_1","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1093\/comjnl\/bxh145","article-title":"From consensus to atomic broadcast: Time-free Byzantine-resistant protocols without signatures","volume":"49","author":"Correia Miguel","year":"2006","unstructured":"Miguel Correia, Nuno Ferreira Neves, and Paulo Ver\u00edssimo. 2006. From consensus to atomic broadcast: Time-free Byzantine-resistant protocols without signatures. Comput. J. 49, 1 (2006), 82--96.","journal-title":"Comput. J."},{"key":"e_1_2_1_21_1","volume-title":"Symposium on Security and Privacy (SP). IEEE.","author":"Crain Tyler","year":"2021","unstructured":"Tyler Crain, Christopher Natoli, and Vincent Gramoli. 2021. Red Belly: a secure, fair and scalable open blockchain. In Symposium on Security and Privacy (SP). IEEE."},{"key":"e_1_2_1_22_1","volume-title":"Symposium on Security and Privacy (SP). IEEE, 910--927","author":"Daian Philip","year":"2020","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 Symposium on Security and Privacy (SP). IEEE, 910--927."},{"key":"e_1_2_1_23_1","volume-title":"European Conf. on Computer Systems (EuroSys). 34--50","author":"Danezis George","year":"2022","unstructured":"George Danezis, Lefteris Kokoris-Kogias, Alberto Sonnino, and Alexander Spiegelman. 2022. Narwhal and Tusk: a DAG-based mempool and efficient BFT consensus. In European Conf. on Computer Systems (EuroSys). 34--50."},{"key":"e_1_2_1_24_1","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1145\/1323293.1294281","article-title":"Dynamo: Amazon's highly available key-value store","volume":"41","author":"DeCandia Giuseppe","year":"2007","unstructured":"Giuseppe DeCandia, Deniz Hastorun, Madan Jampani, Gunavardhan Kakulapati, Avinash Lakshman, Alex Pilchin, Swaminathan Sivasubramanian, Peter Vosshall, and Werner Vogels. 2007. Dynamo: Amazon's highly available key-value store. Operating Systems Review (OSR) 41, 6 (2007), 205--220.","journal-title":"Operating Systems Review (OSR)"},{"key":"e_1_2_1_25_1","volume-title":"Annual Technical Conf. (ATC). USENIX Association, 1--14","author":"Duplyakin Dmitry","year":"2019","unstructured":"Dmitry Duplyakin, Robert Ricci, Aleksander Maricq, Gary Wong, Jonathon Duerig, Eric Eide, Leigh Stoller, Mike Hibler, David Johnson, Kirk Webb, et al. 2019. The Design and Operation of {CloudLab}. In Annual Technical Conf. (ATC). USENIX Association, 1--14."},{"key":"e_1_2_1_26_1","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1145\/42282.42283","article-title":"Consensus in the presence of partial synchrony","volume":"35","author":"Dwork Cynthia","year":"1988","unstructured":"Cynthia Dwork, Nancy Lynch, and Larry Stockmeyer. 1988. Consensus in the presence of partial synchrony. Journal of the ACM (JACM) 35, 2 (1988), 288--323.","journal-title":"Journal of the ACM (JACM)"},{"key":"e_1_2_1_27_1","volume-title":"Int. Conf. on Financial Cryptography and Data Security (FC). Springer, 170--189","author":"Eskandari Shayan","year":"2019","unstructured":"Shayan Eskandari, Seyedehmahsa Moosavi, and Jeremy Clark. 2019. Sok: Transparent dishonesty: front-running attacks on blockchain. In Int. Conf. on Financial Cryptography and Data Security (FC). Springer, 170--189."},{"key":"e_1_2_1_28_1","doi-asserted-by":"crossref","first-page":"613","DOI":"10.14778\/3055540.3055553","article-title":"High performance transactions via early write visibility","volume":"10","author":"Faleiro Jose M","year":"2017","unstructured":"Jose M Faleiro, Daniel J Abadi, and Joseph M Hellerstein. 2017. High performance transactions via early write visibility. Proc. of the VLDB Endowment 10, 5 (2017), 613--624.","journal-title":"Proc. of the VLDB Endowment"},{"key":"e_1_2_1_29_1","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1145\/3149.214121","article-title":"Impossibility of distributed consensus with one faulty process","volume":"32","author":"Fischer Michael J","year":"1985","unstructured":"Michael J Fischer, Nancy A Lynch, and Michael S Paterson. 1985. Impossibility of distributed consensus with one faulty process. Journal of the ACM (JACM) 32, 2 (1985), 374--382.","journal-title":"Journal of the ACM (JACM)"},{"key":"e_1_2_1_30_1","volume-title":"Symposium on Principles of Distributed Computing (PODC). 211--220","author":"Fitzi Matthias","year":"2003","unstructured":"Matthias Fitzi and Juan A Garay. 2003. Efficient player-optimal protocols for strong and differential consensus. In Symposium on Principles of Distributed Computing (PODC). 211--220."},{"key":"e_1_2_1_31_1","volume-title":"Symposium on Operating Systems Principles (SOSP). ACM, 51--68","author":"Gilad Yossi","year":"2017","unstructured":"Yossi Gilad, Rotem Hemo, Silvio Micali, Georgios Vlachos, and Nickolai Zeldovich. 2017. Algorand: Scaling byzantine agreements for cryptocurrencies. In Symposium on Operating Systems Principles (SOSP). ACM, 51--68."},{"key":"e_1_2_1_32_1","volume-title":"Diablo: A Benchmark Suite for Blockchains. In European Conf. on Computer Systems (EuroSys). ACM.","author":"Gramoli Vincent","year":"2023","unstructured":"Vincent Gramoli, Rachid Guerraoui, Andrei Lebedev, Chris Natoli, and Gauthier Voron. 2023. Diablo: A Benchmark Suite for Blockchains. In European Conf. on Computer Systems (EuroSys). ACM."},{"key":"e_1_2_1_33_1","volume-title":"SoK: Preventing Transaction Reordering Manipulations in Decentralized Finance. In Conf. on Advances in Financial Technologies (AFT). ACM, 1--14","author":"Heimbach Lioba","year":"2022","unstructured":"Lioba Heimbach and Roger Wattenhofer. 2022. SoK: Preventing Transaction Reordering Manipulations in Decentralized Finance. In Conf. on Advances in Financial Technologies (AFT). ACM, 1--14."},{"key":"e_1_2_1_34_1","doi-asserted-by":"crossref","first-page":"1496","DOI":"10.14778\/1454159.1454211","article-title":"H-store: a high-performance, distributed main memory transaction processing system","volume":"1","author":"Kallman Robert","year":"2008","unstructured":"Robert Kallman, Hideaki Kimura, Jonathan Natkins, Andrew Pavlo, Alexander Rasin, Stanley Zdonik, Evan PC Jones, Samuel Madden, Michael Stonebraker, and Yang Zhang. 2008. H-store: a high-performance, distributed main memory transaction processing system. Proc. of the VLDB Endowment 1, 2 (2008), 1496-- 1499.","journal-title":"Proc. of the VLDB Endowment"},{"key":"e_1_2_1_35_1","volume-title":"Symposium on Principles of Distributed Computing (PODC). ACM, 165--175","author":"Keidar Idit","year":"2021","unstructured":"Idit Keidar, Eleftherios Kokoris-Kogias, Oded Naor, and Alexander Spiegelman. 2021. All you need is dag. In Symposium on Principles of Distributed Computing (PODC). ACM, 165--175."},{"key":"e_1_2_1_36_1","volume-title":"ASIA Public-Key Cryptography Workshop. ACM, 3--14","author":"Kelkar Mahimna","year":"2022","unstructured":"Mahimna Kelkar, Soubhik Deb, and Sreeram Kannan. 2022. Order-fair consensus in the permissionless setting. In ASIA Public-Key Cryptography Workshop. ACM, 3--14."},{"key":"e_1_2_1_37_1","volume-title":"SIGSAC Conf. on Computer and Communications Security (CCS). ACM, 475--489","author":"Kelkar Mahimna","year":"2023","unstructured":"Mahimna Kelkar, Soubhik Deb, Sishan Long, Ari Juels, and Sreeram Kannan. 2023. Themis: Fast, strong order-fairness in byzantine consensus. In SIGSAC Conf. on Computer and Communications Security (CCS). ACM, 475--489."},{"key":"e_1_2_1_38_1","volume-title":"Annual Int. Cryptology Conf. Springer, 451--480","author":"Kelkar Mahimna","year":"2020","unstructured":"Mahimna Kelkar, Fan Zhang, Steven Goldfeder, and Ari Juels. 2020. Order-fairness for byzantine consensus. In Annual Int. Cryptology Conf. Springer, 451--480."},{"key":"e_1_2_1_39_1","volume-title":"Annual Int. Cryptology Conf. Springer, 357--388","author":"Kiayias Aggelos","year":"2017","unstructured":"Aggelos Kiayias, Alexander Russell, Bernardo David, and Roman Oliynykov. 2017. Ouroboros: A provably secure proof-of-stake blockchain protocol. In Annual Int. Cryptology Conf. Springer, 357--388."},{"key":"e_1_2_1_40_1","volume-title":"Deleveraging spirals and stablecoin attacks. arXiv preprint arXiv:1906.02152","author":"Klages-Mundt Ariah","year":"2019","unstructured":"Ariah Klages-Mundt and Andreea Minca. 2019. (In) stability for the blockchain: Deleveraging spirals and stablecoin attacks. arXiv preprint arXiv:1906.02152 (2019)."},{"key":"e_1_2_1_41_1","volume-title":"Security Symposium. USENIX Association, 279--296","author":"Kogias Eleftherios Kokoris","year":"2016","unstructured":"Eleftherios Kokoris Kogias, Philipp Jovanovic, Nicolas Gailly, Ismail Khoffi, Linus Gasser, and Bryan Ford. 2016. Enhancing bitcoin security and performance with strong consistency via collective signing. In Security Symposium. USENIX Association, 279--296."},{"key":"e_1_2_1_42_1","volume-title":"Symposium on Security and Privacy (SP). IEEE, 583--598","author":"Kokoris-Kogias Eleftherios","year":"2018","unstructured":"Eleftherios Kokoris-Kogias, Philipp Jovanovic, Linus Gasser, Nicolas Gailly, Ewa Syta, and Bryan Ford. 2018. Omniledger: A secure, scale-out, decentralized ledger via sharding. In Symposium on Security and Privacy (SP). IEEE, 583--598."},{"key":"e_1_2_1_43_1","volume-title":"Conf. on Advances in Financial Technologies (AFT). ACM, 25--36","author":"Kursawe Klaus","year":"2020","unstructured":"Klaus Kursawe. 2020. Wendy, the good little fairness widget: Achieving order fairness for blockchains. In Conf. on Advances in Financial Technologies (AFT). ACM, 25--36."},{"key":"e_1_2_1_44_1","volume-title":"Wendy Grows Up: More Order Fairness. In Int. Conf. on Financial Cryptography and Data Security (FC). Springer, 191--196","author":"Kursawe Klaus","year":"2021","unstructured":"Klaus Kursawe. 2021. Wendy Grows Up: More Order Fairness. In Int. Conf. on Financial Cryptography and Data Security (FC). Springer, 191--196."},{"key":"e_1_2_1_45_1","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1145\/359545.359563","article-title":"Time, clocks, and the ordering of events in a distributed system","volume":"21","author":"Lamport Leslie","year":"1978","unstructured":"Leslie Lamport. 1978. Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21, 7 (1978), 558--565.","journal-title":"Commun. ACM"},{"key":"e_1_2_1_46_1","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/357172.357176","article-title":"The Byzantine generals problem","volume":"4","author":"Lamport Leslie","year":"1982","unstructured":"Leslie Lamport, Robert Shostak, and Marshall Pease. 1982. The Byzantine generals problem. Transactions on Programming Languages and Systems (TOPLAS) 4, 3 (1982), 382--401.","journal-title":"Transactions on Programming Languages and Systems (TOPLAS)"},{"key":"e_1_2_1_47_1","volume-title":"FairLedger: A Fair Blockchain Protocol for Financial Institutions. In Int. Conf. on Principles of Distributed Systems (OPODIS). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.","author":"Lev-Ari Kfir","year":"2019","unstructured":"Kfir Lev-Ari, Alexander Spiegelman, Idit Keidar, and Dahlia Malkhi. 2019. FairLedger: A Fair Blockchain Protocol for Financial Institutions. In Int. Conf. on Principles of Distributed Systems (OPODIS). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"key":"e_1_2_1_48_1","volume-title":"SIGSAC Conf. on Computer and Communications Security (CCS). ACM, 17--30","author":"Luu Loi","year":"2016","unstructured":"Loi Luu, Viswesh Narayanan, Chaodong Zheng, Kunal Baweja, Seth Gilbert, and Prateek Saxena. 2016. A secure sharding protocol for open blockchains. In SIGSAC Conf. on Computer and Communications Security (CCS). ACM, 17--30."},{"key":"e_1_2_1_49_1","volume-title":"SmartPool: Practical Decentralized Pooled Mining. In USENIX Security Symposium. USENIX, 1409--1426","author":"Luu Loi","year":"2017","unstructured":"Loi Luu, Yaron Velner, Jason Teutsch, and Prateek Saxena. 2017. SmartPool: Practical Decentralized Pooled Mining. In USENIX Security Symposium. USENIX, 1409--1426."},{"key":"e_1_2_1_50_1","volume-title":"Maximal Extractable Value (MEV) Protection on a DAG. arXiv preprint arXiv:2208.00940","author":"Malkhi Dahlia","year":"2022","unstructured":"Dahlia Malkhi and Pawel Szalachowski. 2022. Maximal Extractable Value (MEV) Protection on a DAG. arXiv preprint arXiv:2208.00940 (2022)."},{"key":"e_1_2_1_51_1","volume-title":"ACM SIGSAC Conf. on Computer and Communications Security (CCS). ACM SIGSAC, 680--691","author":"Miller Andrew","year":"2015","unstructured":"Andrew Miller, Ahmed Kosba, Jonathan Katz, and Elaine Shi. 2015. Nonout-sourceable scratch-off puzzles to discourage bitcoin mining coalitions. In ACM SIGSAC Conf. on Computer and Communications Security (CCS). ACM SIGSAC, 680--691."},{"key":"e_1_2_1_52_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-981-10-2738-3","volume-title":"Conf. on Computer and Communications Security (CCS). ACM, 31--42","author":"Miller Andrew","year":"2016","unstructured":"Andrew Miller, Yu Xia, Kyle Croman, Elaine Shi, and Dawn Song. 2016. The honey badger of BFT protocols. In Conf. on Computer and Communications Security (CCS). ACM, 31--42."},{"key":"e_1_2_1_53_1","volume-title":"Int. Enterprise Distributed Object Computing Conf. (EDOC). IEEE, 214--222","author":"Moser Louise E","year":"1999","unstructured":"Louise E Moser, Peter M Melliar-Smith, Priya Narasimhan, Lauren A Tewksbury, and Vana Kalogeraki. 1999. The Eternal system: An architecture for enterprise applications. In Int. Enterprise Distributed Object Computing Conf. (EDOC). IEEE, 214--222."},{"key":"e_1_2_1_54_1","volume-title":"symposium on Principles Of Distributed Computing (PODC). ACM, 315--324","author":"Pass Rafael","year":"2017","unstructured":"Rafael Pass and Elaine Shi. 2017. Fruitchains: A fair blockchain. In symposium on Principles Of Distributed Computing (PODC). ACM, 315--324."},{"key":"e_1_2_1_55_1","volume-title":"Hybrid Consensus: Efficient Consensus in the Permissionless Model. In Int.Symposium on Distributed Computing (DISC). 6.","author":"Pass Rafael","year":"2017","unstructured":"Rafael Pass and Elaine Shi. 2017. Hybrid Consensus: Efficient Consensus in the Permissionless Model. In Int.Symposium on Distributed Computing (DISC). 6."},{"key":"e_1_2_1_56_1","volume-title":"Symposium on Security and Privacy (SP). IEEE, 198--214","author":"Qin Kaihua","year":"2022","unstructured":"Kaihua Qin, Liyi Zhou, and Arthur Gervais. 2022. Quantifying blockchain extractable value: How dark is the forest?. In Symposium on Security and Privacy (SP). IEEE, 198--214."},{"key":"e_1_2_1_57_1","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1145\/98163.98167","article-title":"Implementing fault-tolerant services using the state machine approach: A tutorial","volume":"22","author":"Schneider Fred B","year":"1990","unstructured":"Fred B Schneider. 1990. Implementing fault-tolerant services using the state machine approach: A tutorial. Computing Surveys (CSUR) 22, 4 (1990), 299--319.","journal-title":"Computing Surveys (CSUR)"},{"key":"e_1_2_1_58_1","volume-title":"ACM SIGSAC Conf. on Computer and Communications Security (CCS). 2705--2718","author":"Spiegelman Alexander","year":"2022","unstructured":"Alexander Spiegelman, Neil Giridharan, Alberto Sonnino, and Lefteris Kokoris-Kogias. 2022. Bullshark: Dag bft protocols made practical. In ACM SIGSAC Conf. on Computer and Communications Security (CCS). 2705--2718."},{"key":"e_1_2_1_59_1","volume-title":"Int. Symp on Reliable Distributed Systems (SRDS). IEEE, 34--45","author":"Stathakopoulou Chrysoula","year":"2021","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 Int. Symp on Reliable Distributed Systems (SRDS). IEEE, 34--45."},{"key":"e_1_2_1_60_1","doi-asserted-by":"crossref","first-page":"1584","DOI":"10.1109\/TNSM.2021.3052038","article-title":"Helix: A Fair Blockchain Consensus Protocol Resistant to Ordering Manipulation","volume":"18","author":"Yakira David","year":"2021","unstructured":"David Yakira, Avi Asayag, Gad Cohen, Ido Grayevsky, Maya Leshkowitz, Ori Rottenstreich, and Ronen Tamari. 2021. Helix: A Fair Blockchain Consensus Protocol Resistant to Ordering Manipulation. IEEE Transactions on Network and Service Management 18, 2 (2021), 1584--1597.","journal-title":"IEEE Transactions on Network and Service Management"},{"key":"e_1_2_1_61_1","volume-title":"Symposium on Principles of Distributed Computing (PODC). ACM, 347--356","author":"Yin Maofan","year":"2019","unstructured":"Maofan Yin, Dahlia Malkhi, Michael K Reiter, Guy Golan Gueta, and Ittai Abraham. 2019. HotStuff: BFT consensus with linearity and responsiveness. In Symposium on Principles of Distributed Computing (PODC). ACM, 347--356."},{"key":"e_1_2_1_62_1","volume-title":"Symposium on Operating Systems Design and Implementation (OSDI). USENIX Association, 633--649","author":"Zhang Yunhao","year":"2020","unstructured":"Yunhao Zhang, Srinath Setty, Qi Chen, Lidong Zhou, and Lorenzo Alvisi. 2020. Byzantine ordered consensus without Byzantine oligarchy. In Symposium on Operating Systems Design and Implementation (OSDI). USENIX Association, 633--649."},{"key":"e_1_2_1_63_1","volume-title":"Symposium on Security and Privacy (SP). IEEE, 428--445","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 Symposium on Security and Privacy (SP). IEEE, 428--445."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3665844.3665861","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T22:28:25Z","timestamp":1722983305000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3665844.3665861"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5]]},"references-count":62,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2024,5]]}},"alternative-id":["10.14778\/3665844.3665861"],"URL":"https:\/\/doi.org\/10.14778\/3665844.3665861","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2024,5]]},"assertion":[{"value":"2024-08-06","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}