{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,27]],"date-time":"2025-07-27T07:45:16Z","timestamp":1753602316624,"version":"3.40.3"},"publisher-location":"Cham","reference-count":58,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030579890"},{"type":"electronic","value":"9783030579906"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-57990-6_5","type":"book-chapter","created":{"date-parts":[[2020,9,6]],"date-time":"2020-09-06T23:02:41Z","timestamp":1599433361000},"page":"87-107","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Black-Box Constructions of Bounded-Concurrent Secure Computation"],"prefix":"10.1007","author":[{"given":"Sanjam","family":"Garg","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0858-9289","authenticated-orcid":false,"given":"Xiao","family":"Liang","sequence":"additional","affiliation":[]},{"given":"Omkant","family":"Pandey","sequence":"additional","affiliation":[]},{"given":"Ivan","family":"Visconti","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,7]]},"reference":[{"key":"5_CR1","unstructured":"Applebaum, B., Brakerski, Z., Garg, S., Ishai, Y., Srinivasan, A.: Separating two-round secure computation from oblivious transfer. In: 11th Innovations in Theoretical Computer Science Conference (ITCS 2020). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1007\/978-3-319-70500-2_25","volume-title":"Theory of Cryptography","author":"S Badrinarayanan","year":"2017","unstructured":"Badrinarayanan, S., Goyal, V., Jain, A., Khurana, D., Sahai, A.: Round optimal concurrent MPC via strong simulation. In: Kalai, Y., Reyzin, L. (eds.) TCC 2017. LNCS, vol. 10677, pp. 743\u2013775. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70500-2_25"},{"key":"5_CR3","doi-asserted-by":"publisher","unstructured":"Barak, B.: How to go beyond the black-box simulation barrier. In: 42nd FOCS, pp. 106\u2013115. IEEE Computer Society Press (2001). https:\/\/doi.org\/10.1109\/SFCS.2001.959885","DOI":"10.1109\/SFCS.2001.959885"},{"key":"5_CR4","doi-asserted-by":"publisher","unstructured":"Barak, B.: Constant-round coin-tossing with a man in the middle or realizing the shared random string model. In: 43rd FOCS, pp. 345\u2013355. IEEE Computer Society Press (2002). https:\/\/doi.org\/10.1109\/SFCS.2002.1181957","DOI":"10.1109\/SFCS.2002.1181957"},{"key":"5_CR5","doi-asserted-by":"publisher","unstructured":"Barak, B., Lindell, Y.: Strict polynomial-time in simulation and extraction. In: 34th ACM STOC, pp. 484\u2013493. ACM Press (2002). https:\/\/doi.org\/10.1145\/509907.509979","DOI":"10.1145\/509907.509979"},{"key":"5_CR6","doi-asserted-by":"publisher","unstructured":"Barak, B., Sahai, A.: How to play almost any mental game over the net - concurrent composition via super-polynomial simulation. In: 46th FOCS, pp. 543\u2013552. IEEE Computer Society Press (2005). https:\/\/doi.org\/10.1109\/SFCS.2005.43","DOI":"10.1109\/SFCS.2005.43"},{"key":"5_CR7","doi-asserted-by":"publisher","unstructured":"Bitansky, N., Paneth, O.: From the impossibility of obfuscation to a new non-black-box simulation technique. In: 53rd FOCS, pp. 223\u2013232. IEEE Computer Society Press (2012). https:\/\/doi.org\/10.1109\/FOCS.2012.40","DOI":"10.1109\/FOCS.2012.40"},{"key":"5_CR8","doi-asserted-by":"publisher","unstructured":"Bitansky, N., Paneth, O.: On the impossibility of approximate obfuscation and applications to resettable cryptography. In: Boneh, D., Roughgarden, T., Feigenbaum, J. (eds.) 45th ACM STOC, pp. 241\u2013250. ACM Press (2013). https:\/\/doi.org\/10.1145\/2488608.2488639","DOI":"10.1145\/2488608.2488639"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-319-56620-7_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"B Broadnax","year":"2017","unstructured":"Broadnax, B., D\u00f6ttling, N., Hartung, G., M\u00fcller-Quade, J., Nagel, M.: Concurrently composable security with shielded super-polynomial simulators. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10210, pp. 351\u2013381. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56620-7_13"},{"key":"5_CR10","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 (2001). https:\/\/doi.org\/10.1109\/SFCS.2001.959888","DOI":"10.1109\/SFCS.2001.959888"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/3-540-39200-9_5","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2003","author":"R Canetti","year":"2003","unstructured":"Canetti, R., Kushilevitz, E., Lindell, Y.: On the limitations of universally composable two-party computation without set-up assumptions. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 68\u201386. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_5"},{"key":"5_CR12","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 (2010). https:\/\/doi.org\/10.1109\/FOCS.2010.86","DOI":"10.1109\/FOCS.2010.86"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-642-00457-5_23","volume-title":"Theory of Cryptography","author":"SG Choi","year":"2009","unstructured":"Choi, S.G., Dachman-Soled, D., Malkin, T., Wee, H.: Simple, black-box constructions of adaptively secure protocols. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 387\u2013402. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00457-5_23"},{"issue":"1","key":"5_CR14","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/s00145-017-9254-z","volume":"31","author":"SG Choi","year":"2017","unstructured":"Choi, S.G., Dachman-Soled, D., Malkin, T., Wee, H.: A black-box construction of non-malleable encryption from semantically secure encryption. J. Cryptol. 31(1), 172\u2013201 (2017)","journal-title":"J. Cryptol."},{"key":"5_CR15","doi-asserted-by":"publisher","unstructured":"Chung, K.M., Pass, R., Seth, K.: Non-black-box simulation from one-way functions and applications to resettable security. In: Boneh, D., Roughgarden, T., Feigenbaum, J. (eds.) 45th ACM STOC, pp. 231\u2013240. ACM Press (2013). https:\/\/doi.org\/10.1145\/2488608.2488638","DOI":"10.1145\/2488608.2488638"},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-76900-2_31","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2007","author":"R Cramer","year":"2007","unstructured":"Cramer, R., et al.: Bounded CCA2-secure encryption. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol. 4833, pp. 502\u2013518. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-76900-2_31"},{"key":"5_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. LNCS, vol. 8269, pp. 316\u2013336. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-42033-7_17"},{"key":"5_CR18","doi-asserted-by":"publisher","unstructured":"Dwork, C., Naor, M., Sahai, A.: Concurrent zero-knowledge. In: 30th ACM STOC, pp. 409\u2013418. ACM Press (1998). https:\/\/doi.org\/10.1145\/276698.276853","DOI":"10.1145\/276698.276853"},{"key":"5_CR19","doi-asserted-by":"publisher","unstructured":"Feige, U., Shamir, A.: Witness indistinguishable and witness hiding protocols. In: 22nd ACM STOC, pp. 416\u2013426. ACM Press (1990). https:\/\/doi.org\/10.1145\/100216.100272","DOI":"10.1145\/100216.100272"},{"key":"5_CR20","doi-asserted-by":"publisher","unstructured":"Garay, J.A., MacKenzie, P.D.: Concurrent oblivious transfer. In: 41st FOCS, pp. 314\u2013324. IEEE Computer Society Press (2000). https:\/\/doi.org\/10.1109\/SFCS.2000.892120","DOI":"10.1109\/SFCS.2000.892120"},{"key":"5_CR21","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. 7237, pp. 99\u2013116. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_8"},{"key":"5_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/978-3-319-78375-8_19","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"S Garg","year":"2018","unstructured":"Garg, S., Kiyoshima, S., Pandey, O.: A new approach to black-box concurrent secure computation. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10821, pp. 566\u2013599. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_19"},{"key":"5_CR23","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. 7417, pp. 424\u2013442. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_25"},{"key":"5_CR24","unstructured":"Garg, S., Liang, X., Pandey, O., Visconti, I.: Black-box constructions of bounded-concurrent secure computation. Cryptology ePrint Archive, Report 2020\/216 (2020). https:\/\/eprint.iacr.org\/2020\/216"},{"key":"5_CR25","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or A completeness theorem for protocols with honest majority. In: Aho, A. (ed.) 19th ACM STOC, pp. 218\u2013229. ACM Press (May 1987). https:\/\/doi.org\/10.1145\/28395.28420","DOI":"10.1145\/28395.28420"},{"key":"5_CR26","doi-asserted-by":"publisher","unstructured":"Goyal, V.: Constant round non-malleable protocols using one way functions. In: Fortnow, L., Vadhan, S.P. (eds.) 43rd ACM STOC, pp. 695\u2013704. ACM Press (2011). https:\/\/doi.org\/10.1145\/1993636.1993729","DOI":"10.1145\/1993636.1993729"},{"key":"5_CR27","doi-asserted-by":"publisher","unstructured":"Goyal, V.: Positive results for concurrently secure computation in the plain model. In: 53rd FOCS, pp. 41\u201350. IEEE Computer Society Press (2012). https:\/\/doi.org\/10.1109\/FOCS.2012.13","DOI":"10.1109\/FOCS.2012.13"},{"key":"5_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1007\/978-3-642-38348-9_40","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"V Goyal","year":"2013","unstructured":"Goyal, V., Jain, A.: On concurrently secure computation in the multiple ideal query model. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 684\u2013701. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_40"},{"key":"5_CR29","doi-asserted-by":"publisher","unstructured":"Goyal, V., Lee, C.K., Ostrovsky, R., Visconti, I.: Constructing non-malleable commitments: a black-box approach. In: 53rd FOCS, pp. 51\u201360. IEEE Computer Society Press (2012). https:\/\/doi.org\/10.1109\/FOCS.2012.47","DOI":"10.1109\/FOCS.2012.47"},{"key":"5_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-662-46494-6_12","volume-title":"Theory of Cryptography","author":"V Goyal","year":"2015","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. LNCS, vol. 9014, pp. 260\u2013289. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46494-6_12"},{"key":"5_CR31","doi-asserted-by":"publisher","unstructured":"Goyal, V., Ostrovsky, R., Scafuro, A., Visconti, I.: Black-box non-black-box zero knowledge. In: Shmoys, D.B. (ed.) 46th ACM STOC, pp. 515\u2013524. ACM Press (2014). https:\/\/doi.org\/10.1145\/2591796.2591879","DOI":"10.1145\/2591796.2591879"},{"key":"5_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/978-3-540-78524-8_23","volume-title":"Theory of Cryptography","author":"I Haitner","year":"2008","unstructured":"Haitner, I.: Semi-honest to malicious oblivious transfer\u2014the black-box way. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 412\u2013426. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78524-8_23"},{"issue":"2","key":"5_CR33","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/100790537","volume":"40","author":"I Haitner","year":"2011","unstructured":"Haitner, I., Ishai, Y., Kushilevitz, E., Lindell, Y., Petrank, E.: Black-box constructions of protocols for secure computation. SIAM J. Comput. 40(2), 225\u2013266 (2011)","journal-title":"SIAM J. Comput."},{"key":"5_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/978-3-662-53641-4_16","volume-title":"Theory of Cryptography","author":"C Hazay","year":"2016","unstructured":"Hazay, C., Venkitasubramaniam, M.: Composable adaptive secure protocols without setup under polytime assumptions. In: Hirt, M., Smith, A. (eds.) TCC 2016. LNCS, vol. 9985, pp. 400\u2013432. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53641-4_16"},{"key":"5_CR35","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Kushilevitz, E., Lindell, Y., Petrank, E.: Black-box constructions for secure computation. In: Kleinberg, J.M. (ed.) 38th ACM STOC, pp. 99\u2013108. ACM Press (2006). https:\/\/doi.org\/10.1145\/1132516.1132531","DOI":"10.1145\/1132516.1132531"},{"key":"5_CR36","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. 5157, pp. 572\u2013591. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_32"},{"key":"5_CR37","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. 3152, pp. 335\u2013354. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28628-8_21"},{"key":"5_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-662-44381-1_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"S Kiyoshima","year":"2014","unstructured":"Kiyoshima, S.: Round-efficient black-box construction of composable multi-party computation. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8617, pp. 351\u2013368. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44381-1_20"},{"key":"5_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-642-54242-8_15","volume-title":"Theory of Cryptography","author":"S Kiyoshima","year":"2014","unstructured":"Kiyoshima, S., Manabe, Y., Okamoto, T.: Constant-round black-box construction of composable multi-party computation protocol. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol. 8349, pp. 343\u2013367. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54242-8_15"},{"key":"5_CR40","doi-asserted-by":"publisher","unstructured":"Lin, H., Pass, R.: Non-malleability amplification. In: Mitzenmacher, M. (ed.) 41st ACM STOC, pp. 189\u2013198. ACM Press (2009). https:\/\/doi.org\/10.1145\/1536414.1536442","DOI":"10.1145\/1536414.1536442"},{"key":"5_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/978-3-642-32009-5_27","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"H Lin","year":"2012","unstructured":"Lin, H., Pass, R.: Black-box constructions of composable protocols without set-up. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 461\u2013478. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_27"},{"key":"5_CR42","doi-asserted-by":"publisher","unstructured":"Lin, H., Pass, R., Venkitasubramaniam, M.: A unified framework for concurrent security: universal composability from stand-alone non-malleability. In: Mitzenmacher, M. (ed.) 41st ACM STOC, pp. 179\u2013188. ACM Press (2009). https:\/\/doi.org\/10.1145\/1536414.1536441","DOI":"10.1145\/1536414.1536441"},{"key":"5_CR43","doi-asserted-by":"publisher","unstructured":"Lindell, Y.: Bounded-concurrent secure two-party computation without setup assumptions. In: 35th ACM STOC, pp. 683\u2013692. ACM Press (2003). https:\/\/doi.org\/10.1145\/780542.780641","DOI":"10.1145\/780542.780641"},{"key":"5_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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. 2951, pp. 203\u2013222. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24638-1_12"},{"key":"5_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/11681878_18","volume-title":"Theory of Cryptography","author":"T Malkin","year":"2006","unstructured":"Malkin, T., Moriarty, R., Yakovenko, N.: Generalized environmental security from number theoretic assumptions. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 343\u2013359. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11681878_18"},{"key":"5_CR46","doi-asserted-by":"publisher","unstructured":"Micali, S., Pass, R., Rosen, A.: Input-indistinguishable computation. In: 47th FOCS, pp. 367\u2013378. IEEE Computer Society Press (2006). https:\/\/doi.org\/10.1109\/FOCS.2006.43","DOI":"10.1109\/FOCS.2006.43"},{"key":"5_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-662-48000-7_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"R Ostrovsky","year":"2015","unstructured":"Ostrovsky, R., Richelson, S., Scafuro, A.: Round-optimal black-box two-party computation. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9216, pp. 339\u2013358. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48000-7_17"},{"key":"5_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-662-46494-6_15","volume-title":"Theory of Cryptography","author":"R Ostrovsky","year":"2015","unstructured":"Ostrovsky, R., Scafuro, A., Venkitasubramanian, M.: Resettably sound zero-knowledge arguments from OWFs - the (semi) black-box way. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015. LNCS, vol. 9014, pp. 345\u2013374. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46494-6_15"},{"key":"5_CR49","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 \u2014 EUROCRYPT 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. 2656, pp. 160\u2013176. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_10"},{"key":"5_CR50","doi-asserted-by":"publisher","unstructured":"Pass, R.: Bounded-concurrent secure multi-party computation with a dishonest majority. In: Babai, L. (ed.) 36th ACM STOC, pp. 232\u2013241. ACM Press (2004). https:\/\/doi.org\/10.1145\/1007352.1007393","DOI":"10.1145\/1007352.1007393"},{"key":"5_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1007\/978-3-642-34961-4_42","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"R Pass","year":"2012","unstructured":"Pass, R., Lin, H., Venkitasubramaniam, M.: A unified framework for UC from only OT. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol. 7658, pp. 699\u2013717. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34961-4_42"},{"key":"5_CR52","doi-asserted-by":"publisher","unstructured":"Pass, R., Rosen, A.: Bounded-concurrent secure two-party computation in a constant number of rounds. In: 44th FOCS, pp. 404\u2013415. IEEE Computer Society Press (2003). https:\/\/doi.org\/10.1109\/SFCS.2003.1238214","DOI":"10.1109\/SFCS.2003.1238214"},{"key":"5_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-642-00457-5_24","volume-title":"Theory of Cryptography","author":"R Pass","year":"2009","unstructured":"Pass, R., Wee, H.: Black-box constructions of two-party protocols from one-way Functions. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 403\u2013418. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00457-5_24"},{"issue":"6","key":"5_CR54","doi-asserted-by":"publisher","first-page":"1803","DOI":"10.1137\/080733954","volume":"40","author":"C Peikert","year":"2011","unstructured":"Peikert, C., Waters, B.: Lossy trapdoor functions and their applications. SIAM J. Comput. 40(6), 1803\u20131844 (2011)","journal-title":"SIAM J. Comput."},{"key":"5_CR55","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 (2004). https:\/\/doi.org\/10.1145\/1007352.1007394","DOI":"10.1145\/1007352.1007394"},{"key":"5_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/978-3-319-10879-7_26","volume-title":"Security and Cryptography for Networks","author":"M Venkitasubramaniam","year":"2014","unstructured":"Venkitasubramaniam, M.: On adaptively secure protocols. In: Abdalla, M., De Prisco, R. (eds.) SCN 2014. LNCS, vol. 8642, pp. 455\u2013475. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10879-7_26"},{"key":"5_CR57","doi-asserted-by":"publisher","unstructured":"Wee, H.: Black-box, round-efficient secure computation via non-malleability amplification. In: 51st FOCS, pp. 531\u2013540. IEEE Computer Society Press (2010). https:\/\/doi.org\/10.1109\/FOCS.2010.87","DOI":"10.1109\/FOCS.2010.87"},{"key":"5_CR58","doi-asserted-by":"publisher","unstructured":"Yao, A.C.C.: How to generate and exchange secrets (extended abstract). In: 27th FOCS, pp. 162\u2013167. IEEE Computer Society Press (1986). https:\/\/doi.org\/10.1109\/SFCS.1986.25","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Security and Cryptography for Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-57990-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T16:02:32Z","timestamp":1619280152000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-57990-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030579890","9783030579906"],"references-count":58,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-57990-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"7 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SCN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Security and Cryptography for Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Amalfi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"scn2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/scn.unisa.it\/","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":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"87","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":"33","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":"38% - 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":"8","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":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}