{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T20:40:01Z","timestamp":1751316001514,"version":"3.41.0"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,2,5]],"date-time":"2018-02-05T00:00:00Z","timestamp":1517788800000},"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":["J Cryptol"],"published-print":{"date-parts":[[2019,1]]},"DOI":"10.1007\/s00145-018-9276-1","type":"journal-article","created":{"date-parts":[[2018,2,5]],"date-time":"2018-02-05T16:59:28Z","timestamp":1517849968000},"page":"178-238","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Round-Efficient Black-Box Construction of Composable Multi-Party Computation"],"prefix":"10.1007","volume":"32","author":[{"given":"Susumu","family":"Kiyoshima","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,2,5]]},"reference":[{"key":"9276_CR1","unstructured":"B. Barak, How to play almost any mental game over the net - Concurrent composition via super-polynomial simulation, in 46th FOCS (IEEE Computer Society Press, October 2005), pp. 543\u2013552"},{"key":"9276_CR2","doi-asserted-by":"crossref","unstructured":"R. Canetti, Universally composable security: A new paradigm for cryptographic protocols, in 42nd FOCS (IEEE Computer Society Press, October 2001), pp. 136\u2013145","DOI":"10.1109\/SFCS.2001.959888"},{"key":"9276_CR3","doi-asserted-by":"crossref","unstructured":"S.G. Choi, D. Dachman-Soled, T. Malkin, Hoeteck Wee, Black-box construction of a non-malleable encryption scheme from any semantically secure one, in R. Canetti, editor, TCC 2008, vol. 4948 of LNCS (Springer, Heidelberg, March 2008), pp. 427\u2013444","DOI":"10.1007\/978-3-540-78524-8_24"},{"key":"9276_CR4","doi-asserted-by":"crossref","unstructured":"S.G. Choi, D. Dachman-Soled, T. Malkin, H. Wee, Simple, black-box constructions of adaptively secure protocols, in O. Reingold, editor, TCC\u00a02009, vol. 5444 of LNCS (Springer, Heidelberg, March 2009), pp. 387\u2013402","DOI":"10.1007\/978-3-642-00457-5_23"},{"key":"9276_CR5","doi-asserted-by":"crossref","unstructured":"S.G. Choi, D. Dachman-Soled, T. Malkin, H. Wee, A black-box construction of non-malleable encryption from semantically secure encryption. J. Cryptol. (2017)","DOI":"10.1007\/s00145-017-9254-z"},{"key":"9276_CR6","doi-asserted-by":"crossref","unstructured":"R. Canetti, M. Fischlin, Universally composable commitments, in J. Kilian, editor, CRYPTO\u00a02001, vol. 2139 of LNCS (Springer, Heidelberg, August 2001), pp. 19\u201340","DOI":"10.1007\/3-540-44647-8_2"},{"key":"9276_CR7","doi-asserted-by":"crossref","unstructured":"R. Canetti, E. Kushilevitz, Y. Lindell, On the limitations of universally composable two-party computation without set-up assumptions. J. Cryptol. 19(2), 135\u2013167 (2006)","DOI":"10.1007\/s00145-005-0419-9"},{"key":"9276_CR8","doi-asserted-by":"crossref","unstructured":"R. Canetti, Y. Lindell, R. Ostrovsky, A. Sahai, Universally composable two-party and multi-party secure computation, in 34th ACM STOC (ACM Press, May 2002), pp. 494\u2013503","DOI":"10.1145\/509907.509980"},{"key":"9276_CR9","doi-asserted-by":"crossref","unstructured":"R. Canetti, H. Lin, R. Pass, Adaptive hardness and composable security in the plain model from standard assumptions, in 51st FOCS (IEEE Computer Society Press, October 2010), pp. 541\u2013550","DOI":"10.1109\/FOCS.2010.86"},{"key":"9276_CR10","doi-asserted-by":"crossref","unstructured":"R. Canetti, H. Lin, R. Pass, Adaptive hardness and composable security in the plain model from standard assumptions. SIAM J. Comput. 45(5), 1793\u20131834 (2016)","DOI":"10.1137\/110847196"},{"key":"9276_CR11","doi-asserted-by":"crossref","unstructured":"D. Dolev, C. Dwork, M. Naor, Nonmalleable cryptography. SIAM J. Comput. 30(2), 391\u2013437 (2000)","DOI":"10.1137\/S0097539795291562"},{"key":"9276_CR12","doi-asserted-by":"crossref","unstructured":"C. Dwork, M. Naor, O. Reingold, L. Stockmeyer, Magic functions. J. ACM 50(6), 852\u2013921 (2003)","DOI":"10.1145\/950620.950623"},{"key":"9276_CR13","doi-asserted-by":"crossref","unstructured":"S. Garg, V. Goyal, A. Jain, A. Sahai, Concurrently secure computation in constant rounds, in D. Pointcheval and T. Johansson, editors, EUROCRYPT\u00a02012, vol. 7237 of LNCS (Springer, Heidelberg, April 2012), pp. 99\u2013116","DOI":"10.1007\/978-3-642-29011-4_8"},{"key":"9276_CR14","doi-asserted-by":"crossref","unstructured":"V. Goyal, C.-K. Lee, R. Ostrovsky, I. Visconti, Constructing non-malleable commitments: A black-box approach, in 53rd FOCS (IEEE Computer Society Press, October 2012), pp. 51\u201360","DOI":"10.1109\/FOCS.2012.47"},{"key":"9276_CR15","doi-asserted-by":"crossref","unstructured":"V. Goyal, H. Lin, O. Pandey, R. Pass, A. Sahai, Round-efficient concurrently composable secure computation via a robust extraction lemma, in Y. Dodis and J.B. Nielsen, editors, TCC\u00a02015, Part\u00a0I, vol. 9014 of LNCS (Springer, Heidelberg, March 2015), pp. 260\u2013289","DOI":"10.1007\/978-3-662-46494-6_12"},{"key":"9276_CR16","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, A. Wigderson, How to play any mental game or A completeness theorem for protocols with honest majority, in A. Aho, editor, 19th ACM STOC (ACM Press, May 1987), pp. 218\u2013229","DOI":"10.1145\/28395.28420"},{"key":"9276_CR17","doi-asserted-by":"crossref","unstructured":"V. Goyal, Constant round non-malleable protocols using one way functions, in L. Fortnow and S.P. Vadhan, editors, 43rd ACM STOC (ACM Press, June 2011), pp. 695\u2013704","DOI":"10.1145\/1993636.1993729"},{"key":"9276_CR18","doi-asserted-by":"crossref","unstructured":"I. Haitner, Semi-honest to malicious oblivious transfer - the black-box way, in R. Canetti, editor, TCC\u00a02008, vol. 4948 of LNCS (Springer, Heidelberg, March 2008), pp. 412\u2013426","DOI":"10.1007\/978-3-540-78524-8_23"},{"key":"9276_CR19","doi-asserted-by":"crossref","unstructured":"I. Haitner, Y. Ishai, E. Kushilevitz, Y. Lindell, E. Petrank, Black-box constructions of protocols for secure computation. SIAM J. Comput. 40(2), 225\u2013266 (2011)","DOI":"10.1137\/100790537"},{"key":"9276_CR20","doi-asserted-by":"crossref","unstructured":"J. H\u00e5stad, R. Impagliazzo, L.A. Levin, M. Luby, A pseudorandom generator from any one-way function. SIAM J. Comput. 28(4), 1364\u20131396 (1999)","DOI":"10.1137\/S0097539793244708"},{"key":"9276_CR21","doi-asserted-by":"crossref","unstructured":"Y. Ishai, E. Kushilevitz, Y. Lindell, E. Petrank, Black-box constructions for secure computation, in J.M. Kleinberg, editor, 38th ACM STOC (ACM Press, May 2006), pp. 99\u2013108","DOI":"10.1145\/1132516.1132531"},{"key":"9276_CR22","doi-asserted-by":"crossref","unstructured":"Y. Ishai, M. Prabhakaran, A. Sahai, Founding cryptography on oblivious transfer - efficiently, in D. Wagner, editor, CRYPTO\u00a02008, vol. 5157 of LNCS (Springer, Heidelberg, August 2008), pp. 572\u2013591","DOI":"10.1007\/978-3-540-85174-5_32"},{"key":"9276_CR23","doi-asserted-by":"crossref","unstructured":"S. Kiyoshima, Y. Manabe, T. Okamoto, Constant-round black-box construction of composable multi-party computation protocol, in Y. Lindell, editor, TCC\u00a02014, vol. 8349 of LNCS (Springer, Heidelberg, February 2014), pp. 343\u2013367","DOI":"10.1007\/978-3-642-54242-8_15"},{"key":"9276_CR24","doi-asserted-by":"crossref","unstructured":"H. Lin, R. Pass, Black-box constructions of composable protocols without set-up, in R. Safavi-Naini and R. Canetti, editors, CRYPTO\u00a02012, vol. 7417 of LNCS (Springer, Heidelberg, August 2012), pp. 461\u2013478","DOI":"10.1007\/978-3-642-32009-5_27"},{"key":"9276_CR25","doi-asserted-by":"crossref","unstructured":"H. Lin, R. Pass, M. Venkitasubramaniam, Concurrent non-malleable commitments from any one-way function, in R. Canetti, editor, TCC\u00a02008, vol. 4948 of LNCS (Springer, Heidelberg, March 2008), pp. 571\u2013588","DOI":"10.1007\/978-3-540-78524-8_31"},{"key":"9276_CR26","doi-asserted-by":"crossref","unstructured":"T. Malkin, R. Moriarty, N. Yakovenko, Generalized environmental security from number theoretic assumptions, in S. Halevi and T. Rabin, editors, TCC\u00a02006, vol. 3876 of LNCS (Springer, Heidelberg, March 2006), pp. 343\u2013359","DOI":"10.1007\/11681878_18"},{"key":"9276_CR27","doi-asserted-by":"crossref","unstructured":"D. Micciancio, S.J. Ong, A. Sahai, S.P. Vadhan, Concurrent zero knowledge without complexity assumptions, in S. Halevi and T. Rabin, editors, TCC\u00a02006, vol. 3876 of LNCS (Springer, Heidelberg, March 2006), pp. 1\u201320","DOI":"10.1007\/11681878_1"},{"key":"9276_CR28","doi-asserted-by":"crossref","unstructured":"M. Naor, Bit commitment using pseudorandomness. J. Cryptol. 4(2), 151\u2013158 (1991)","DOI":"10.1007\/BF00196774"},{"key":"9276_CR29","doi-asserted-by":"crossref","unstructured":"R. Pass, Simulation in quasi-polynomial time, and its application to protocol composition, in E. Biham, editor, EUROCRYPT\u00a02003, vol. 2656 of LNCS (Springer, Heidelberg, May 2003), pp. 160\u2013176","DOI":"10.1007\/3-540-39200-9_10"},{"key":"9276_CR30","doi-asserted-by":"crossref","unstructured":"R. Pass, H. Lin, M. Venkitasubramaniam, A unified framework for UC from only OT, in X. Wang and K. Sako, editors, ASIACRYPT\u00a02012, vol. 7658 of LNCS (Springer, Heidelberg, December 2012), pp. 699\u2013717","DOI":"10.1007\/978-3-642-34961-4_42"},{"key":"9276_CR31","doi-asserted-by":"crossref","unstructured":"M. Prabhakaran, A. Rosen, A. Sahai, Concurrent zero knowledge with logarithmic round-complexity, in 43rd FOCS (IEEE Computer Society Press, November 2002), pp. 366\u2013375","DOI":"10.1109\/SFCS.2002.1181961"},{"key":"9276_CR32","doi-asserted-by":"crossref","unstructured":"M. Prabhakaran, A. Sahai, New notions of security: Achieving universal composability without trusted setup, in L. Babai, editor, 36th ACM STOC (ACM Press, June 2004), pp. 242\u2013251","DOI":"10.1145\/1007352.1007394"},{"key":"9276_CR33","doi-asserted-by":"crossref","unstructured":"R. Pass, W.-L.D. Tseng, M. Venkitasubramaniam, Concurrent zero knowledge, revisited. J. Cryptol. 27(1), 45\u201366 (2014).","DOI":"10.1007\/s00145-012-9137-2"},{"key":"9276_CR34","doi-asserted-by":"crossref","unstructured":"R. Pass, H. Wee, Black-box constructions of two-party protocols from one-way functions, in O. Reingold, editor, TCC\u00a02009, vol. 5444 of LNCS (Springer, Heidelberg, March 2009), pp. 403\u2013418","DOI":"10.1007\/978-3-642-00457-5_24"},{"key":"9276_CR35","doi-asserted-by":"crossref","unstructured":"R. Richardson, J. Kilian, On the concurrent composition of zero-knowledge proofs, in J. Stern, editor, EUROCRYPT\u201999, vol. 1592 of LNCS (Springer, Heidelberg, May 1999), pp. 415\u2013431","DOI":"10.1007\/3-540-48910-X_29"},{"key":"9276_CR36","doi-asserted-by":"crossref","unstructured":"H. Wee, Black-box, round-efficient secure computation via non-malleability amplification, in 51st FOCS (IEEE Computer Society Press, October 2010), pp. 531\u2013540","DOI":"10.1109\/FOCS.2010.87"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-018-9276-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-018-9276-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-018-9276-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T20:23:35Z","timestamp":1751315015000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-018-9276-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,5]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["9276"],"URL":"https:\/\/doi.org\/10.1007\/s00145-018-9276-1","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"type":"print","value":"0933-2790"},{"type":"electronic","value":"1432-1378"}],"subject":[],"published":{"date-parts":[[2018,2,5]]},"assertion":[{"value":"4 October 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 November 2017","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 February 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}