{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T17:08:12Z","timestamp":1787504892074,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540709350","type":"print"},{"value":"9783540709367","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70936-7_9","type":"book-chapter","created":{"date-parts":[[2007,5,16]],"date-time":"2007-05-16T07:43:44Z","timestamp":1179301424000},"page":"157-173","source":"Crossref","is-referenced-by-count":8,"title":["On the Necessity of Rewinding in Secure Multiparty Computation"],"prefix":"10.1007","author":[{"given":"Michael","family":"Backes","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J\u00f6rn","family":"M\u00fcller-Quade","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dominique","family":"Unruh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"Backes, M., Pfitzmann, B., Waidner, M.: Secure asynchronous reactive systems. IACR Cryptology ePrint Archive 2004\/082 (Mar. 2004)"},{"issue":"2","key":"9_CR2","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. Journal of Cryptology\u00a04(2), 75\u2013122 (1991)","journal-title":"Journal of Cryptology"},{"issue":"1","key":"9_CR3","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"3","author":"R. Canetti","year":"2000","unstructured":"Canetti, R.: Security and composition of multiparty cryptographic protocols. Journal of Cryptology\u00a03(1), 143\u2013202 (2000)","journal-title":"Journal of Cryptology"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: Proc. 42nd IEEE Symposium on Foundations of Computer Science (FOCS), pp. 136\u2013145 (2001) Extended version in Cryptology ePrint Archive, Report 2000\/67, http:\/\/eprint.iacr.org\/","DOI":"10.1109\/SFCS.2001.959888"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/3-540-44598-6_5","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"Y. Dodis","year":"2000","unstructured":"Dodis, Y., Micali, S.: Parallel reducibility for information-theoretically secure computation. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 74\u201392. Springer, Heidelberg (2000)"},{"key":"9_CR6","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography \u2013 Volume\u00a02 (Basic Applications)","author":"O. Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography \u2013 Volume\u00a02 (Basic Applications). Cambridge University Press, Cambridge (May 2004), Previous version online available at, http:\/\/www.wisdom.weizmann.ac.il\/~oded\/frag.html"},{"key":"9_CR7","first-page":"218","volume-title":"Proc. 19th Annual ACM Symposium on Theory of Computing (STOC)","author":"O. Goldreich","year":"1987","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game \u2013 or \u2013 a completeness theorem for protocols with honest majority. In: Proc. 19th Annual ACM Symposium on Theory of Computing (STOC), pp. 218\u2013229. ACM Press, New York (1987)"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/3-540-38424-3_6","volume-title":"Advances in Cryptology - CRYPTO \u201990","author":"S. Goldwasser","year":"1991","unstructured":"Goldwasser, S., Levin, L.: Fair computation of general functions in presence of immoral majority. In: Menezes, A.J., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol.\u00a0537, pp. 77\u201393. Springer, Heidelberg (1991)"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1007\/11761679_30","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"D. Hofheinz","year":"2006","unstructured":"Hofheinz, D., M\u00fcller-Quade, J., Unruh, D.: On the (im)possibility of extending coin toss. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 504\u2013521. Springer, Heidelberg (2006), Full version online available at, http:\/\/eprint.iacr.org\/2006\/177"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1007\/978-3-540-30576-7_6","volume-title":"Theory of Cryptography","author":"D. Hofheinz","year":"2005","unstructured":"Hofheinz, D., Unruh, D.: Comparing two notions of simulatability. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 86\u2013103. Springer, Heidelberg (2005), Online available at, http:\/\/iaks-www.ira.uka.de\/home\/unruh\/publications\/hofheinz05comparing.html"},{"key":"9_CR11","first-page":"169","volume-title":"IEEE Symposium on Security and Privacy, Proceedings of SSP \u201906","author":"D. Hofheinz","year":"2006","unstructured":"Hofheinz, D., Unruh, D.: Simulatable security and polynomially bounded concurrent composition. In: IEEE Symposium on Security and Privacy, Proceedings of SSP \u201906, pp. 169\u2013182. IEEE Computer Society Press, Los Alamitos (2006), Full version online available at, http:\/\/eprint.iacr.org\/2006\/130.ps"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1145\/1132516.1132532","volume-title":"38th Annual ACM Symposium on Theory of Computing, Proceedings of STOC 2006","author":"E. Kushilevitz","year":"2006","unstructured":"Kushilevitz, E., Lindell, Y., Rabin, T.: Information-theoretically secure protocols and security under composition. In: 38th Annual ACM Symposium on Theory of Computing, Proceedings of STOC 2006, pp. 109\u2013118. ACM Press, New York (2006), Online available at, http:\/\/www.cs.biu.ac.il\/~lindell\/abstracts\/IT-composition_abs.html"},{"key":"9_CR13","first-page":"683","volume-title":"35th Annual ACM Symposium on Theory of Computing, Proceedings of STOC 2003","author":"Y. Lindell","year":"2003","unstructured":"Lindell, Y.: Bounded-concurrent secure two-party computation without setup assumptions. In: 35th Annual ACM Symposium on Theory of Computing, Proceedings of STOC 2003, pp. 683\u2013692. ACM Press, New York (2003)"},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1109\/SFCS.2003.1238213","volume-title":"44th Annual Symposium on Foundations of Computer Science, Proceedings of FOCS 2003","author":"Y. Lindell","year":"2003","unstructured":"Lindell, Y.: General composition and universal composability in secure multi-party computation. In: 44th Annual Symposium on Foundations of Computer Science, Proceedings of FOCS 2003, pp. 394\u2013403. IEEE Computer Society Press, Los Alamitos (2003), Online available at, http:\/\/eprint.iacr.org\/2003\/141"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/978-3-540-24638-1_12","volume-title":"Theory of Cryptography","author":"Y. Lindell","year":"2004","unstructured":"Lindell, Y.: Lower bounds for concurrent self composition. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 203\u2013222. Springer, Heidelberg (2004)"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1007\/3-540-46766-1_32","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"S. Micali","year":"1992","unstructured":"Micali, S., Rogaway, P.: Secure computation. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 392\u2013404. Springer, Heidelberg (1992)"},{"key":"9_CR17","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1145\/352600.352639","volume-title":"Proc. 7th ACM Conference on Computer and Communications Security","author":"B. Pfitzmann","year":"2000","unstructured":"Pfitzmann, B., Waidner, M.: Composition and integrity preservation of secure reactive systems. In: Proc. 7th ACM Conference on Computer and Communications Security, pp. 245\u2013254. ACM, New York (2000), Extended version (with Matthias Schunter) IBM Research Report RZ 3206, May 2000, http:\/\/www.semper.org\/sirene\/publ\/PfSW1_00ReactSimulIBM.ps.gz"},{"key":"9_CR18","first-page":"184","volume-title":"Proc. 22nd IEEE Symposium on Security & Privacy","author":"B. Pfitzmann","year":"2004","unstructured":"Pfitzmann, B., Waidner, M.: A model for asynchronous reactive systems and its application to secure message transmission. In: Proc. 22nd IEEE Symposium on Security & Privacy, pp. 184\u2013200. IEEE, Los Alamitos (2004), Extended version of the model (with Michael Backes) IACR Cryptology ePrint Archive 2004\/082, http:\/\/eprint.iacr.org\/"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70936-7_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:13:01Z","timestamp":1605744781000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70936-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540709350","9783540709367"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70936-7_9","relation":{},"subject":[]}}