{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T16:21:57Z","timestamp":1783009317741,"version":"3.54.5"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030643805","type":"print"},{"value":"9783030643812","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-64381-2_1","type":"book-chapter","created":{"date-parts":[[2020,12,12]],"date-time":"2020-12-12T18:04:25Z","timestamp":1607796265000},"page":"1-30","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":31,"title":["Universal Composition with Global Subroutines: Capturing Global Setup Within Plain UC"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1353-1922","authenticated-orcid":false,"given":"Christian","family":"Badertscher","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ran","family":"Canetti","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Julia","family":"Hesse","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bj\u00f6rn","family":"Tackmann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vassilis","family":"Zikas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,12,9]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Badertscher, C., Canetti, R., Hesse, J., Tackmann, B., Zikas, V.: Universal composition with global subroutines: Capturing global setup within plain UC. Cryptology ePrint Archive (2020)","DOI":"10.1007\/978-3-030-64381-2_1"},{"issue":"4","key":"1_CR2","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1007\/s00145-010-9075-9","volume":"24","author":"B Barak","year":"2010","unstructured":"Barak, B., Canetti, R., Lindell, Y., Pass, R., Rabin, T.: Secure computation without authentication. J. Cryptol. 24(4), 720\u2013760 (2010). https:\/\/doi.org\/10.1007\/s00145-010-9075-9","journal-title":"J. Cryptol."},{"issue":"2","key":"1_CR3","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BF00196771","volume":"4","author":"D Beaver","year":"1991","unstructured":"Beaver, D.: Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority. J. Cryptol. 4(2), 75\u2013122 (1991). https:\/\/doi.org\/10.1007\/BF00196771","journal-title":"J. Cryptol."},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Badertscher, C., Ga\u017ei, P., Kiayias, A., Russell, A., Zikas, V.: Ouroboros genesis: composable proof-of-stake blockchains with dynamic availability. In: ACM CCS, pp. 913\u2013930 (2018)","DOI":"10.1145\/3243734.3243848"},{"key":"1_CR5","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":"1_CR6","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":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-540-24638-1_19","volume-title":"Theory of Cryptography","author":"M Backes","year":"2004","unstructured":"Backes, M., Pfitzmann, B., Waidner, M.: A general composition theorem for secure reactive systems. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 336\u2013354. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24638-1_19"},{"issue":"12","key":"1_CR8","doi-asserted-by":"publisher","first-page":"1685","DOI":"10.1016\/j.ic.2007.05.002","volume":"205","author":"M Backes","year":"2007","unstructured":"Backes, M., Pfitzmann, B., Waidner, M.: The reactive simulatability (RSIM) framework for asynchronous systems. Inf. Comput. 205(12), 1685\u20131720 (2007)","journal-title":"Inf. Comput."},{"issue":"1","key":"1_CR9","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 multi-party cryptographic protocols. J. Cryptol. 13(1), 143\u2013202 (2000). https:\/\/doi.org\/10.1007\/s001459910006","journal-title":"J. Cryptol."},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: FOCS, FOCS 2001, Washington, DC, USA, pp. 136\u2013145. IEEE Computer Society (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"issue":"5","key":"1_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3402457","volume":"67","author":"R Canetti","year":"2020","unstructured":"Canetti, R.: Universally composable security. J. ACM 67(5), 1\u201394 (2020)","journal-title":"J. ACM"},{"key":"1_CR12","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":"1_CR13","unstructured":"Camenisch, J., Drijvers, M., Tackmann, B.: Multi-protocol UC and its use for building modular and efficient protocols. Cryptology ePrint Archive, report 2019\/065, January 2019"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-030-34618-8_7","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"J Camenisch","year":"2019","unstructured":"Camenisch, J., Krenn, S., K\u00fcsters, R., Rausch, D.: iUC: flexible universal composability made simple. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11923, pp. 191\u2013221. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34618-8_7"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-540-45146-4_16","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"R Canetti","year":"2003","unstructured":"Canetti, R., Rabin, T.: Universal composition with joint state. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 265\u2013281. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_16"},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-662-49387-8_11","volume-title":"Public-Key Cryptography \u2013 PKC 2016","author":"R Canetti","year":"2016","unstructured":"Canetti, R., Shahaf, D., Vald, M.: Universally composable authentication and key-exchange with global PKI. In: Cheng, C.-M., Chung, K.-M., Persiano, G., Yang, B.-Y. (eds.) PKC 2016. LNCS, vol. 9615, pp. 265\u2013296. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49387-8_11"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Gilad, Y., Hemo, R., Micali, S., Vlachos, G., Zeldovich, N.: Algorand: scaling byzantine agreements for cryptocurrencies. In: Proceedings of the 26th Symposium on Operating Systems Principles, SOSP 2017, New York, NY, USA, pp. 51\u201368. Association for Computing Machinery (2017)","DOI":"10.1145\/3132747.3132757"},{"key":"1_CR18","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":"1_CR19","doi-asserted-by":"crossref","unstructured":"Hirt, M., Maurer, U.: Complete characterization of adversaries tolerable in secure multi-party computation. In: ACM PODC, pp. 25\u201334. ACM (1997)","DOI":"10.1145\/259380.259412"},{"issue":"3","key":"1_CR20","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s00145-013-9160-y","volume":"28","author":"D Hofheinz","year":"2016","unstructured":"Hofheinz, D., Shoup, V.: GNUC: a new universal composability framework. J. Cryptol. 28(3), 423\u2013508 (2016)","journal-title":"J. Cryptol."},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Kerber, T., Kohlweiss, M., Kiayias, A., Zikas, V.: Ouroboros crypsinous: Privacy-preserving proof-of-stake. IACR Cryptology ePrint Archive, 2018:1132 (2018). To appear at IEEE S&P 2019","DOI":"10.1109\/SP.2019.00063"},{"issue":"4","key":"1_CR22","doi-asserted-by":"publisher","first-page":"1461","DOI":"10.1007\/s00145-020-09352-1","volume":"33","author":"R K\u00fcsters","year":"2020","unstructured":"K\u00fcsters, R., Tuengerthal, M., Rausch, D.: The IITM model: a simple and expressive model for universal composability. J. Cryptol. 33(4), 1461\u20131584 (2020). https:\/\/doi.org\/10.1007\/s00145-020-09352-1","journal-title":"J. Cryptol."},{"key":"1_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-642-27375-9_3","volume-title":"Theory of Security and Applications","author":"U Maurer","year":"2012","unstructured":"Maurer, U.: Constructive cryptography \u2013 a new paradigm for security definitions and proofs. In: M\u00f6dersheim, S., Palamidessi, C. (eds.) TOSCA 2011. LNCS, vol. 6993, pp. 33\u201356. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-27375-9_3"},{"key":"1_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/3-540-46766-1_32","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201991","author":"S Micali","year":"1992","unstructured":"Micali, S., Rogaway, P.: Secure computation. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 392\u2013404. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_32"},{"key":"1_CR25","unstructured":"Maurer, U., Renner, R.: Abstract cryptography. In: Innovations in Computer Science (2011)"},{"key":"1_CR26","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":"1_CR27","doi-asserted-by":"crossref","unstructured":"Pfitzmann, B., Waidner, M.: Composition and integrity preservation of secure reactive systems. In: ACM CCS, pp. 245\u2013254 (2000)","DOI":"10.1145\/352600.352639"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-64381-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,12]],"date-time":"2023-12-12T01:06:51Z","timestamp":1702343211000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-64381-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030643805","9783030643812"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-64381-2_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"9 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Theory of Cryptography Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 November 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 November 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"websubrev","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"167","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":"71","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":"43% - 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":"4","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":"17","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":"Due to the Corona pandemic this event was held virtually.","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}