{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T16:52:52Z","timestamp":1773247972127,"version":"3.50.1"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031673207","type":"print"},{"value":"9783031673214","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-67321-4_11","type":"book-chapter","created":{"date-parts":[[2024,8,24]],"date-time":"2024-08-24T16:02:07Z","timestamp":1724515327000},"page":"171-187","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Towards Stronger Blockchains: Security Against Front-Running Attacks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3987-7945","authenticated-orcid":false,"given":"Anshuman","family":"Misra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2451-7306","authenticated-orcid":false,"given":"Ajay D.","family":"Kshemkalyani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,25]]},"reference":[{"key":"11_CR1","unstructured":"Alpos, O., Amores-Sesar, I., Cachin, C., Yeo, M.: Eating sandwiches: modular and lightweight elimination of transaction reordering attacks. arXiv preprint arXiv:2307.02954 (2023)"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Asayag, A., et al.: A fair consensus protocol for transaction ordering. In: 2018 IEEE 26th International Conference on Network Protocols (ICNP), pp. 55\u201365. IEEE (2018)","DOI":"10.1109\/ICNP.2018.00016"},{"issue":"2","key":"11_CR3","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/0890-5401(87)90054-X","volume":"75","author":"G Bracha","year":"1987","unstructured":"Bracha, G.: Asynchronous byzantine agreement protocols. Inf. Comput. 75(2), 130\u2013143 (1987)","journal-title":"Inf. Comput."},{"issue":"4","key":"11_CR4","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1145\/4221.214134","volume":"32","author":"G Bracha","year":"1985","unstructured":"Bracha, G., Toueg, S.: Asynchronous consensus and broadcast protocols. J. ACM (JACM) 32(4), 824\u2013840 (1985)","journal-title":"J. ACM (JACM)"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1007\/3-540-44647-8_31","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"C Cachin","year":"2001","unstructured":"Cachin, C., Kursawe, K., Petzold, F., Shoup, V.: Secure and efficient asynchronous broadcast protocols. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 524\u2013541. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_31"},{"key":"11_CR6","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/978-3-031-18283-9_15","volume-title":"FC 2022","author":"C Cachin","year":"2022","unstructured":"Cachin, C., Mi\u0107i\u0107, J., Steinhauer, N., Zanolini, L.: Quick order fairness. In: Eyal, I., Garay, J. (eds.) FC 2022. LNCS, vol. 13411, pp. 316\u2013333. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-18283-9_15"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Canidio, A., Danos, V.: Commitment against front running attacks. arXiv preprint arXiv:2301.13785 (2023)","DOI":"10.1287\/mnsc.2023.01239"},{"issue":"4","key":"11_CR8","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1145\/1041680.1041682","volume":"36","author":"X D\u00e9fago","year":"2004","unstructured":"D\u00e9fago, X., Schiper, A., Urb\u00e1n, P.: Total order broadcast and multicast algorithms: taxonomy and survey. ACM Comput. Surv. (CSUR) 36(4), 372\u2013421 (2004)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Dickerson, T., Gazzillo, P., Herlihy, M., Koskinen, E.: Adding concurrency to smart contracts. In: Proceedings of the ACM Symposium on Principles of Distributed Computing, pp. 303\u2013312 (2017)","DOI":"10.1145\/3087801.3087835"},{"issue":"2","key":"11_CR10","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1145\/42282.42283","volume":"35","author":"C Dwork","year":"1988","unstructured":"Dwork, C., Lynch, N.A., Stockmeyer, L.J.: Consensus in the presence of partial synchrony. J. ACM 35(2), 288\u2013323 (1988)","journal-title":"J. ACM"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-030-43725-1_13","volume-title":"Financial Cryptography and Data Security","author":"S Eskandari","year":"2020","unstructured":"Eskandari, S., Moosavi, S., Clark, J.: SoK: transparent dishonesty: front-running attacks on blockchain. In: Bracciali, A., Clark, J., Pintore, F., R\u00f8nne, P.B., Sala, M. (eds.) FC 2019. LNCS, vol. 11599, pp. 170\u2013189. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-43725-1_13"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Hahn, A., Singh, R., Liu, C.C., Chen, S.: Smart contract-based campus demonstration of decentralized transactive energy auctions. In: 2017 IEEE Power & Energy Society Innovative Smart Grid Technologies Conference (ISGT), pp.\u00a01\u20135. IEEE (2017)","DOI":"10.1109\/ISGT.2017.8086092"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Hanifatunnisa, R., Rahardjo, B.: Blockchain based e-voting recording system design. In: 2017 11th International Conference on Telecommunication Systems Services and Applications (TSSA), pp.\u00a01\u20136. IEEE (2017)","DOI":"10.1109\/TSSA.2017.8272896"},{"issue":"04","key":"11_CR14","doi-asserted-by":"publisher","first-page":"1650017","DOI":"10.1142\/S0129626416500171","volume":"26","author":"D Imbs","year":"2016","unstructured":"Imbs, D., Raynal, M.: Trading off t-resilience for efficiency in asynchronous byzantine reliable broadcast. Parallel Process. Lett. 26(04), 1650017 (2016)","journal-title":"Parallel Process. Lett."},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Kelkar, M., Deb, S., Kannan, S.: Order-fair consensus in the permissionless setting. In: Proceedings of the 9th ACM on ASIA Public-Key Cryptography Workshop, pp. 3\u201314 (2022)","DOI":"10.1145\/3494105.3526239"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Kelkar, M., Deb, S., Long, S., Juels, A., Kannan, S.: Themis: fast, strong order-fairness in byzantine consensus. In: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, pp. 475\u2013489 (2023)","DOI":"10.1145\/3576915.3616658"},{"issue":"2","key":"11_CR17","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s00224-017-9840-3","volume":"63","author":"P Khanchandani","year":"2019","unstructured":"Khanchandani, P., Lenzen, C.: Self-stabilizing byzantine clock synchronization with optimal precision. Theory Comput. Syst. 63(2), 261\u2013305 (2019)","journal-title":"Theory Comput. Syst."},{"issue":"7","key":"11_CR18","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/359545.359563","volume":"21","author":"L Lamport","year":"1978","unstructured":"Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21(7), 558\u2013565 (1978)","journal-title":"Commun. ACM"},{"issue":"3","key":"11_CR19","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R.E., Pease, M.C.: The byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382\u2013401 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"11_CR20","unstructured":"Malekpour, M.R.: A self-stabilizing byzantine-fault-tolerant clock synchronization protocol. Technical report (2009)"},{"key":"11_CR21","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-031-17436-0_7","volume-title":"NETYS 2022","author":"A Misra","year":"2022","unstructured":"Misra, A., Kshemkalyani, A.D.: Solvability of byzantine fault-tolerant causal ordering problems. In: Koulali, M.A., Mezini, M. (eds.) NETYS 2022. LNCS, vol. 13464, pp. 87\u2013103. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-17436-0_7"},{"key":"11_CR22","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-031-44274-2_10","volume-title":"SSS 2023","author":"A Misra","year":"2023","unstructured":"Misra, A., Kshemkalyani, A.D.: Byzantine fault-tolerant causal order satisfying strong safety. In: Dolev, S., Schieber, B. (eds.) SSS 2023. LNCS, vol. 14310, pp. 111\u2013125. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-44274-2_10"},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"Misra, A., Kshemkalyani, A.D.: Byzantine fault-tolerant causal ordering. In: Proceedings of the 24th International Conference on Distributed Computing and Networking, pp. 100\u2013109 (2023)","DOI":"10.1145\/3571306.3571395"},{"issue":"5","key":"11_CR24","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1109\/TPDS.2024.3368280","volume":"35","author":"A Misra","year":"2024","unstructured":"Misra, A., Kshemkalyani, A.D.: Byzantine-tolerant causal ordering for unicasts, multicasts, and broadcasts. IEEE Trans. Parallel Distrib. Syst. 35(5), 814\u2013828 (2024). https:\/\/doi.org\/10.1109\/TPDS.2024.3368280","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"11_CR25","unstructured":"Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system. Decentralized business review (2008)"},{"issue":"2","key":"11_CR26","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"MC Pease","year":"1980","unstructured":"Pease, M.C., Shostak, R.E., Lamport, L.: Reaching agreement in the presence of faults. J. ACM 27(2), 228\u2013234 (1980)","journal-title":"J. ACM"},{"issue":"2","key":"11_CR27","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.icte.2020.09.002","volume":"7","author":"J Polge","year":"2021","unstructured":"Polge, J., Robert, J., Le Traon, Y.: Permissioned blockchain frameworks in the industry: a comparison. ICT Exp. 7(2), 229\u2013233 (2021)","journal-title":"ICT Exp."},{"key":"11_CR28","unstructured":"Saad, M., et al.: Exploring the attack surface of blockchain: a systematic overview. arXiv preprint arXiv:1904.03487 (2019)"},{"issue":"2","key":"11_CR29","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s00145-001-0020-9","volume":"15","author":"V Shoup","year":"2002","unstructured":"Shoup, V., Gennaro, R.: Securing threshold cryptosystems against chosen ciphertext attack. J. Cryptol. 15(2), 75\u201396 (2002)","journal-title":"J. Cryptol."},{"key":"11_CR30","unstructured":"Torres, C.F., Camino, R., et\u00a0al.: Frontrunner jones and the raiders of the dark forest: an empirical study of frontrunning on the ethereum blockchain. In: 30th USENIX Security Symposium (USENIX Security 2021), pp. 1343\u20131359 (2021)"},{"issue":"2014","key":"11_CR31","first-page":"1","volume":"151","author":"G Wood","year":"2014","unstructured":"Wood, G., et al.: Ethereum: a secure decentralised generalised transaction ledger. Ethereum Project Yellow Paper 151(2014), 1\u201332 (2014)","journal-title":"Ethereum Project Yellow Paper"},{"issue":"6","key":"11_CR32","first-page":"3630","volume":"49","author":"W Zhang","year":"2023","unstructured":"Zhang, W., et al.: Combatting front-running in smart contracts: attack mining, benchmark construction and vulnerability detector evaluation. IEEE Trans. Softw. Eng. 49(6), 3630\u20133646 (2023)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"11_CR33","unstructured":"Z\u00fcst, P., Nadahalli, T., Wattenhofer, Y.W.R.: Analyzing and preventing sandwich attacks in ethereum. ETH Z\u00fcrich (2021)"}],"container-title":["Lecture Notes in Computer Science","Networked Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-67321-4_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,24]],"date-time":"2024-08-24T16:04:09Z","timestamp":1724515449000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-67321-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031673207","9783031673214"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-67321-4_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"25 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NETYS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Networked Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rabat","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"netys2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/netys.net\/committees\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}