{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T04:16:24Z","timestamp":1746159384503,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":40,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642546303"},{"type":"electronic","value":"9783642546310"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54631-0_37","type":"book-chapter","created":{"date-parts":[[2014,2,20]],"date-time":"2014-02-20T10:04:17Z","timestamp":1392890657000},"page":"650-668","source":"Crossref","is-referenced-by-count":0,"title":["Cross-Domain Secure Computation"],"prefix":"10.1007","author":[{"given":"Chongwon","family":"Cho","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanjam","family":"Garg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rafail","family":"Ostrovsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"37_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/978-3-642-32009-5_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"S. Agrawal","year":"2012","unstructured":"Agrawal, S., Goyal, V., Jain, A., Prabhakaran, M., Sahai, A.: New impossibility results for concurrent composition and a non-interactive completeness theorem for secure computation. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol.\u00a07417, pp. 443\u2013460. Springer, Heidelberg (2012)"},{"key":"37_CR2","doi-asserted-by":"crossref","unstructured":"Barak, B., Canetti, R., Nielsen, J., Pass, R.: Universally composable protocols with relaxed set-up assumptions. In: FOCS, pp. 186\u2013195 (2004)","DOI":"10.1109\/FOCS.2004.71"},{"key":"37_CR3","doi-asserted-by":"crossref","unstructured":"Barak, B., Prabhakaran, M., Sahai, A.: Concurrent non-malleable zero knowledge. In: FOCS, pp. 345\u2013354 (2006)","DOI":"10.1109\/FOCS.2006.21"},{"key":"37_CR4","unstructured":"Barak, B., Sahai, A.: How to play almost any mental game over the net - concurrent composition via super-polynomial simulation. In: FOCS, pp. 543\u2013552 (2005)"},{"key":"37_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/3-540-48405-1_6","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"A. Beimel","year":"1999","unstructured":"Beimel, A., Malkin, T., Micali, S.: The all-or-nothing nature of two-party secure computation. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 80\u201397. Springer, Heidelberg (1999)"},{"issue":"2","key":"37_CR6","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s00145-005-0419-9","volume":"19","author":"R. Canetti","year":"2006","unstructured":"Canetti, R., Kushilevitz, E., Lindell, Y.: On the limitations of universally composable two-party computation without set-up assumptions. J. Cryptology\u00a019(2), 135\u2013167 (2006)","journal-title":"J. Cryptology"},{"key":"37_CR7","doi-asserted-by":"crossref","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. In: STOC, pp. 494\u2013503 (2002)","DOI":"10.1145\/509978.509980"},{"key":"37_CR8","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":"37_CR9","doi-asserted-by":"crossref","unstructured":"Canetti, R., Goldreich, O., Goldwasser, S., Micali, S.: Resettable zero-knowledge (extended abstract). In: STOC, pp. 235\u2013244 (2000)","DOI":"10.1145\/335305.335334"},{"key":"37_CR10","doi-asserted-by":"crossref","unstructured":"Canetti, R., Lin, H., Pass, R.: Adaptive hardness and composable security in the plain model from standard assumptions. In: FOCS, pp. 541\u2013550 (2010)","DOI":"10.1109\/FOCS.2010.86"},{"key":"37_CR11","doi-asserted-by":"crossref","unstructured":"Canetti, R., Pass, R., Shelat, A.: Cryptography from sunspots: How to use an imperfect reference string. In: FOCS, pp. 249\u2013259 (2007)","DOI":"10.1109\/FOCS.2007.70"},{"key":"37_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/978-3-540-78967-3_31","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"N. Chandran","year":"2008","unstructured":"Chandran, N., Goyal, V., Sahai, A.: New constructions for uc secure computation using tamper-proof hardware. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 545\u2013562. Springer, Heidelberg (2008)"},{"key":"37_CR13","doi-asserted-by":"crossref","unstructured":"Dwork, C., Naor, M., Sahai, A.: Concurrent zero-knowledge. In: STOC, pp. 409\u2013418 (1998)","DOI":"10.1145\/276698.276853"},{"key":"37_CR14","doi-asserted-by":"crossref","unstructured":"Garay, J.A., MacKenzie, P.D.: Concurrent oblivious transfer. In: FOCS, pp. 314\u2013324 (2000)","DOI":"10.1109\/SFCS.2000.892120"},{"key":"37_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-642-19571-6_19","volume-title":"Theory of Cryptography","author":"S. Garg","year":"2011","unstructured":"Garg, S., Goyal, V., Jain, A., Sahai, A.: Bringing people of different beliefs together to do uc. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol.\u00a06597, pp. 311\u2013328. Springer, Heidelberg (2011)"},{"key":"37_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-642-29011-4_8","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"S. Garg","year":"2012","unstructured":"Garg, S., Goyal, V., Jain, A., Sahai, A.: Concurrently secure computation in constant rounds. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol.\u00a07237, pp. 99\u2013116. Springer, Heidelberg (2012)"},{"key":"37_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/978-3-642-32009-5_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"S. Garg","year":"2012","unstructured":"Garg, S., Kumarasubramanian, A., Ostrovsky, R., Visconti, I.: Impossibility results for static input secure computation. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol.\u00a07417, pp. 424\u2013442. Springer, Heidelberg (2012)"},{"key":"37_CR18","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: STOC, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"37_CR19","doi-asserted-by":"crossref","unstructured":"Goyal, V.: Positive results for concurrently secure computation in the plain model. In. FOCS, pp. 41\u201350 (2012)","DOI":"10.1109\/FOCS.2012.13"},{"key":"37_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-642-14623-7_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"V. Goyal","year":"2010","unstructured":"Goyal, V., Jain, A., Ostrovsky, R.: Password-authenticated session-key generation on the internet in the plain model. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol.\u00a06223, pp. 277\u2013294. Springer, Heidelberg (2010)"},{"key":"37_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-540-78524-8_9","volume-title":"Theory of Cryptography","author":"V. Goyal","year":"2008","unstructured":"Goyal, V., Katz, J.: Universally composable multi-party computation with an unreliable common reference string. In: Canetti, R. (ed.) TCC 2008. LNCS, vol.\u00a04948, pp. 142\u2013154. Springer, Heidelberg (2008)"},{"key":"37_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/978-3-540-74143-5_18","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"J. Groth","year":"2007","unstructured":"Groth, J., Ostrovsky, R.: Cryptography in the multi-string model. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.\u00a04622, pp. 323\u2013341. Springer, Heidelberg (2007)"},{"key":"37_CR23","unstructured":"Jain, A., Ostrovsky, R., Richelson, S., Visconti, I.: Concurrent zero knowledge in the bounded player model. Cryptology ePrint Archive, Report 2012\/279 (2012), http:\/\/eprint.iacr.org\/"},{"key":"37_CR24","doi-asserted-by":"crossref","unstructured":"Katz, J.: Universally composable multi-party computation using tamper-proof hardware. In: Eurocrypt., pp. 115\u2013128 (2007)","DOI":"10.1007\/978-3-540-72540-4_7"},{"key":"37_CR25","doi-asserted-by":"crossref","unstructured":"Kilian, J.: Founding cryptography on oblivious transfer. In: STOC, pp. 20\u201331 (1988)","DOI":"10.1145\/62212.62215"},{"key":"37_CR26","doi-asserted-by":"crossref","unstructured":"Kilian, J.: More general completeness theorems for secure two-party computation. In: STOC, pp. 316\u2013324 (2000)","DOI":"10.1145\/335305.335342"},{"issue":"4","key":"37_CR27","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1137\/S0097539797321742","volume":"29","author":"J. Kilian","year":"2000","unstructured":"Kilian, J., Kushilevitz, E., Micali, S., Ostrovsky, R.: Reducibility and completeness in private computations. SIAM J. Comput.\u00a029(4), 1189\u20131208 (2000)","journal-title":"SIAM J. Comput."},{"key":"37_CR28","doi-asserted-by":"crossref","unstructured":"Kilian, J., Petrank, E.: Concurrent and resettable zero-knowledge in poly-loalgorithm rounds. In: STOC, pp. 560\u2013569 (2001)","DOI":"10.1145\/380752.380851"},{"key":"37_CR29","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Micali, S., Ostrovsky, R.: Reducibility and completeness in multi-party private computations. In: FOCS, pp. 478\u2013489 (1994)","DOI":"10.1109\/SFCS.1994.365743"},{"key":"37_CR30","doi-asserted-by":"crossref","unstructured":"Lin, H., Pass, R., Venkitasubramaniam, M.: A unified framework for concurrent security: universal composability from stand-alone non-malleability. In: STOC, pp. 179\u2013188 (2009)","DOI":"10.1145\/1536414.1536441"},{"key":"37_CR31","doi-asserted-by":"crossref","unstructured":"Lindell, Y.: Lower bounds for concurrent self composition. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 203\u2013222. Springer, Heidelberg (2004)","DOI":"10.1007\/978-3-540-24638-1_12"},{"issue":"2","key":"37_CR32","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/s00145-007-9015-5","volume":"21","author":"Y. Lindell","year":"2008","unstructured":"Lindell, Y.: Lower bounds and impossibility results for concurrent self composition. J. Cryptology\u00a021(2), 200\u2013249 (2008)","journal-title":"J. Cryptology"},{"key":"37_CR33","doi-asserted-by":"crossref","unstructured":"Micali, S., Pass, R., Rosen, A.: Input-indistinguishable computation. In: FOCS, pp. 367\u2013378 (2006)","DOI":"10.1109\/FOCS.2006.43"},{"key":"37_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/3-540-39200-9_10","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"R. Pass","year":"2003","unstructured":"Pass, R.: Simulation in quasi-polynomial time, and its application to protocol composition. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 160\u2013176. Springer, Heidelberg (2003)"},{"key":"37_CR35","doi-asserted-by":"crossref","unstructured":"Pass, R.: Bounded-concurrent secure multi-party computation with a dishonest majority. In: STOC, pp. 232\u2013241 (2004)","DOI":"10.1145\/1007352.1007393"},{"key":"37_CR36","unstructured":"Pass, R., Rosen, A.: Bounded-concurrent secure two-party computation in a constant number of rounds. In: FOCS, pp. 404\u2013413 (2003)"},{"key":"37_CR37","doi-asserted-by":"crossref","unstructured":"Prabhakaran, M., Rosen, A., Sahai, A.: Concurrent zero knowledge with logarithmic round-complexity. In: FOCS, pp. 366\u2013375 (2002)","DOI":"10.1109\/SFCS.2002.1181961"},{"key":"37_CR38","doi-asserted-by":"crossref","unstructured":"Prabhakaran, M., Sahai, A.: New notions of security: achieving universal composability without trusted setup. In: STOC, pp. 242\u2013251 (2004)","DOI":"10.1145\/1007352.1007394"},{"key":"37_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/3-540-48910-X_29","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"R. Richardson","year":"1999","unstructured":"Richardson, R., Kilian, J.: On the concurrent composition of zero-knowledge proofs. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 415\u2013431. Springer, Heidelberg (1999)"},{"key":"37_CR40","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: How to generate and exchange secrets (extended abstract). In: FOCS, pp. 162\u2013167 (1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Public-Key Cryptography \u2013 PKC 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54631-0_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T22:05:20Z","timestamp":1746137120000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54631-0_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642546303","9783642546310"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54631-0_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}