{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T23:07:10Z","timestamp":1649200030554},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T00:00:00Z","timestamp":1557273600000},"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,7]]},"DOI":"10.1007\/s00145-019-09326-y","type":"journal-article","created":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T18:25:06Z","timestamp":1557339906000},"page":"635-689","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Black-Box Complexity of Universally Composable Security in the CRS Model"],"prefix":"10.1007","volume":"32","author":[{"given":"Carmit","family":"Hazay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Muthuramakrishnan","family":"Venkitasubramaniam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,8]]},"reference":[{"key":"9326_CR1","unstructured":"B. Barak, R. Canetti, J.B. Nielsen, R. Pass, Universally composable protocols with relaxed set-up assumptions, in FOCS, (2004), pp. 186\u2013195"},{"key":"9326_CR2","unstructured":"O. Blazy, C. Chevalier, D. Pointcheval, D. Vergnaud, Analysis and improvement of lindell\u2019s uc-secure commitment schemes, in ACNS, (2013), pp. 534\u2013551"},{"key":"9326_CR3","unstructured":"D. Beaver, Foundations of secure interactive computing, in CRYPTO, (1991), pp. 377\u2013391"},{"key":"9326_CR4","unstructured":"R. Canetti, Universally composable security: a new paradigm for cryptographic protocols, in FOCS, (2001), pp. 136\u2013145"},{"key":"9326_CR5","unstructured":"S.G. Choi, D. Dachman-Soled, T. Malkin, H. Wee, Improved non-committing encryption with applications to adaptively secure protocols, in ASIACRYPT, (2009), pp. 287\u2013302"},{"key":"9326_CR6","unstructured":"S.G. Choi, D. Dachman-Soled, T. Malkin, H. Wee, Simple, black-box constructions of adaptively secure protocols, in TCC, (2009), pp. 387\u2013402"},{"key":"9326_CR7","unstructured":"R. Canetti, Y. Dodis, R. Pass, S. Walfish, Universally composable security with global setup, in TCC, (2007), pp. 61\u201385"},{"key":"9326_CR8","unstructured":"R. Canetti, M. Fischlin, Universally composable commitments, in CRYPTO, (2001), pp. 19\u201340"},{"key":"9326_CR9","unstructured":"R. Canetti, U. Feige, O. Goldreich, M. Naor, Adaptively secure multi-party computation, in STOC, (1996), pp. 639\u2013648"},{"issue":"2","key":"9326_CR10","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s00145-005-0419-9","volume":"19","author":"R Canetti","year":"2006","unstructured":"R. Canetti, E. Kushilevitz, Y. Lindell, On the limitations of universally composable two-party computation without set-up assumptions. J. Cryptol.\n                           19(2), 135\u2013167 (2006)","journal-title":"J. Cryptol."},{"key":"9326_CR11","unstructured":"S.G. Choi, J. Katz, H. Wee, H.-S. Zhou, Efficient, adaptively secure, and composable oblivious transfer with a single, global CRS, in PKC, (2013), pp. 73\u201388"},{"key":"9326_CR12","unstructured":"R. Canetti, Y. Lindell, R. Ostrovsky, A. Sahai, Universally composable two-party and multi-party secure computation, in STOC, (2002), pp. 494\u2013503"},{"key":"9326_CR13","unstructured":"R. Canetti, R. Pass, A. Shelat, Cryptography from sunspots: how to use an imperfect reference string, in FOCS, (2007), pp. 249\u2013259"},{"key":"9326_CR14","unstructured":"B. David, R. Dowsley, A.C.A. Nascimento, Universally composable oblivious transfer based on a variant of LPN, in CANS, (2014), pp. 143\u2013158"},{"key":"9326_CR15","unstructured":"I. Damg\u00e5rd, J. Groth, Non-interactive and reusable non-malleable commitment schemes, in STOC, (2003), pp. 426\u2013437"},{"key":"9326_CR16","unstructured":"D. Dachman-Soled, T. Malkin, M. Raykova, M. Venkitasubramaniam, Adaptive and concurrent secure computation from new adaptive, non-malleable commitments, in ASIACRYPT, (2013), pp. 316\u2013336"},{"key":"9326_CR17","unstructured":"I. Damg\u00e5rd, J.B. Nielsen, Improved non-committing encryption schemes based on a general complexity assumption, in CRYPTO, (2000), pp. 432\u2013450"},{"key":"9326_CR18","unstructured":"I. Damg\u00e5rd, J.B. Nielsen, Perfect hiding and perfect binding universally composable commitment schemes with constant expansion factor, in CRYPTO, (2002), pp. 581\u2013596"},{"key":"9326_CR19","unstructured":"B.M. David, A.C.A. Nascimento, J. M\u00fcller-Quade, Universally composable oblivious transfer from lossy encryption and the mceliece assumptions, in ICITS, (2012), pp. 80\u201399"},{"key":"9326_CR20","unstructured":"I. Damg\u00e5rd, J.B. Nielsen, C. Orlandi, On the necessary and sufficient assumptions for UC computation, in TCC, (2010), pp. 109\u2013127"},{"key":"9326_CR21","unstructured":"I. Damg\u00e5rd, A. Scafuro, Unconditionally secure and universally composable commitments from physical assumptions, in ASIACRYPT, (2013), pp. 100\u2013119"},{"issue":"6","key":"9326_CR22","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S Even","year":"1985","unstructured":"S. Even, O. Goldreich, A. Lempel, A randomized protocol for signing contracts. Commun. ACM, 28(6), 637\u2013647 (1985)","journal-title":"Commun. ACM"},{"key":"9326_CR23","unstructured":"Y. Gertner, S. Kannan, T. Malkin, O. Reingold, M. Viswanathan, The relationship between public key encryption and oblivious transfer, in FOCS, (2000), pp. 325\u2013335"},{"key":"9326_CR24","unstructured":"V. Goyal, C.-K. Lee, R. Ostrovsky, I. Visconti, Constructing non-malleable commitments: a black-box approach, in FOCS, (2012), pp. 51\u201360"},{"key":"9326_CR25","unstructured":"O. Goldreich, S. Micali, A. Wigderson, How to play any mental game or A completeness theorem for protocols with honest majority, in STOC, (1987), pp. 218\u2013229"},{"key":"9326_CR26","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography: Basic Tools","author":"O Goldreich","year":"2001","unstructured":"O. Goldreich, Foundations of Cryptography: Basic Tools. (Cambridge University Press, Cambridge, 2001)"},{"key":"9326_CR27","unstructured":"I. Haitner, Semi-honest to malicious oblivious transfer\u2014the black-box way, in TCC, (2008), pp. 412\u2013426"},{"issue":"2","key":"9326_CR28","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/100790537","volume":"40","author":"I Haitner","year":"2011","unstructured":"I. Haitner, Y. Ishai, E. Kushilevitz, Y. Lindell, E. Petrank, Black-box constructions of protocols for secure computation. SIAM J. Comput.\n                           40(2), 225\u2013266 (2011)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"9326_CR29","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/s00145-010-9092-8","volume":"25","author":"S Halevi","year":"2012","unstructured":"S. Halevi, Y.T. Kalai, Smooth projective hashing and two-message oblivious transfer. J. Cryptol., 25(1):158\u2013193 (2012)","journal-title":"J. Cryptol."},{"key":"9326_CR30","unstructured":"C. Hazay, A. Patra, One-sided adaptively secure two-party computation, in TCC, (2014), pp. 368\u2013393"},{"key":"9326_CR31","first-page":"488","volume":"2015","author":"C Hazay","year":"2015","unstructured":"C. Hazay, M. Venkitasubramaniam, On black-box complexity of universally composable security in the CRS model. IACR Cryptol. ePrint Arch., 2015, 488 (2015)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"9326_CR32","unstructured":"Y. Ishai, E. Kushilevitz, Y. Lindell, E. Petrank, Black-box constructions for secure computation, in STOC, (2006), pp. 99\u2013108"},{"key":"9326_CR33","unstructured":"Y. Ishai, M. Prabhakaran, A. Sahai, Founding cryptography on oblivious transfer\u2014efficiently, in CRYPTO, (2008), pp. 572\u2013591"},{"key":"9326_CR34","unstructured":"R. Impagliazzo, S. Rudich, Limits on the provable consequences of one-way permutations, in CRYPTO, (1988), pp. 8\u201326"},{"key":"9326_CR35","unstructured":"J. Kilian, Founding cryptography on oblivious transfer, in STOC, (1988), pp. 20\u201331"},{"issue":"4","key":"9326_CR36","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/s00145-007-0567-1","volume":"20","author":"YT Kalai","year":"2007","unstructured":"Y.T. Kalai, Y. Lindell, M. Prabhakaran, Concurrent composition of secure protocols in the timing model. J. Cryptol., 20(4), 431\u2013492 (2007)","journal-title":"J. Cryptol."},{"key":"9326_CR37","unstructured":"S. Kiyoshima, H. Lin, M. Venkitasubramaniam, A unified approach to constructing black-box UC protocols in trusted setup models, in TCC, (2017), pp. 776\u2013809"},{"key":"9326_CR38","unstructured":"J. Katz, R. Ostrovsky, Round-optimal secure two-party computation, in CRYPTO, (2004), pp. 335\u2013354"},{"key":"9326_CR39","unstructured":"Y. Lindell, General composition and universal composability in secure multi-party computation, in FOCS, (2003), pp. 394\u2013403"},{"key":"9326_CR40","unstructured":"Y. Lindell, Adaptively secure two-party computation with erasures, in CT-RSA, (2009), pp. 117\u2013132"},{"key":"9326_CR41","unstructured":"Y. Lindell, Highly-efficient universally-composable commitments based on the DDH assumption, in EUROCRYPT, (2011), pp. 446\u2013466"},{"key":"9326_CR42","unstructured":"H. Lin, R. Pass, Black-box constructions of composable protocols without set-up, in CRYPTO, (2012), pp. 461\u2013478"},{"key":"9326_CR43","unstructured":"H. Lin, R. Pass, M. Venkitasubramaniam, A unified framework for concurrent security: universal composability from stand-alone non-malleability, in STOC, (2009), pp. 179\u2013188"},{"key":"9326_CR44","unstructured":"H. Lin, R. Pass, M. Venkitasubramaniam, A unified framework for UC from only OT, in ASIACRYPT, (2012), pp. 699\u2013717"},{"key":"9326_CR45","unstructured":"Y. Lindell, H. Zarosim, Adaptive zero-knowledge proofs and adaptively secure oblivious transfer, in TCC, (2009), pp. 183\u2013201"},{"key":"9326_CR46","unstructured":"H.K. Maji, M. Prabhakaran, M. Rosulek, A zero-one law for cryptographic complexity with respect to computational UC security, in CRYPTO, (2010), pp. 595\u2013612"},{"key":"9326_CR47","unstructured":"S. Micali, P. Rogaway, Secure computation (abstract), in CRYPTO, (1991), pp. 392\u2013404"},{"key":"9326_CR48","unstructured":"C. Peikert, V. Vaikuntanathan, B. Waters, A framework for efficient and composable oblivious transfer, in CRYPTO, (2008), pp. 554\u2013571"},{"key":"9326_CR49","unstructured":"R. Pass, H. Wee, Black-box constructions of two-party protocols from one-way functions, in TCC, (2009), pp. 403\u2013418"},{"issue":"11","key":"9326_CR50","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"A. Shamir, How to share a secret. Commun. ACM, 22(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"9326_CR51","unstructured":"A.C.-C. Yao, How to generate and exchange secrets (extended abstract), in FCOS, (1986), pp. 162\u2013167"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-019-09326-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-019-09326-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-019-09326-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,6]],"date-time":"2020-05-06T23:06:38Z","timestamp":1588806398000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-019-09326-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,8]]},"references-count":51,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["9326"],"URL":"https:\/\/doi.org\/10.1007\/s00145-019-09326-y","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,5,8]]},"assertion":[{"value":"13 September 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 April 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 May 2019","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"}]}}