{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T11:26:18Z","timestamp":1765106778610,"version":"3.46.0"},"publisher-location":"Singapore","reference-count":30,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819550951","type":"print"},{"value":"9789819550968","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"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":[[2026]]},"DOI":"10.1007\/978-981-95-5096-8_10","type":"book-chapter","created":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T11:24:30Z","timestamp":1765106670000},"page":"305-337","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Universally Composable Transaction Order Fairness: Refined Definitions and\u00a0Adaptive Security"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5062-0388","authenticated-orcid":false,"given":"Michele","family":"Ciampi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2451-1430","authenticated-orcid":false,"given":"Aggelos","family":"Kiayias","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4316-8116","authenticated-orcid":false,"given":"Yu","family":"Shen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,8]]},"reference":[{"key":"10_CR1","unstructured":"Badertscher, C., Campanelli, M., Ciampi, M., Russo, L., Siniscalchi, L.: Universally composable SNARKs with transparent setup without programmable random oracle. Cryptology ePrint Archive, Report 2024\/1549 (2024). https:\/\/eprint.iacr.org\/2024\/1549"},{"key":"10_CR2","doi-asserted-by":"publisher","unstructured":"Badertscher, C., Canetti, R., Hesse, J., Tackmann, B., Zikas, V.: Universal composition with global subroutines: Capturing global setup within plain UC. In: Pass, R., Pietrzak, K. (eds.) TCC\u00a02020: 18th Theory of Cryptography Conference, Part\u00a0III. Lecture Notes in Computer Science, vol. 12552, pp. 1\u201330. Springer, Cham, Switzerland, Durham, NC, USA (Nov\u00a016\u201319, 2020). https:\/\/doi.org\/10.1007\/978-3-030-64381-2_1","DOI":"10.1007\/978-3-030-64381-2_1"},{"key":"10_CR3","doi-asserted-by":"publisher","unstructured":"Badertscher, C., Gazi, P., Kiayias, A., Russell, A., Zikas, V.: Ouroboros genesis: Composable proof-of-stake blockchains with dynamic availability. In: Lie, D., Mannan, M., Backes, M., Wang, X. (eds.) ACM CCS 2018: 25th Conference on Computer and Communications Security, pp. 913\u2013930. ACM Press, Toronto, ON, Canada (Oct\u00a015\u201319, 2018). https:\/\/doi.org\/10.1145\/3243734.3243848","DOI":"10.1145\/3243734.3243848"},{"key":"10_CR4","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":"10_CR5","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, Berkeley, CA, USA (May\u00a018\u201321, 2014). https:\/\/doi.org\/10.1109\/SP.2014.36","DOI":"10.1109\/SP.2014.36"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-030-64375-1_10","volume-title":"Theory of Cryptography","author":"F Benhamouda","year":"2020","unstructured":"Benhamouda, F., et al.: Can a public blockchain keep a secret? In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12550, pp. 260\u2013290. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64375-1_10"},{"key":"10_CR7","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":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-319-78381-9_11","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"J Camenisch","year":"2018","unstructured":"Camenisch, J., Drijvers, M., Gagliardoni, T., Lehmann, A., Neven, G.: The wonderful world of global random oracles. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10820, pp. 280\u2013312. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_11"},{"key":"10_CR9","doi-asserted-by":"publisher","unstructured":"Campanelli, M., David, B., Khoshakhlagh, H., Konring, A., Nielsen, J.B.: Encryption to the future - A paradigm for sending secret messages to future (anonymous) committees. In: Agrawal, S., Lin, D. (eds.) Advances in Cryptology \u2013 ASIACRYPT\u00a02022, Part\u00a0III. Lecture Notes in Computer Science, vol. 13793, pp. 151\u2013180. Springer, Cham, Switzerland, Taipei, Taiwan (Dec\u00a05\u20139, 2022). https:\/\/doi.org\/10.1007\/978-3-031-22969-5_6","DOI":"10.1007\/978-3-031-22969-5_6"},{"issue":"1","key":"10_CR10","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R Canetti","year":"2000","unstructured":"Canetti, R.: Security and composition of multiparty cryptographic protocols. J. Cryptol. 13(1), 143\u2013202 (2000). https:\/\/doi.org\/10.1007\/s001459910006","journal-title":"J. Cryptol."},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-540-70936-7_4","volume-title":"Theory of Cryptography","author":"R Canetti","year":"2007","unstructured":"Canetti, R., Dodis, Y., Pass, R., Walfish, S.: Universally composable security with global setup. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 61\u201385. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70936-7_4"},{"key":"10_CR12","doi-asserted-by":"publisher","unstructured":"Canetti, R., Kolby, S., Ravi, D., Soria-Vazquez, E., Yakoubov, S.: Taming adaptivity in YOSO protocols: The modular way. In: Rothblum, G.N., Wee, H. (eds.) TCC\u00a02023: 21st Theory of Cryptography Conference, Part\u00a0II. Lecture Notes in Computer Science, vol. 14370, pp. 33\u201362. Springer, Cham, Switzerland, Taipei, Taiwan (Nov\u00a029\u00a0\u2013\u00a0Dec\u00a02, 2023). https:\/\/doi.org\/10.1007\/978-3-031-48618-0_2","DOI":"10.1007\/978-3-031-48618-0_2"},{"key":"10_CR13","doi-asserted-by":"publisher","unstructured":"Canetti, R., Sarkar, P., Wang, X.: Triply adaptive UC NIZK. In: Agrawal, S., Lin, D. (eds.) Advances in Cryptology \u2013 ASIACRYPT\u00a02022, Part\u00a0II. Lecture Notes in Computer Science, vol. 13792, pp. 466\u2013495. Springer, Cham, Switzerland, Taipei, Taiwan (Dec\u00a05\u20139, 2022). https:\/\/doi.org\/10.1007\/978-3-031-22966-4_16","DOI":"10.1007\/978-3-031-22966-4_16"},{"key":"10_CR14","doi-asserted-by":"publisher","unstructured":"Chiang, J.H.y., David, B., Eyal, I., Gong, T.: FairPoS: input fairness in permissionless consensus. In: Bonneau, J., Weinberg, S.M. (eds.) 5th Conference on Advances in Financial Technologies (AFT 2023). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0282, pp. 10:1\u201310:23. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2023) https:\/\/doi.org\/10.4230\/LIPIcs.AFT.2023.10","DOI":"10.4230\/LIPIcs.AFT.2023.10"},{"key":"10_CR15","doi-asserted-by":"publisher","unstructured":"Ciampi, M., Kiayias, A., Shen, Y.: Universal composable transaction serialization with order fairness. In: Reyzin, L., Stebila, D. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02024, Part\u00a0II. Lecture Notes in Computer Science, vol. 14921, pp. 147\u2013180. Springer, Cham, Switzerland, Santa Barbara, CA, USA (Aug\u00a018\u201322, 2024). https:\/\/doi.org\/10.1007\/978-3-031-68379-4_5","DOI":"10.1007\/978-3-031-68379-4_5"},{"key":"10_CR16","unstructured":"Ciampi, M., Kiayias, A., Shen, Y.: Universally composable transaction order fairness: Refined definitions and adaptive security. Cryptology ePrint Archive, Paper 2025\/1527 (2025). https:\/\/eprint.iacr.org\/2025\/1527"},{"key":"10_CR17","doi-asserted-by":"publisher","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. pp. 910\u2013927. IEEE Computer Society Press, San Francisco, CA, USA (May\u00a018\u201321, 2020). https:\/\/doi.org\/10.1109\/SP40000.2020.00040","DOI":"10.1109\/SP40000.2020.00040"},{"key":"10_CR18","doi-asserted-by":"publisher","unstructured":"Garg, S., Gentry, C., Sahai, A., Waters, B.: Witness encryption and its applications. In: Boneh, D., Roughgarden, T., Feigenbaum, J. (eds.) 45th Annual ACM Symposium on Theory of Computing, pp. 467\u2013476. ACM Press, Palo Alto, CA, USA (Jun\u00a01\u20134, 2013). https:\/\/doi.org\/10.1145\/2488608.2488667","DOI":"10.1145\/2488608.2488667"},{"key":"10_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-030-84245-1_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"C Gentry","year":"2021","unstructured":"Gentry, C., et al.: YOSO: you only speak once. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12826, pp. 64\u201393. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_3"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-030-90456-2_2","volume-title":"Theory of Cryptography","author":"C Gentry","year":"2021","unstructured":"Gentry, C., Halevi, S., Magri, B., Nielsen, J.B., Yakoubov, S.: Random-index PIR and applications. In: Nissim, K., Waters, B. (eds.) TCC 2021. LNCS, vol. 13044, pp. 32\u201361. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90456-2_2"},{"key":"10_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/978-3-642-36594-2_27","volume-title":"Theory of Cryptography","author":"J Katz","year":"2013","unstructured":"Katz, J., Maurer, U., Tackmann, B., Zikas, V.: Universally composable synchronous computation. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 477\u2013498. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36594-2_27"},{"key":"10_CR22","doi-asserted-by":"publisher","unstructured":"Kelkar, M., Deb, S., Long, S., Juels, A., Kannan, S.: Themis: Fast, strong order-fairness in byzantine consensus. In: Meng, W., Jensen, C.D., Cremers, C., Kirda, E. (eds.) ACM CCS 2023: 30th Conference on Computer and Communications Security, pp. 475\u2013489. ACM Press, Copenhagen, Denmark (Nov\u00a026\u201330, 2023). https:\/\/doi.org\/10.1145\/3576915.3616658","DOI":"10.1145\/3576915.3616658"},{"key":"10_CR23","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":"10_CR24","doi-asserted-by":"publisher","unstructured":"Kiayias, A., Leonardos, N., Shen, Y.: Ordering transactions with bounded unfairness: Definitions, complexity and constructions. In: Joye, M., Leander, G. (eds.) Advances in Cryptology \u2013 EUROCRYPT\u00a02024, Part\u00a0III. Lecture Notes in Computer Science, vol. 14653, pp. 34\u201363. Springer, Cham, Switzerland, Zurich, Switzerland (May\u00a026\u201330, 2024). https:\/\/doi.org\/10.1007\/978-3-031-58734-4_2","DOI":"10.1007\/978-3-031-58734-4_2"},{"key":"10_CR25","doi-asserted-by":"publisher","unstructured":"Kursawe, K.: Wendy, the good little fairness widget: Achieving order fairness for blockchains. In: Proceedings of the 2nd ACM Conference on Advances in Financial Technologies. p. 25 36. AFT \u201920, Association for Computing Machinery, New York, NY, USA (2020). https:\/\/doi.org\/10.1145\/3419614.3423263","DOI":"10.1145\/3419614.3423263"},{"key":"10_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201991","author":"TP Pedersen","year":"1992","unstructured":"Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 129\u2013140. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_9"},{"issue":"3","key":"10_CR27","doi-asserted-by":"publisher","first-page":"986","DOI":"10.1145\/177492.177745","volume":"16","author":"MK Reiter","year":"1994","unstructured":"Reiter, M.K., Birman, K.P.: How to securely replicate services. ACM Trans. Program. Lang. Syst. 16(3), 986\u20131009 (1994). https:\/\/doi.org\/10.1145\/177492.177745","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"10_CR28","doi-asserted-by":"publisher","unstructured":"Schneider, F.B.: Implementing fault-tolerant services using the state machine approach: a tutorial. ACM Comput. Surv. 22(4), 299\u2013319 (Dec 1990). https:\/\/doi.org\/10.1145\/98163.98167","DOI":"10.1145\/98163.98167"},{"issue":"11","key":"10_CR29","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979). https:\/\/doi.org\/10.1145\/359168.359176","journal-title":"Commun. ACM"},{"key":"10_CR30","unstructured":"Zhang, Y., Setty, S., Chen, Q., Zhou, L., Alvisi, L.: Byzantine ordered consensus without byzantine oligarchy. In: Proceedings of the 14th USENIX Conference on Operating Systems Design and Implementation. USENIX Association, USA (2020)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-5096-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T11:24:31Z","timestamp":1765106671000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-5096-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,8]]},"ISBN":["9789819550951","9789819550968"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-5096-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,8]]},"assertion":[{"value":"8 December 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}