{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T07:19:30Z","timestamp":1769843970353,"version":"3.49.0"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031683787","type":"print"},{"value":"9783031683794","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-68379-4_5","type":"book-chapter","created":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T20:17:23Z","timestamp":1723753043000},"page":"147-180","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Universal Composable Transaction Serialization with\u00a0Order Fairness"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5062-0388","authenticated-orcid":false,"given":"Michele","family":"Ciampi","sequence":"first","affiliation":[]},{"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":[[2024,8,16]]},"reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-64381-2_1","volume-title":"Theory of Cryptography","author":"C Badertscher","year":"2020","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 2020. LNCS, vol. 12552, pp. 1\u201330. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64381-2_1"},{"key":"5_CR2","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, Toronto, ON, Canada, pp. 913\u2013930. ACM Press (2018). https:\/\/doi.org\/10.1145\/3243734.3243848","DOI":"10.1145\/3243734.3243848"},{"key":"5_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, Part I. LNCS, vol. 10401, pp. 324\u2013356. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_11"},{"key":"5_CR4","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, Part I. LNCS, vol. 12550, pp. 260\u2013290. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64375-1_10"},{"key":"5_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":"5_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., Micic, J., Steinhauer, N., Zanolini, L.: Quick order fairness. In: Eyal, I., Garay, J.A. (eds.) FC 2022. LNCS, vol. 13411, pp. 316\u2013333. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-18283-9_15"},{"key":"5_CR7","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, Part I. LNCS, vol. 10820, pp. 280\u2013312. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_11"},{"issue":"1","key":"5_CR8","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":"5_CR9","doi-asserted-by":"publisher","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: 42nd Annual Symposium on Foundations of Computer Science, Las Vegas, NV, USA, pp. 136\u2013145. IEEE Computer Society Press (2001). https:\/\/doi.org\/10.1109\/SFCS.2001.959888","DOI":"10.1109\/SFCS.2001.959888"},{"key":"5_CR10","unstructured":"Costan, V., Devadas, S.: Intel SGX explained. Cryptology ePrint Archive, Report 2016\/086 (2016). https:\/\/eprint.iacr.org\/2016\/086"},{"key":"5_CR11","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, San Francisco, CA, USA, pp. 910\u2013927. IEEE Computer Society Press (2020). https:\/\/doi.org\/10.1109\/SP40000.2020.00040","DOI":"10.1109\/SP40000.2020.00040"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Danezis, G., Meiklejohn, S.: Centrally banked cryptocurrencies. In: ISOC Network and Distributed System Security Symposium \u2013 NDSS\u00a02016, San Diego, CA, USA. The Internet Society (2016)","DOI":"10.14722\/ndss.2016.23187"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/978-3-030-64375-1_12","volume-title":"Theory of Cryptography","author":"M Fitzi","year":"2020","unstructured":"Fitzi, M., Ga\u017ei, P., Kiayias, A., Russell, A.: Ledger combiners for fast settlement. In: Pass, R., Pietrzak, K. (eds.) TCC 2020, Part I. LNCS, vol. 12550, pp. 322\u2013352. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64375-1_12"},{"key":"5_CR14","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, Part II. LNCS, vol. 9057, pp. 281\u2013310. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_10"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-319-63688-7_10","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"J Garay","year":"2017","unstructured":"Garay, J., Kiayias, A., Leonardos, N.: The bitcoin backbone protocol with chains of variable difficulty. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017, Part I. LNCS, vol. 10401, pp. 291\u2013323. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_10"},{"issue":"1","key":"5_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00446-021-00399-2","volume":"35","author":"R Guerraoui","year":"2022","unstructured":"Guerraoui, R., Kuznetsov, P., Monti, M., Pavlovic, M., Seredinschi, D.A.: The consensus number of a cryptocurrency. Distrib. Comput. 35(1), 1\u201315 (2022). https:\/\/doi.org\/10.1007\/s00446-021-00399-2","journal-title":"Distrib. Comput."},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-540-28628-8_21","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"J Katz","year":"2004","unstructured":"Katz, J., Ostrovsky, R.: Round-optimal secure two-party computation. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 335\u2013354. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28628-8_21"},{"key":"5_CR18","doi-asserted-by":"publisher","unstructured":"Kelkar, M., Deb, S., Kannan, S.: Order-fair consensus in the permissionless setting. In: Cruz, J.P., Yanai, N. (eds.) APKC 2022: Proceedings of the 9th ACM on ASIA Public-Key Cryptography Workshop, APKC@AsiaCCS 2022, Nagasaki, Japan, 30 May 2022, pp. 3\u201314. ACM (2022). https:\/\/doi.org\/10.1145\/3494105.3526239","DOI":"10.1145\/3494105.3526239"},{"key":"5_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, Part III. LNCS, vol. 12172, pp. 451\u2013480. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_16"},{"key":"5_CR20","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.) EUROCRYPT 2024, pp. 34\u201363. Springer Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58734-4_2","DOI":"10.1007\/978-3-031-58734-4_2"},{"key":"5_CR21","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, AFT 2020, pp. 25\u201336. Association for Computing Machinery, New York (2020). https:\/\/doi.org\/10.1145\/3419614.3423263","DOI":"10.1145\/3419614.3423263"},{"key":"5_CR22","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-031-22318-1_8","volume-title":"TCC 2022, Part I","author":"A Lysyanskaya","year":"2022","unstructured":"Lysyanskaya, A., Rosenbloom, L.N.: Universally composable $$\\varSigma $$-protocols in the global random-oracle model. In: Kiltz, E., Vaikuntanathan, V. (eds.) TCC 2022, Part I. LNCS, vol. 13747, pp. 203\u2013233. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-22318-1_8"},{"key":"5_CR23","doi-asserted-by":"publisher","unstructured":"Malkhi, D., Szalachowski, P.: Maximal extractable value (MEV) protection on a DAG. In: Amoussou-Guenou, Y., Kiayias, A., Verdier, M. (eds.) 4th International Conference on Blockchain Economics, Security and Protocols (Tokenomics 2022). Open Access Series in Informatics (OASIcs), vol.\u00a0110, pp. 6:1\u20136:17. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2023). https:\/\/doi.org\/10.4230\/OASIcs.Tokenomics.2022.6","DOI":"10.4230\/OASIcs.Tokenomics.2022.6"},{"key":"5_CR24","unstructured":"Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system (2008). https:\/\/bitcoin.org\/bitcoin.pdf"},{"key":"5_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/978-3-319-56614-6_22","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"R Pass","year":"2017","unstructured":"Pass, R., Seeman, L., Shelat, A.: Analysis of the blockchain protocol in asynchronous networks. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10211, pp. 643\u2013673. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56614-6_22"},{"key":"5_CR26","doi-asserted-by":"publisher","unstructured":"Pass, R., Shi, E.: FruitChains: a fair blockchain. In: Schiller, E.M., Schwarzmann, A.A. (eds.) 36th ACM Symposium Annual on Principles of Distributed Computing, Washington, DC, USA, pp. 315\u2013324. Association for Computing Machinery (2017). https:\/\/doi.org\/10.1145\/3087801.3087809","DOI":"10.1145\/3087801.3087809"},{"key":"5_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-319-56620-7_10","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"R Pass","year":"2017","unstructured":"Pass, R., Shi, E., Tram\u00e8r, F.: Formal abstractions for attested execution secure processors. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017, Part I. LNCS, vol. 10210, pp. 260\u2013289. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56620-7_10"},{"key":"5_CR28","doi-asserted-by":"publisher","unstructured":"Pease, M.C., Shostak, R.E., Lamport, L.: Reaching agreement in the presence of faults. J. ACM 27(2), 228\u2013234 (1980). https:\/\/doi.org\/10.1145\/322186.322188","DOI":"10.1145\/322186.322188"},{"issue":"3","key":"5_CR29","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."},{"issue":"4","key":"5_CR30","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1145\/98163.98167","volume":"22","author":"FB Schneider","year":"1990","unstructured":"Schneider, F.B.: Implementing fault-tolerant services using the state machine approach: a tutorial. ACM Comput. Surv. 22(4), 299\u2013319 (1990). https:\/\/doi.org\/10.1145\/98163.98167","journal-title":"ACM Comput. Surv."},{"key":"5_CR31","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 CRYPTO 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-68379-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T20:18:33Z","timestamp":1723753113000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-68379-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031683787","9783031683794"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-68379-4_5","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":"16 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"18 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}