{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T06:58:31Z","timestamp":1777964311360,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662479995","type":"print"},{"value":"9783662480007","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48000-7_1","type":"book-chapter","created":{"date-parts":[[2015,7,31]],"date-time":"2015-07-31T02:27:46Z","timestamp":1438309666000},"page":"3-22","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":62,"title":["A Simpler Variant of Universally Composable Security for Standard Multiparty Computation"],"prefix":"10.1007","author":[{"given":"Ran","family":"Canetti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Asaf","family":"Cohen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yehuda","family":"Lindell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,1]]},"reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/3-540-46766-1_31","volume-title":"Advances in Cryptology - CRYPTO 1991","author":"D Beaver","year":"1992","unstructured":"Beaver, D.: Foundations of secure interactive computing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 377\u2013391. Springer, Heidelberg (1992)"},{"key":"1_CR2","unstructured":"Blum, M.: How to prove a theorem so no one else can claim it. In: Proceedings of the International Congress of Mathematicians, pp. 1444\u20131451, USA"},{"issue":"1","key":"1_CR3","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. cryptology 13(1), 143\u2013202 (2000)","journal-title":"J. cryptology"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: In the $$42$$ 42 nd FOCS, pp. 136\u2013145 (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. Cryptology ePrint Archive, Report 2000\/067 (revision of 13 December 2005)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. Cryptology ePrint Archive, Report 2000\/067 (revision of 16 July 2013)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"1_CR7","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. Cryptology ePrint Archive, Report 2000\/067 (revised 13 December 2005 and re-revised April 2013)"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-540-76900-2_6","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2007","author":"R Canetti","year":"2007","unstructured":"Canetti, R.: Obtaining universally compoable security: towards the bare bones of trust. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol. 4833, pp. 88\u2013112. Springer, Heidelberg (2007)"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Canetti, R., Cohen, A., Lindell, Y.: A simpler variant of universally composable security for standard multiparty computation (full version). Cryptology ePrint Archive, Report 2014\/553 (2014)","DOI":"10.1007\/978-3-662-48000-7_1"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-44647-8_2","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"R Canetti","year":"2001","unstructured":"Canetti, R., Fischlin, M.: Universally composable commitments. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 19\u201340. Springer, Heidelberg (2001)"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/3-540-48658-5_38","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"R Canetti","year":"1994","unstructured":"Canetti, R., Herzberg, A.: Maintaining security in the presence of transient faults. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 425\u2013438. Springer, Heidelberg (1994)"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R.,Sahai, A.: Universally composable two-party and multi-party secure computation. In: In the $$34$$ 34 th STOC, pp. 494\u2013503 (2002). Reference is to page 13 of Cryptology ePrint Archive Report 2002\/140 (version of 14 July 2003)","DOI":"10.1145\/509907.509980"},{"key":"1_CR13","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)"},{"key":"1_CR14","unstructured":"Damg\u00e5rd, I., Polychroniadou, A., Rao, V.: Adaptively Secure UC constant round multi-party computation. Cryptology ePrint Archive, Report 2014\/830 (2014)"},{"key":"1_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography: Volume 2 - Basic Applications","author":"O Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography: Volume 2 - Basic Applications. Cambridge University Press, Cambridge (2004)"},{"key":"1_CR16","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.A.: Fair computation of general functions in presence of immoral majority. In: Menezes, A., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol. 537, pp. 77\u201393. Springer, Heidelberg (1991)"},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-540-39650-5_4","volume-title":"Computer Security \u2013 ESORICS 2003","author":"D Hofheinz","year":"2003","unstructured":"Hofheinz, D., M\u00fcller-Quade, J., Steinwandt, R.: Initiator-resilient universally composable key exchange. In: Snekkenes, E., Gollmann, D. (eds.) ESORICS 2003. LNCS, vol. 2808, pp. 61\u201384. Springer, Heidelberg (2003)"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Hofheinz, D., M\u00fcller-Quade, J., Unruh, D.: Polynomial runtime and composability. IACR Cryptology ePrint Archive, report 2009\/23 (2009)","DOI":"10.1007\/s00145-010-9068-8"},{"key":"1_CR19","unstructured":"Hofheinz, D., Shoup, V.: GNUC: a new universal composability framework. IACR Cryptology ePrint Archive, report 2011\/303 (2011)"},{"key":"1_CR20","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)"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"K\u00fcsters, R.: Simulation-based security with inexhaustible interactive turing machines. In: CSFW, pp. 309\u2013320 (2006)","DOI":"10.1109\/CSFW.2006.30"},{"key":"1_CR22","unstructured":"K\u00fcsters, R., Tuengerthal, M.: The IITM model: a simple and expressive model for universal composability. IACR Cryptology ePrint Archive, report 2013\/25 (2013)"},{"issue":"3","key":"1_CR23","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s00145-008-9021-2","volume":"22","author":"Y Lindell","year":"2009","unstructured":"Lindell, Y.: General composition and universal composability in secure multi-party computation. J. Cryptology 22(3), 395\u2013428 (2009). An extended abstract appeared in the $$44$$ 44 th FOCS, pp. 394\u2013403 (2003)","journal-title":"J. Cryptology"},{"key":"1_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-540-45187-7_14","volume-title":"CONCUR 2003 - Concurrency Theory","author":"NA Lynch","year":"2003","unstructured":"Lynch, N.A., Segala, R., Vaandrager, F.W.: Compositionality for probabilistic automata. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol. 2761, pp. 208\u2013221. Springer, Heidelberg (2003)"},{"key":"1_CR25","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. 576, pp. 392\u2013404. Springer, Heidelberg (1992)"},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Tessaro, S.: An Equational Approach to Secure Multi-Party Computation. In: ITCS 2013, pp. 355\u2013372 (2013)","DOI":"10.1145\/2422436.2422478"},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"Pfitzmann, B., Waidner, M.: Composition and integrity preservation of secure reactive systems. In: In 7th ACM Conference on Computer and Communication Security, pp. 245\u2013254 (2000)","DOI":"10.1145\/352600.352639"},{"key":"1_CR28","unstructured":"Wikstr\u00f6m, D.: On the Security of Mix-Nets and Hierarchical Group Signatures. Ph.D. thesis (2005)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology -- CRYPTO 2015"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48000-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T20:40:30Z","timestamp":1748551230000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48000-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662479995","9783662480007"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48000-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"1 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}