{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T17:04:37Z","timestamp":1710349477300},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,12,30]],"date-time":"2015-12-30T00:00:00Z","timestamp":1451433600000},"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":[[2017,1]]},"DOI":"10.1007\/s00145-015-9222-4","type":"journal-article","created":{"date-parts":[[2015,12,30]],"date-time":"2015-12-30T19:33:49Z","timestamp":1451504029000},"page":"321-371","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Efficient One-Sided Adaptively Secure Computation"],"prefix":"10.1007","volume":"30","author":[{"given":"Carmit","family":"Hazay","sequence":"first","affiliation":[]},{"given":"Arpita","family":"Patra","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,30]]},"reference":[{"key":"9222_CR1","unstructured":"R. Bendlin, I. Damg\u00e5rd, C. Orlandi, and S. Zakarias. Semi-homomorphic encryption and multiparty computation, in EUROCRYPT (2011), pp. 169\u2013188."},{"key":"9222_CR2","unstructured":"D. Beaver. Plug and play encryption, in CRYPTO (1997), pp. 75\u201389."},{"key":"9222_CR3","unstructured":"D. Beaver, and S. Haber. Cryptographic protocols provably secure against dynamic adversaries, in EUROCRYPT (1992), pp. 307\u2013323."},{"key":"9222_CR4","unstructured":"M. Bellare, D. Hofheinz, and S. Yilek. Possibility and impossibility results for encryption and commitment secure under selective opening, in EUROCRYPT (2009), pp. 1\u201335."},{"key":"9222_CR5","unstructured":"D. Beaver, S. Micali, and P. Rogaway. The round complexity of secure protocols (extended abstract), in STOC (1990), pp. 503\u2013513."},{"key":"9222_CR6","doi-asserted-by":"crossref","unstructured":"R. Canetti. Universally composable security: a new paradigm for cryptographic protocols, in FOCS (2001), pp. 136\u2013145.","DOI":"10.1109\/SFCS.2001.959888"},{"key":"9222_CR7","doi-asserted-by":"crossref","unstructured":"R. Canetti, I. Damg\u00e5rd, S. Dziembowski, Y. Ishai, and T. Malkin. Adaptive versus non-adaptive security of multi-party protocols. J. Cryptology, 17(3):153\u2013207, 2004.","DOI":"10.1007\/s00145-004-0135-x"},{"key":"9222_CR8","unstructured":"R. Cramer, I. Damg\u00e5rd, and B. Schoenmakers. Proofs of partial knowledge and simplified design of witness hiding protocols, in CRYPTO (1994), pp. 174\u2013187."},{"key":"9222_CR9","unstructured":"S.G. Choi, D. Dachman-Soled, T. Malkin, and H. Wee. Improved non-committing encryption with applications to adaptively secure protocols, in ASIACRYPT (2009), pp. 287\u2013302."},{"key":"9222_CR10","unstructured":"S.G. Choi, D. Dachman-Soled, T. Malkin, and H. Wee. Simple, black-box constructions of adaptively secure protocols, in TCC (2009), pp. 387\u2013402."},{"key":"9222_CR11","doi-asserted-by":"crossref","unstructured":"R. Canetti, and M. Fischlin. Universally composable commitments, in Proceedings of Advances in Cryptology\u2014CRYPTO 2001, 21st Annual International Cryptology Conference, Santa Barbara, California, USA (Aug. 19\u201323, 2001), pp. 19\u201340.","DOI":"10.1007\/3-540-44647-8_2"},{"key":"9222_CR12","unstructured":"R. Canetti, U. Feige, O. Goldreich, and M. Naor. Adaptively secure multi-party computation, in STOC (1996), pp. 639\u2013648."},{"key":"9222_CR13","unstructured":"R. Canetti, S. Goldwasser, and O. Poburinnaya. Adaptively secure two-party computation from indistinguishability obfuscation, in TCC (2015), pp. 557\u2013585."},{"key":"9222_CR14","unstructured":"R. Canetti, S. Halevi, and J. Katz. Adaptively-secure, non-interactive public-key encryption, in TCC (2005), pp. 150\u2013168."},{"key":"9222_CR15","doi-asserted-by":"crossref","unstructured":"R. Canetti, Y. Lindell, R. Ostrovsky, and A. Sahai. Universally composable two-party and multi-party secure computation, in STOC (2002).","DOI":"10.1145\/509907.509980"},{"key":"9222_CR16","unstructured":"R. Cramer, and V. Shoup. Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption, in EUROCRYPT (2002), pp. 45\u201364."},{"key":"9222_CR17","unstructured":"Y. Dodis, R. Gennaro, J. H\u00e5stad, H. Krawczyk, and T. Rabin. Randomness extraction and key derivation using the CBC, cascade and HMAC modes, in CRYPTO (2004), pp. 494\u2013510."},{"key":"9222_CR18","unstructured":"I. Damg\u00e5rd, and Y. Ishai. Constant-round multiparty computation using a black-box pseudorandom generator, in CRYPTO (2005), pp. 378\u2013394."},{"key":"9222_CR19","unstructured":"I. Damg\u00e5rd, and M. Jurik. A length-flexible threshold cryptosystem with applications, in ACISP (2003), pp. 350\u2013364."},{"key":"9222_CR20","doi-asserted-by":"crossref","unstructured":"I. Damg\u00e5rd, M. Jurik, and J.B. Nielsen. A generalization of Paillier\u2019s public-key system with applications to electronic voting. Int. J. Inf. Sec., 9(6):371\u2013385, 2010.","DOI":"10.1007\/s10207-010-0119-9"},{"key":"9222_CR21","unstructured":"D. Dachman-Soled, J. Katz, and V. Rao. Adaptively secure, universally composable, multiparty computation in constant rounds, in TCC (2015), pp. 586\u2013613."},{"key":"9222_CR22","unstructured":"I. Damg\u00e5rd, and J.B. Nielsen. Improved non-committing encryption schemes based on a general complexity assumption, in CRYPTO (2000), pp. 432\u2013450."},{"key":"9222_CR23","unstructured":"I. Damg\u00e5rd, and J.B. Nielsen. Perfect hiding and perfect binding universally composable commitment schemes with constant expansion factor, in CRYPTO (2002), pp. 581\u2013596."},{"key":"9222_CR24","unstructured":"I. Damg\u00e5rd, and J.B. Nielsen. Universally composable efficient multiparty computation from threshold homomorphic encryption, in CRYPTO (2003), pp. 247\u2013264."},{"key":"9222_CR25","unstructured":"I. Damg\u00e5rd, V. Pastro, N.P. Smart, and S. Zakarias. Multiparty computation from somewhat homomorphic encryption, in CRYPTO (2012), pp. 643\u2013662."},{"key":"9222_CR26","doi-asserted-by":"crossref","unstructured":"O. Goldreich and A. Kahan. How to construct constant-round zero-knowledge proof systems for np. J. Cryptology, 9(3):167\u2013190, 1996.","DOI":"10.1007\/s001459900010"},{"key":"9222_CR27","unstructured":"O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game or a completeness theorem for protocols with honest majority, in STOC (1987), pp. 218\u2013229."},{"key":"9222_CR28","doi-asserted-by":"crossref","unstructured":"O. Goldreich. Foundations of Cryptography: Basic Tools. Cambridge University Press, 2001.","DOI":"10.1017\/CBO9780511546891"},{"key":"9222_CR29","unstructured":"S. Garg, and A. Polychroniadou. Two-round adaptively secure MPC from indistinguishability obfuscation, in TCC (2015), pp. 614\u2013637."},{"key":"9222_CR30","unstructured":"S. Garg, and A. Sahai. Adaptively secure multi-party computation with dishonest majority, in CRYPTO (2012), pp. 105\u2013123."},{"key":"9222_CR31","unstructured":"J.A. Garay, D. Wichs, and H.-S. Zhou. Somewhat non-committing encryption and efficient adaptively secure oblivious transfer, in CRYPTO (2009), pp. 505\u2013523."},{"key":"9222_CR32","doi-asserted-by":"crossref","unstructured":"J. H\u00e5stad, R. Impagliazzo, L.A. Levin, and M. Luby. A pseudorandom generator from any one-way function. SIAM J. Comput., 28(4):1364\u20131396, 1999.","DOI":"10.1137\/S0097539793244708"},{"key":"9222_CR33","unstructured":"B. Hemenway, R. Ostrovsky, and A. Rosen. Non-committing encryption from \n                    \n                      \n                    \n                    $$\\Phi $$\n                    \n                      \n                        \u03a6\n                      \n                    \n                  -hiding, in TCC (2015), pp. 591\u2013608."},{"key":"9222_CR34","unstructured":"C. Hazay, and A. Patra. One-sided adaptively secure two-party computation, in TCC (2014), pp. 368\u2013393."},{"key":"9222_CR35","unstructured":"Y. Ishai, M. Prabhakaran, and A. Sahai. Founding cryptography on oblivious transfer\u2014efficiently, in CRYPTO (2008), pp. 572\u2013591."},{"key":"9222_CR36","unstructured":"S. Jarecki, and A. Lysyanskaya. Adaptively secure threshold cryptography: Introducing concurrency, removing erasures, in EUROCRYPT (2000), pp. 221\u2013242."},{"key":"9222_CR37","unstructured":"J. Katz, and R. Ostrovsky. Round-optimal secure two-party computation, in CRYPTO (2004), pp. 335\u2013354."},{"key":"9222_CR38","unstructured":"J. Katz, A. Thiruvengadam, and H.-S. Zhou. Feasibility and infeasibility of adaptively secure fully homomorphic encryption, in Public Key Cryptography (2013), pp. 14\u201331."},{"key":"9222_CR39","doi-asserted-by":"crossref","unstructured":"Y. Lindell. Adaptively secure two-party computation with erasures, in CT-RSA (2009), pp. 117\u2013132.","DOI":"10.1007\/978-3-642-00862-7_8"},{"issue":"2","key":"9222_CR40","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s00145-008-9036-8","volume":"22","author":"Y Lindell","year":"2009","unstructured":"Y.\u00a0Lindell and B.\u00a0Pinkas. A proof of security of Yao\u2019s protocol for two-party computation. Journal of Cryptology, 22(2):161\u2013188, 2009.","journal-title":"J. Cryptol."},{"key":"9222_CR41","doi-asserted-by":"crossref","unstructured":"Y. Lindell and B. Pinkas. Secure two-party computation via cut-and-choose oblivious transfer. J. Cryptology, 25(4):680\u2013722, 2012.","DOI":"10.1007\/s00145-011-9107-0"},{"key":"9222_CR42","doi-asserted-by":"crossref","unstructured":"Y. Lindell and B. Pinkas. An efficient protocol for secure two-party computation in the presence of malicious adversaries. J. Cryptology, 28(2):312\u2013350, 2015.","DOI":"10.1007\/s00145-014-9177-x"},{"key":"9222_CR43","doi-asserted-by":"crossref","unstructured":"J.B. Nielsen. Separating random oracle proofs from complexity theoretic proofs: the non-committing encryption case, in CRYPTO (2002), pp. 111\u2013126.","DOI":"10.1007\/3-540-45708-9_8"},{"key":"9222_CR44","unstructured":"J.B. Nielsen, P.S. Nordholt, C. Orlandi, and S.S. Burra. A new approach to practical active-secure two-party computation, in CRYPTO (2012), pp. 681\u2013700."},{"key":"9222_CR45","unstructured":"M. Naor, and O. Reingold. Synthesizers and their application to the parallel construction of psuedo-random functions, in FOCS (1995), pp. 170\u2013181."},{"key":"9222_CR46","doi-asserted-by":"crossref","unstructured":"P. Paillier. Public-key cryptosystems based on composite degree residuosity classes, in EUROCRYPT (1999), pp. 223\u2013238.","DOI":"10.1007\/3-540-48910-X_16"},{"key":"9222_CR47","unstructured":"C. Peikert, V. Vaikuntanathan, and B. Waters. A framework for efficient and composable oblivious transfer, in CRYPTO (2008), pp. 554\u2013571."},{"key":"9222_CR48","doi-asserted-by":"crossref","unstructured":"C.-P. Schnorr. Efficient identification and signatures for smart cards, in CRYPTO (1989), pp. 239\u2013252.","DOI":"10.1007\/0-387-34805-0_22"},{"key":"9222_CR49","doi-asserted-by":"crossref","unstructured":"M.N. Wegman J.L. Carter. Universal classes of hash functions. Journal of Computer and System Sciences, 18(2):143\u2013154, 1979.","DOI":"10.1016\/0022-0000(79)90044-8"},{"key":"9222_CR50","unstructured":"S. Wolf, and J. Wullschleger. Oblivious transfer is symmetric, in EUROCRYPT (2006), pp. 222\u2013232."},{"key":"9222_CR51","doi-asserted-by":"crossref","unstructured":"A.C. Yao. Protocols for secure computations (extended abstract), in FOCS (1982), pp. 160\u2013164.","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-015-9222-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-015-9222-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-015-9222-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-015-9222-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T08:13:45Z","timestamp":1586333625000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-015-9222-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,30]]},"references-count":51,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["9222"],"URL":"https:\/\/doi.org\/10.1007\/s00145-015-9222-4","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12,30]]},"assertion":[{"value":"14 April 2014","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 September 2015","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 December 2015","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"}]}}