{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T02:47:22Z","timestamp":1760150842425,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031159848"},{"type":"electronic","value":"9783031159855"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-15985-5_16","type":"book-chapter","created":{"date-parts":[[2022,10,10]],"date-time":"2022-10-10T20:02:37Z","timestamp":1665432157000},"page":"453-482","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Quadratic Multiparty Randomized Encodings Beyond Honest Majority and\u00a0Their Applications"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4792-369X","authenticated-orcid":false,"given":"Benny","family":"Applebaum","sequence":"first","affiliation":[]},{"given":"Yuval","family":"Ishai","sequence":"additional","affiliation":[]},{"given":"Or","family":"Karni","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8036-4407","authenticated-orcid":false,"given":"Arpita","family":"Patra","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,11]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.tcs.2021.08.035","volume":"891","author":"B Alon","year":"2021","unstructured":"Alon, B., Paskin-Cherniavsky, A.: On perfectly secure 2PC in the OT-hybrid model. Theor. Comput. Sci. 891, 166\u2013188 (2021)","journal-title":"Theor. Comput. Sci."},{"key":"16_CR2","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: Cryptography in NC$$^0$$. In: 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 166\u2013175 (2004)"},{"key":"16_CR3","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. LIPIcs, vol. 151, pp. 71:1\u201371:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"issue":"1","key":"16_CR4","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1137\/19M1272044","volume":"50","author":"B Applebaum","year":"2021","unstructured":"Applebaum, B., Brakerski, Z., Tsabary, R.: Perfect secure computation in two rounds. SIAM J. Comput. 50(1), 68\u201397 (2021)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"16_CR5","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1137\/S0097539700375944","volume":"33","author":"L Babai","year":"2003","unstructured":"Babai, L., G\u00e1l, A., Kimmel, P.G., Lokam, S.V.: Communication complexity of simultaneous messages. SIAM J. Comput. 33(1), 137\u2013166 (2003)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"16_CR6","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1007\/s00145-010-9056-z","volume":"23","author":"O Barkol","year":"2010","unstructured":"Barkol, O., Ishai, Y., Weinreb, E.: On d-multiplicative secret sharing. J. Cryptol. 23(4), 580\u2013593 (2010)","journal-title":"J. Cryptol."},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/3-540-44750-4_8","volume-title":"Advances in Cryptology \u2014 CRYPT0\u2019 95","author":"D Beaver","year":"1995","unstructured":"Beaver, D.: Precomputing oblivious transfer. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 97\u2013109. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-44750-4_8"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols (extended abstract). In: Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, Baltimore, Maryland, USA, 13\u201317 May 1990, pp. 503\u2013513 (1990)","DOI":"10.1145\/100216.100287"},{"issue":"2","key":"16_CR9","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.jcss.2005.03.002","volume":"71","author":"A Beimel","year":"2005","unstructured":"Beimel, A., Ishai, Y., Kushilevitz, E.: General constructions for information-theoretic private information retrieval. J. Comput. Syst. Sci. 71(2), 213\u2013247 (2005)","journal-title":"J. Comput. Syst. Sci."},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/978-3-319-78375-8_17","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"F Benhamouda","year":"2018","unstructured":"Benhamouda, F., Lin, H.: k-round multiparty computation from k-round oblivious transfer via garbled interactive circuits. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10821, pp. 500\u2013532. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_17"},{"key":"16_CR12","unstructured":"Boyle, E., Gilboa, N., Ishai, Y., Lin, H., Tessaro, S.: Foundations of homomorphic secret sharing. In: ITCS 2018, vol. 94, pp. 21:1\u201321:21 (2018)"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/3-540-69053-0_21","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201997","author":"C Cr\u00e9peau","year":"1997","unstructured":"Cr\u00e9peau, C.: Efficient cryptographic protocols based on noisy channels. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 306\u2013317. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-69053-0_21"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Cr\u00e9peau, C., Kilian, J.: Achieving oblivious transfer using weakened security assumptions (extended abstract). In: 29th Annual Symposium on Foundations of Computer Science, White Plains, New York, USA, 24\u201326 October 1988, pp. 42\u201352. IEEE Computer Society (1988)","DOI":"10.1109\/SFCS.1988.21920"},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/11535218_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"I Damg\u00e5rd","year":"2005","unstructured":"Damg\u00e5rd, I., Ishai, Y.: Constant-round multiparty computation using a black-box pseudorandom generator. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 378\u2013394. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11535218_23"},{"key":"16_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-642-19571-6_11","volume-title":"Theory of Cryptography","author":"N D\u00f6ttling","year":"2011","unstructured":"D\u00f6ttling, N., Kraschewski, D., M\u00fcller-Quade, J.: Unconditional and composable security using a single stateful tamper-proof hardware token. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 164\u2013181. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19571-6_11"},{"key":"16_CR17","unstructured":"Dubovitskaya, M., Scafuro, A., Visconti, I.: On efficient non-interactive oblivious transfer with tamper-proof hardware. IACR Cryptol. ePrint Arch., p. 509 (2010), http:\/\/eprint.iacr.org\/2010\/509"},{"issue":"6","key":"16_CR18","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S Even","year":"1985","unstructured":"Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. Commun. ACM 28(6), 637\u2013647 (1985)","journal-title":"Commun. ACM"},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Garg, S., Ishai, Y., Srinivasan, A.: Two-round MPC: information-theoretic and black-box. In: TCC 2018, pp. 123\u2013151 (2018)","DOI":"10.1007\/978-3-030-03807-6_5"},{"key":"16_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1007\/978-3-319-78375-8_16","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"S Garg","year":"2018","unstructured":"Garg, S., Srinivasan, A.: Two-round multiparty secure computation from minimal assumptions. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10821, pp. 468\u2013499. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_16"},{"key":"16_CR21","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: Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali, pp. 307\u2013328 (2019)","DOI":"10.1145\/3335741.3335759"},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E.: Randomizing polynomials: a new representation with applications to round-efficient secure computation. In: Proceedings 41st Annual Symposium on Foundations of Computer Science, pp. 294\u2013304 (2000)","DOI":"10.1109\/SFCS.2000.892118"},{"key":"16_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1007\/978-3-642-36594-2_34","volume-title":"Theory of Cryptography","author":"Y Ishai","year":"2013","unstructured":"Ishai, Y., Kushilevitz, E., Meldgaard, S., Orlandi, C., Paskin-Cherniavsky, A.: On the power of correlated randomness in secure computation. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 600\u2013620. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36594-2_34"},{"key":"16_CR24","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Zero-knowledge from secure multiparty computation. In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, 11\u201313 June 2007, pp. 21\u201330 (2007)","DOI":"10.1145\/1250790.1250794"},{"key":"16_CR25","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":"Yuval Ishai","year":"2008","unstructured":"Ishai, Yuval, Prabhakaran, Manoj, Sahai, Amit: Founding cryptography on oblivious transfer \u2013 efficiently. In: Wagner, David (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 572\u2013591. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_32"},{"key":"16_CR26","doi-asserted-by":"crossref","unstructured":"Kilian, J.: Founding cryptography on oblivious transfer. In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing, Chicago, Illinois, USA, 2\u20134 May 1988, pp. 20\u201331. ACM (1988)","DOI":"10.1145\/62212.62215"},{"key":"16_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-642-11799-2_20","volume-title":"Theory of Cryptography","author":"V Kolesnikov","year":"2010","unstructured":"Kolesnikov, V.: Truly efficient string oblivious transfer using resettable tamper-proof tokens. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol. 5978, pp. 327\u2013342. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11799-2_20"},{"key":"16_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-030-64378-2_18","volume-title":"Theory of Cryptography","author":"Huijia Lin","year":"2020","unstructured":"Lin, Huijia, Liu, Tianren, Wee, Hoeteck: Information-theoretic 2-round mpc without round collapsing: adaptive security, and more. In: Pass, Rafael, Pietrzak, Krzysztof (eds.) TCC 2020. LNCS, vol. 12551, pp. 502\u2013531. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64378-2_18"},{"key":"16_CR29","doi-asserted-by":"crossref","unstructured":"Nascimento, A.C.A., Winter, A.J.: On the oblivious transfer capacity of noisy correlations. In: Proceedings 2006 IEEE International Symposium on Information Theory, ISIT 2006, The Westin Seattle, Seattle, Washington, USA, 9\u201314 July 2006, pp. 1871\u20131875. IEEE (2006)","DOI":"10.1109\/ISIT.2006.261805"},{"key":"16_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-030-84245-1_7","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"Arpita Patra","year":"2021","unstructured":"Patra, Arpita, Srinivasan, Akshayaram: Three-round secure multiparty computation from black-box two-round oblivious transfer. In: Malkin, Tal, Peikert, Chris (eds.) CRYPTO 2021. LNCS, vol. 12826, pp. 185\u2013213. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_7"},{"key":"16_CR31","unstructured":"Rabin, M.O.: How to exchange secrets with oblivious transfer. Technical report TR-81, Aiken Computation Lab, Harvard University (1981)"},{"key":"16_CR32","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: How to generate and exchange secrets. In: 27th Annual Symposium on Foundations of Computer Science, pp. 162\u2013167 (1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15985-5_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T22:04:28Z","timestamp":1760133868000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15985-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031159848","9783031159855"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15985-5_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"11 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"42","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}