{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T17:03:52Z","timestamp":1787504632937,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662464960","type":"print"},{"value":"9783662464977","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":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-46497-7_23","type":"book-chapter","created":{"date-parts":[[2015,3,9]],"date-time":"2015-03-09T02:37:58Z","timestamp":1425868678000},"page":"586-613","source":"Crossref","is-referenced-by-count":33,"title":["Adaptively Secure, Universally Composable, Multiparty Computation in Constant Rounds"],"prefix":"10.1007","author":[{"given":"Dana","family":"Dachman-Soled","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jonathan","family":"Katz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vanishree","family":"Rao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Barak, B., Canetti, R., Nielsen, J.B., Pass, R.: Universally composable protocols with relaxed set-up assumptions. In: 45th Annual Symposium on Foundations of Computer Science (FOCS), pp. 186\u2013195. IEEE (2004)","DOI":"10.1109\/FOCS.2004.71"},{"key":"23_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BFb0052228","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"D. Beaver","year":"1997","unstructured":"Beaver, D.: Plug and play encryption. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 75\u201389. Springer, Heidelberg (1997)"},{"key":"23_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/3-540-47555-9_26","volume-title":"Advances in Cryptology - EUROCRYPT \u201992","author":"D. Beaver","year":"1993","unstructured":"Beaver, D., Haber, S.: Cryptographic protocols provably secure against dynamic adversaries. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol.\u00a0658, pp. 307\u2013323. Springer, Heidelberg (1993)"},{"key":"23_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-642-28914-9_15","volume-title":"Theory of Cryptography","author":"N. Bitansky","year":"2012","unstructured":"Bitansky, N., Canetti, R., Halevi, S.: Leakage-tolerant interactive protocols. In: Cramer, R. (ed.) TCC 2012. LNCS, vol.\u00a07194, pp. 266\u2013284. Springer, Heidelberg (2012)"},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/978-3-662-44381-1_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"N. Bitansky","year":"2014","unstructured":"Bitansky, N., Dachman-Soled, D., Lin, H.: Leakage-tolerant computation with input-independent preprocessing. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014, Part II. LNCS, vol.\u00a08617, pp. 146\u2013163. Springer, Heidelberg (2014)"},{"key":"23_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-642-42045-0_15","volume-title":"Advances in Cryptology - ASIACRYPT 2013","author":"D. Boneh","year":"2013","unstructured":"Boneh, D., Waters, B.: Constrained pseudorandom functions and their applications. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013, Part II. LNCS, vol.\u00a08270, pp. 280\u2013300. Springer, Heidelberg (2013)"},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/978-3-642-54631-0_29","volume-title":"Public-Key Cryptography \u2013 PKC 2014","author":"E. Boyle","year":"2014","unstructured":"Boyle, E., Goldwasser, S., Ivan, I.: Functional signatures and pseudorandom functions. In: Krawczyk, H. (ed.) PKC 2014. LNCS, vol.\u00a08383, pp. 501\u2013519. Springer, Heidelberg (2014)"},{"issue":"1","key":"23_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. Journal of Cryptology\u00a013(1), 143\u2013202 (2000)","journal-title":"Journal of Cryptology"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: 42nd Annual Symposium on Foundations of Computer Science (FOCS), pp. 136\u2013145. IEEE (2001), Full version at http:\/\/eprint.iacr.org\/2000\/067\/","DOI":"10.1109\/SFCS.2001.959888"},{"issue":"3","key":"23_CR10","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s00145-004-0135-x","volume":"17","author":"R. Canetti","year":"2004","unstructured":"Canetti, R., Damg\u00e5rd, I., Dziembowski, S., Ishai, Y., Malkin, T.: Adaptive versus non-adaptive security of multi-party protocols. J. Crypto.\u00a017(3), 153\u2013207 (2004)","journal-title":"J. Crypto."},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Canetti, R., Feige, U., Goldreich, O., Naor, M.: Adaptively secure multiparty computation. In: 28th Annual ACM Symposium on Theory of Computing (STOC), pp. 639\u2013648. ACM Press (1996)","DOI":"10.1145\/237814.238015"},{"key":"23_CR12","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.\u00a02139, pp. 19\u201340. Springer, Heidelberg (2001)"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Canetti, R., Goldwasser, S., Poburinnaya, O.: Adaptively secure two-party computation from indistinguishability obfuscation. Cryptology ePrint Archive, Report 2014\/845 (2014)","DOI":"10.1007\/978-3-662-46497-7_22"},{"key":"23_CR14","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. In: 34th Annual ACM Symposium on Theory of Computing (STOC), pp. 494\u2013503. ACM Press (2002), Full version available at http:\/\/eprint.iacr.org\/2002\/140"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Canetti, R., Pass, R., Shelat, A.: Cryptography from sunspots: How to use an imperfect reference string. In: 48th Annual Symposium on Foundations of Computer Science (FOCS), pp. 249\u2013259. IEEE (2007)","DOI":"10.1109\/FOCS.2007.4389497"},{"key":"23_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-642-10366-7_17","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"S.G. Choi","year":"2009","unstructured":"Choi, S.G., Dachman-Soled, D., Malkin, T., Wee, H.: Improved non-committing encryption with applications to adaptively secure protocols. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol.\u00a05912, pp. 287\u2013302. Springer, Heidelberg (2009)"},{"key":"23_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/978-3-642-42033-7_17","volume-title":"Advances in Cryptology - ASIACRYPT 2013","author":"D. Dachman-Soled","year":"2013","unstructured":"Dachman-Soled, D., Malkin, T., Raykova, M., Venkitasubramaniam, M.: Adaptive and concurrent secure computation from new adaptive, non-malleable commitments. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013, Part I. LNCS, vol.\u00a08269, pp. 316\u2013336. Springer, Heidelberg (2013)"},{"key":"23_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1007\/3-540-44598-6_27","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"I.B. Damg\u00e5rd","year":"2000","unstructured":"Damg\u00e5rd, I.B., Nielsen, J.B.: Improved non-committing encryption schemes based on a general complexity assumption. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 432\u2013450. Springer, Heidelberg (2000)"},{"key":"23_CR19","unstructured":"Damg\u00e5rd, I., Polychroniadou, A., Rao, V.: Secure UC constant round multi-party computation. Cryptology ePrint Archive, Report 2014\/830 (2014)"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Garg, S., Gentry, C., Halevi, S., Raykova, M., Sahai, A., Waters, B.: Candidate indistinguishability obfuscation and functional encryption for all circuits. In: 54th Annual Symposium on Foundations of Computer Science (FOCS), pp. 40\u201349. IEEE (2013)","DOI":"10.1109\/FOCS.2013.13"},{"key":"23_CR21","doi-asserted-by":"crossref","unstructured":"Garg, S., Polychroniadou, A.: Two-round adaptively secure mpc from indistinguishability obfuscation. Cryptology ePrint Archive, Report 2014\/844 (2014)","DOI":"10.1007\/978-3-642-54242-8_4"},{"key":"23_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-642-32009-5_8","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"S. Garg","year":"2012","unstructured":"Garg, S., Sahai, A.: Adaptively secure multi-party computation with dishonest majority. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol.\u00a07417, pp. 105\u2013123. Springer, Heidelberg (2012)"},{"key":"23_CR23","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game, or a completeness theorem for protocols with honest majority. In: 19th Annual ACM Symposium on Theory of Computing (STOC), pp. 218\u2013229. ACM Press (1987)","DOI":"10.1145\/28395.28420"},{"key":"23_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/3-540-39568-7_22","volume-title":"Advances in Cryptology","author":"O. Goldreich","year":"1985","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: On the cryptographic applications of random functions. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol.\u00a0196, pp. 276\u2013288. Springer, Heidelberg (1985)"},{"key":"23_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-642-54242-8_16","volume-title":"Theory of Cryptography","author":"C. Hazay","year":"2014","unstructured":"Hazay, C., Patra, A.: One-sided adaptively secure two-party computation. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol.\u00a08349, pp. 368\u2013393. Springer, Heidelberg (2014)"},{"key":"23_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/978-3-642-17373-8_27","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"Y. Ishai","year":"2010","unstructured":"Ishai, Y., Kumarasubramanian, A., Orlandi, C., Sahai, A.: On invertible sampling and adaptive security. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol.\u00a06477, pp. 466\u2013482. Springer, Heidelberg (2010)"},{"key":"23_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/978-3-540-85174-5_32","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"Y. Ishai","year":"2008","unstructured":"Ishai, Y., Prabhakaran, M., Sahai, A.: Founding cryptography on oblivious transfer \u2013 efficiently. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 572\u2013591. Springer, Heidelberg (2008)"},{"key":"23_CR28","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.\u00a03152, pp. 335\u2013354. Springer, Heidelberg (2004)"},{"key":"23_CR29","doi-asserted-by":"crossref","unstructured":"Kiayias, A., Papadopoulos, S., Triandopoulos, N., Zacharias, T.: Delegatable pseudorandom functions and applications. In: 20th ACM Conf. on Computer and Communications Security (CCS), pp. 669\u2013684. ACM Press (2013)","DOI":"10.1145\/2508859.2516668"},{"key":"23_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-642-00862-7_8","volume-title":"Topics in Cryptology \u2013 CT-RSA 2009","author":"A.Y. Lindell","year":"2009","unstructured":"Lindell, A.Y.: Adaptively secure two-party computation with erasures. In: Fischlin, M. (ed.) CT-RSA 2009. LNCS, vol.\u00a05473, pp. 117\u2013132. Springer, Heidelberg (2009)"},{"key":"23_CR31","doi-asserted-by":"crossref","unstructured":"Sahai, A., Waters, B.: How to use indistinguishability obfuscation: Deniable encryption, and more. In: 46th Annual ACM Symposium on Theory of Com- puting (STOC), pp. 475\u2013484. ACM Press (2014)","DOI":"10.1145\/2591796.2591825"},{"key":"23_CR32","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: How to generate and exchange secrets. In: 27th Annual Sympo- sium on Foundations of Computer Science (FOCS), pp. 162\u2013167. IEEE (1986)","DOI":"10.1109\/SFCS.1986.25"}],"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-662-46497-7_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,20]],"date-time":"2025-05-20T16:00:57Z","timestamp":1747756857000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-46497-7_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662464960","9783662464977"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-46497-7_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}