{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T23:09:38Z","timestamp":1780614578450,"version":"3.54.1"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031334900","type":"print"},{"value":"9783031334917","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-33491-7_25","type":"book-chapter","created":{"date-parts":[[2023,5,27]],"date-time":"2023-05-27T11:02:45Z","timestamp":1685185365000},"page":"675-698","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Revisiting Transaction Ledger Robustness in\u00a0the\u00a0Miner Extractable Value Era"],"prefix":"10.1007","author":[{"given":"Fredrik","family":"Kamphuis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bernardo","family":"Magri","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ricky","family":"Lamberty","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sebastian","family":"Faust","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,5,28]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Abadi, A., Kiayias, A.: Multi-instance publicly verifiable time-lock puzzle and its applications (2021)","DOI":"10.1007\/978-3-662-64331-0_28"},{"key":"25_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-319-78375-8_2","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"C Badertscher","year":"2018","unstructured":"Badertscher, C., Garay, J., Maurer, U., Tschudi, D., Zikas, V.: But why does it work? A rational protocol design treatment of bitcoin. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10821, pp. 34\u201365. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_2"},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/978-3-319-63688-7_11","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"C Badertscher","year":"2017","unstructured":"Badertscher, C., Maurer, U., Tschudi, D., Zikas, V.: Bitcoin as a transaction ledger: a composable treatment. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10401, pp. 324\u2013356. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_11"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Bano, S., et al.: SoK: consensus in the age of blockchains. In: Proceedings of the 1st ACM Conference on Advances in Financial Technologies, pp. 183\u2013198 (2019)","DOI":"10.1145\/3318041.3355458"},{"key":"25_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/978-3-030-77883-5_15","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"C Baum","year":"2021","unstructured":"Baum, C., David, B., Dowsley, R., Nielsen, J.B., Oechsner, S.: TARDIS: a foundation of time-lock puzzles in UC. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12698, pp. 429\u2013459. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77883-5_15"},{"key":"25_CR6","doi-asserted-by":"publisher","unstructured":"Ben-Sasson, E., et al.: Zerocash: decentralized anonymous payments from bitcoin. In: 2014 IEEE Symposium on Security and Privacy, pp. 459\u2013474. IEEE Computer Society Press (2014). https:\/\/doi.org\/10.1109\/SP.2014.36","DOI":"10.1109\/SP.2014.36"},{"key":"25_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-662-53357-4_2","volume-title":"Financial Cryptography and Data Security","author":"J Bonneau","year":"2016","unstructured":"Bonneau, J.: Why buy when you can rent? In: Clark, J., Meiklejohn, S., Ryan, P.Y.A., Wallach, D., Brenner, M., Rohloff, K. (eds.) FC 2016. LNCS, vol. 9604, pp. 19\u201326. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53357-4_2"},{"key":"25_CR8","unstructured":"Buterin, V.: Ethereum: a next-generation smart contract and decentralized application platform (2014). https:\/\/github.com\/ethereum\/wiki\/wiki\/White-Paper"},{"key":"25_CR9","doi-asserted-by":"publisher","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: 42nd FOCS, pp. 136\u2013145. IEEE Computer Society Press (2001). https:\/\/doi.org\/10.1109\/SFCS.2001.959888","DOI":"10.1109\/SFCS.2001.959888"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Daian, P., et al.: Flash boys 2.0: frontrunning in decentralized exchanges, miner extractable value, and consensus instability. In: 2020 IEEE Symposium on Security and Privacy (SP), pp. 910\u2013927. IEEE (2020)","DOI":"10.1109\/SP40000.2020.00040"},{"key":"25_CR11","unstructured":"Delaune, S., Kremer, S., Ryan, M.: Coercion-resistance and receipt-freeness in electronic voting. In: 19th IEEE Computer Security Foundations Workshop (CSFW2006), p. 12. IEEE (2006)"},{"key":"25_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-030-57808-4_16","volume-title":"Applied Cryptography and Network Security","author":"D Deuber","year":"2020","unstructured":"Deuber, D., D\u00f6ttling, N., Magri, B., Malavolta, G., Thyagarajan, S.A.K.: Minting mechanism for proof of stake blockchains. In: Conti, M., Zhou, J., Casalicchio, E., Spognardi, A. (eds.) ACNS 2020. LNCS, vol. 12146, pp. 315\u2013334. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-57808-4_16"},{"key":"25_CR13","doi-asserted-by":"publisher","DOI":"10.21236\/ADA465464","volume-title":"Tor: The Second-generation Onion Router","author":"R Dingledine","year":"2004","unstructured":"Dingledine, R., Mathewson, N., Syverson, P.: Tor: The Second-generation Onion Router. Tech. rep, Naval Research Lab Washington DC (2004)"},{"key":"25_CR14","unstructured":"Doweck, Y., Eyal, I.: Multi-party timed commitments. arXiv preprint arXiv:2005.04883 (2020)"},{"key":"25_CR15","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":"25_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-662-46803-6_10","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"J Garay","year":"2015","unstructured":"Garay, J., Kiayias, A., Leonardos, N.: The bitcoin backbone protocol: analysis and applications. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9057, pp. 281\u2013310. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_10"},{"key":"25_CR17","unstructured":"Judmayer, A., Stifter, N., Schindler, P., Weippl, E.: Estimating (miner) extractable value is hard, let\u2019s go shopping! Cryptology ePrint Archive, Report 2021\/1231 (2021). https:\/\/ia.cr\/2021\/1231"},{"key":"25_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-642-12980-3_2","volume-title":"Towards Trustworthy Elections","author":"A Juels","year":"2010","unstructured":"Juels, A., Catalano, D., Jakobsson, M.: Coercion-resistant electronic elections. In: Chaum, D., et al. (eds.) Towards Trustworthy Elections. LNCS, vol. 6000, pp. 37\u201363. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12980-3_2"},{"key":"25_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-030-56877-1_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"M Kelkar","year":"2020","unstructured":"Kelkar, M., Zhang, F., Goldfeder, S., Juels, A.: Order-fairness for Byzantine consensus. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12172, pp. 451\u2013480. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_16"},{"key":"25_CR20","unstructured":"Khalil, R., Gervais, A., Felley, G.: TEX - A securely scalable trustless exchange. Cryptology ePrint Archive, Report 2019\/265 (2019). https:\/\/eprint.iacr.org\/2019\/265"},{"key":"25_CR21","unstructured":"Kroll, J.A., Davey, I.C., Felten, E.W.: The economics of bitcoin mining, or bitcoin in the presence of adversaries. In: Proceedings of WEIS, vol. 2013, p. 11 (2013)"},{"key":"25_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/978-3-319-70278-0_17","volume-title":"Financial Cryptography and Data Security","author":"K Liao","year":"2017","unstructured":"Liao, K., Katz, J.: Incentivizing blockchain forks via whale transactions. In: Brenner, M., et al. (eds.) FC 2017. LNCS, vol. 10323, pp. 264\u2013279. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70278-0_17"},{"issue":"11","key":"25_CR23","doi-asserted-by":"publisher","first-page":"2549","DOI":"10.1007\/s10623-018-0461-x","volume":"86","author":"J Liu","year":"2018","unstructured":"Liu, J., Jager, T., Kakvi, S.A., Warinschi, B.: How to build time-lock encryption. Des. Codes Crypt. 86(11), 2549\u20132586 (2018). https:\/\/doi.org\/10.1007\/s10623-018-0461-x","journal-title":"Des. Codes Crypt."},{"key":"25_CR24","doi-asserted-by":"publisher","unstructured":"McCorry, P., Hicks, A., Meiklejohn, S.: Smart contracts for bribing miners. In: Zohar, A., et al. (eds.) FC 2018. LNCS, vol. 10958, pp. 3\u201318. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-662-58820-8_1","DOI":"10.1007\/978-3-662-58820-8_1"},{"key":"25_CR25","doi-asserted-by":"publisher","unstructured":"Miller, A., Xia, Y., Croman, K., Shi, E., Song, D.: The honey badger of BFT protocols. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) ACM CCS 2016, pp. 31\u201342. ACM Press (2016). https:\/\/doi.org\/10.1145\/2976749.2978399","DOI":"10.1145\/2976749.2978399"},{"key":"25_CR26","volume-title":"Bitcoin: A Peer-to-peer Electronic Cash System","author":"S Nakamoto","year":"2019","unstructured":"Nakamoto, S.: Bitcoin: A Peer-to-peer Electronic Cash System. Tech. rep, Manubot (2019)"},{"key":"25_CR27","doi-asserted-by":"crossref","unstructured":"Qin, K., Zhou, L., Gervais, A.: Quantifying blockchain extractable value: how dark is the forest? arXiv preprint arXiv:2101.05511 (2021)","DOI":"10.1109\/SP46214.2022.9833734"},{"key":"25_CR28","unstructured":"Rivest, R.L., Shamir, A., Wagner, D.A.: Time-lock puzzles and timed-release crypto (1996)"},{"key":"25_CR29","doi-asserted-by":"crossref","unstructured":"Ruffing, T., Moreno-Sanchez, P., Kate, A.: P2P mixing and unlinkable bitcoin transactions. In: NDSS 2017. The Internet Society (Feb\/Mar 2017)","DOI":"10.14722\/ndss.2017.23415"},{"key":"25_CR30","doi-asserted-by":"crossref","unstructured":"Tsabary, I., Yechieli, M., Eyal, I.: MAD-HTLC: Because HTLC is crazy-cheap to attack. arXiv preprint arXiv:2006.12031 (2020)","DOI":"10.1109\/SP40001.2021.00080"},{"key":"25_CR31","doi-asserted-by":"crossref","unstructured":"Winzer, F., Herd, B., Faust, S.: Temporary censorship attacks in the presence of rational miners. In: 2019 IEEE European Symposium on Security and Privacy Workshops (EuroS &PW), pp. 357\u2013366. IEEE (2019)","DOI":"10.1109\/EuroSPW.2019.00046"}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-33491-7_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T20:30:59Z","timestamp":1695673859000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33491-7_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031334900","9783031334917"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33491-7_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"28 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACNS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applied Cryptography and Network Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kyoto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acns2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sulab-sever.u-aizu.ac.jp\/ACNS2023\/committees.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"263","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"53","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.9","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14.2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"For the workshops 34 full papers have been accepted from a total of 73 submissions; 13 poster papers are also included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}