{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T01:06:26Z","timestamp":1764119186957,"version":"3.46.0"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031486234"},{"type":"electronic","value":"9783031486241"}],"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-48624-1_19","type":"book-chapter","created":{"date-parts":[[2023,11,26]],"date-time":"2023-11-26T18:02:21Z","timestamp":1701021741000},"page":"510-541","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Composable Long-Term Security with\u00a0Rewinding"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-4647-4228","authenticated-orcid":false,"given":"Robin","family":"Berger","sequence":"first","affiliation":[]},{"given":"Brandon","family":"Broadnax","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3466-0675","authenticated-orcid":false,"given":"Michael","family":"Kloo\u00df","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0009-3213-7478","authenticated-orcid":false,"given":"Jeremias","family":"Mechler","sequence":"additional","affiliation":[]},{"given":"J\u00f6rn","family":"M\u00fcller-Quade","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0007-3082-216X","authenticated-orcid":false,"given":"Astrid","family":"Ottenhues","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6449-9494","authenticated-orcid":false,"given":"Markus","family":"Raiber","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,27]]},"reference":[{"issue":"1","key":"19_CR1","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/s00145-015-9214-4","volume":"30","author":"G Asharov","year":"2015","unstructured":"Asharov, G., Lindell, Y.: A full proof of the BGW protocol for perfectly secure multiparty computation. J. Cryptol. 30(1), 58\u2013151 (2015). https:\/\/doi.org\/10.1007\/s00145-015-9214-4","journal-title":"J. Cryptol."},{"key":"19_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 2020, Part III. LNCS, vol. 12552, pp. 1\u201330. Springer, Heidelberg (Nov 2020). https:\/\/doi.org\/10.1007\/978-3-030-64381-2_1","DOI":"10.1007\/978-3-030-64381-2_1"},{"key":"19_CR3","doi-asserted-by":"publisher","unstructured":"Beaver, D.: Commodity-based cryptography (extended abstract). In: 29th ACM STOC, pp. 446\u2013455. ACM Press (May 1997). https:\/\/doi.org\/10.1145\/258533.258637","DOI":"10.1145\/258533.258637"},{"key":"19_CR4","doi-asserted-by":"publisher","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: 20th ACM STOC, pp. 1\u201310. ACM Press (May 1988). https:\/\/doi.org\/10.1145\/62212.62213","DOI":"10.1145\/62212.62213"},{"key":"19_CR5","unstructured":"Berger, R., et al.: Composable long-term security with rewinding. Cryptology ePrint Archive, Report 2023\/363 (2023). https:\/\/eprint.iacr.org\/2023\/363"},{"key":"19_CR6","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 (Oct 2001). https:\/\/doi.org\/10.1109\/SFCS.2001.959888","DOI":"10.1109\/SFCS.2001.959888"},{"key":"19_CR7","doi-asserted-by":"publisher","unstructured":"Canetti, R.: Universally composable security. J. ACM 67(5), 28:1\u201328:94 (2020). https:\/\/doi.org\/10.1145\/3402457","DOI":"10.1145\/3402457"},{"key":"19_CR8","doi-asserted-by":"publisher","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 (Feb 2007). https:\/\/doi.org\/10.1007\/978-3-540-70936-7_4","DOI":"10.1007\/978-3-540-70936-7_4"},{"key":"19_CR9","doi-asserted-by":"publisher","unstructured":"Canetti, R., Fischlin, M.: Universally composable commitments. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 19\u201340. Springer, Heidelberg (Aug 2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_2","DOI":"10.1007\/3-540-44647-8_2"},{"key":"19_CR10","doi-asserted-by":"publisher","unstructured":"Canetti, R., Lin, H., Pass, R.: Adaptive hardness and composable security in the plain model from standard assumptions. In: 51st FOCS, pp. 541\u2013550. IEEE Computer Society Press (Oct 2010). https:\/\/doi.org\/10.1109\/FOCS.2010.86","DOI":"10.1109\/FOCS.2010.86"},{"key":"19_CR11","doi-asserted-by":"publisher","unstructured":"Canetti, R., Lin, H., Pass, R.: From unprovability to environmentally friendly protocols. In: 54th FOCS, pp. 70\u201379. IEEE Computer Society Press (Oct 2013). https:\/\/doi.org\/10.1109\/FOCS.2013.16","DOI":"10.1109\/FOCS.2013.16"},{"issue":"5","key":"19_CR12","doi-asserted-by":"publisher","first-page":"1793","DOI":"10.1137\/110847196","volume":"45","author":"R Canetti","year":"2016","unstructured":"Canetti, R., Lin, H., Pass, R.: Adaptive hardness and composable security in the plain model from standard assumptions. SIAM J. Comput. 45(5), 1793\u20131834 (2016). https:\/\/doi.org\/10.1137\/110847196","journal-title":"SIAM J. Comput."},{"key":"19_CR13","doi-asserted-by":"publisher","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. In: 34th ACM STOC, pp. 494\u2013503. ACM Press (May 2002). https:\/\/doi.org\/10.1145\/509907.509980","DOI":"10.1145\/509907.509980"},{"key":"19_CR14","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd, I., Nielsen, J.B.: Perfect hiding and perfect binding universally composable commitment schemes with constant expansion factor. In: Yung, M. (ed.) CRYPTO 2002, LNCS, vol. 2442, pp. 581\u2013596. Springer, Heidelberg (Aug 2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_37","DOI":"10.1007\/3-540-45708-9_37"},{"key":"19_CR15","doi-asserted-by":"publisher","unstructured":"D\u00f6ttling, N., Kraschewski, D., M\u00fcller-Quade, J.: Unconditional and composable security using a single stateful tamper-proof hardware token. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 164\u2013181. Springer, Heidelberg (Mar 2011). https:\/\/doi.org\/10.1007\/978-3-642-19571-6_11","DOI":"10.1007\/978-3-642-19571-6_11"},{"key":"19_CR16","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography: Basic Applications","author":"O Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography: Basic Applications, vol. 2. Cambridge University Press, Cambridge (2004)"},{"key":"19_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/BFb0032038","volume-title":"Automata, Languages and Programming","author":"O Goldreich","year":"1990","unstructured":"Goldreich, O., Krawczyk, H.: On the composition of zero-knowledge proof systems. In: Paterson, M.S. (ed.) ICALP 1990. LNCS, vol. 443, pp. 268\u2013282. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/BFb0032038"},{"key":"19_CR18","doi-asserted-by":"publisher","unstructured":"Gorbunov, S., Vaikuntanathan, V., Wichs, D.: Leveled fully homomorphic signatures from standard lattices. In: Servedio, R.A., Rubinfeld, R. (eds.) 47th ACM STOC, pp. 469\u2013477. ACM Press (Jun 2015). https:\/\/doi.org\/10.1145\/2746539.2746576","DOI":"10.1145\/2746539.2746576"},{"key":"19_CR19","doi-asserted-by":"publisher","unstructured":"Goyal, V., Lin, H., Pandey, O., Pass, R., Sahai, A.: Round-efficient concurrently composable secure computation via a robust extraction lemma. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015, Part I. LNCS, vol. 9014, pp. 260\u2013289. Springer, Heidelberg (Mar 2015). https:\/\/doi.org\/10.1007\/978-3-662-46494-6_12","DOI":"10.1007\/978-3-662-46494-6_12"},{"key":"19_CR20","doi-asserted-by":"publisher","unstructured":"Hohenberger, S., Waters, B.: Short and stateless signatures from the RSA assumption. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 654\u2013670. Springer, Heidelberg (Aug 2009). https:\/\/doi.org\/10.1007\/978-3-642-03356-8_38","DOI":"10.1007\/978-3-642-03356-8_38"},{"issue":"3","key":"19_CR21","doi-asserted-by":"publisher","first-page":"1318","DOI":"10.1007\/s00145-020-09348-x","volume":"33","author":"S Kiyoshima","year":"2020","unstructured":"Kiyoshima, S.: Statistical concurrent non-Malleable zero-knowledge from one-way functions. J. Cryptol. 33(3), 1318\u20131361 (2020). https:\/\/doi.org\/10.1007\/s00145-020-09348-x","journal-title":"J. Cryptol."},{"issue":"3","key":"19_CR22","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/s00145-022-09432-4","volume":"35","author":"B Magri","year":"2022","unstructured":"Magri, B., Malavolta, G., Schr\u00f6der, D., Unruh, D.: Everlasting UC commitments from fully malicious PUFs. J. Cryptol. 35(3), 20 (2022). https:\/\/doi.org\/10.1007\/s00145-022-09432-4","journal-title":"J. Cryptol."},{"key":"19_CR23","doi-asserted-by":"publisher","unstructured":"M\u00fcller-Quade, J., Unruh, D.: Long-term security and universal composability. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 41\u201360. Springer, Heidelberg (Feb 2007). https:\/\/doi.org\/10.1007\/978-3-540-70936-7_3","DOI":"10.1007\/978-3-540-70936-7_3"},{"issue":"4","key":"19_CR24","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1007\/s00145-010-9068-8","volume":"23","author":"J M\u00fcller-Quade","year":"2010","unstructured":"M\u00fcller-Quade, J., Unruh, D.: Long-term security and universal composability. J. Cryptol. 23(4), 594\u2013671 (2010). https:\/\/doi.org\/10.1007\/s00145-010-9068-8","journal-title":"J. Cryptol."},{"key":"19_CR25","unstructured":"Nielsen, J.: On Protocol Security in the Cryptographic Model. Ph.D. thesis, Aarhus Universitet (2003)"},{"key":"19_CR26","doi-asserted-by":"publisher","unstructured":"Orlandi, C., Ostrovsky, R., Rao, V., Sahai, A., Visconti, I.: Statistical concurrent non-malleable zero knowledge. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol. 8349, pp. 167\u2013191. Springer, Heidelberg (Feb 2014). https:\/\/doi.org\/10.1007\/978-3-642-54242-8_8","DOI":"10.1007\/978-3-642-54242-8_8"},{"key":"19_CR27","doi-asserted-by":"publisher","unstructured":"Pass, R., Dustin Tseng, W.-L., Venkitasubramaniam, M.: Concurrent zero knowledge, revisited. J. Cryptol. 27(1), 45\u201366 (2012). https:\/\/doi.org\/10.1007\/s00145-012-9137-2","DOI":"10.1007\/s00145-012-9137-2"},{"key":"19_CR28","doi-asserted-by":"publisher","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 (Aug 1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_9","DOI":"10.1007\/3-540-46766-1_9"},{"key":"19_CR29","doi-asserted-by":"publisher","unstructured":"Peikert, C., Vaikuntanathan, V., Waters, B.: A framework for efficient and composable oblivious transfer. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 554\u2013571. Springer, Heidelberg (Aug 2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_31","DOI":"10.1007\/978-3-540-85174-5_31"},{"key":"19_CR30","doi-asserted-by":"publisher","unstructured":"Prabhakaran, M., Rosen, A., Sahai, A.: Concurrent zero knowledge with logarithmic round-complexity. In: 43rd FOCS, pp. 366\u2013375. IEEE Computer Society Press (Nov 2002). https:\/\/doi.org\/10.1109\/SFCS.2002.1181961","DOI":"10.1109\/SFCS.2002.1181961"},{"key":"19_CR31","doi-asserted-by":"publisher","unstructured":"Prabhakaran, M., Sahai, A.: New notions of security: achieving universal composability without trusted setup. In: Babai, L. (ed.) 36th ACM STOC, pp. 242\u2013251. ACM Press (Jun 2004). https:\/\/doi.org\/10.1145\/1007352.1007394","DOI":"10.1145\/1007352.1007394"}],"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-031-48624-1_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T01:02:59Z","timestamp":1764118979000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-48624-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031486234","9783031486241"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-48624-1_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"27 November 2023","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":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","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":"29 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 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":"tcc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2023\/","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":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"168","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":"68","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":"40% - 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","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":"13","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":"This content has been made available to all.","name":"free","label":"Free to read"}]}}