{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T05:36:28Z","timestamp":1742967388320,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031780226"},{"type":"electronic","value":"9783031780233"}],"license":[{"start":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T00:00:00Z","timestamp":1733184000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T00:00:00Z","timestamp":1733184000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-78023-3_8","type":"book-chapter","created":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T10:50:53Z","timestamp":1733136653000},"page":"234-265","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Secure Computation with\u00a0Parallel Calls to\u00a02-Ary Functions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-6620-2754","authenticated-orcid":false,"given":"Varun","family":"Narayanan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shubham Vivek","family":"Pawar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2434-9912","authenticated-orcid":false,"given":"Akshayaram","family":"Srinivasan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,3]]},"reference":[{"key":"8_CR1","unstructured":"Applebaum, B., Brakerski, Z., Garg, S., Ishai, Y., Srinivasan, A.: Separating two-round secure computation from oblivious transfer. In: Thomas Vidick, editor, ITCS 2020, vol. 151, pp. 1\u201318, LIPIcs (2020)"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Brakerski, Z., Tsabary, R.: Perfect secure computation in two rounds. In: Beimel and Dziembowski, pp. 152\u2013174 (2021)","DOI":"10.1007\/978-3-030-03807-6_6"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Brakerski, Z., Tsabary, R.: Degree 2 is complete for the round-complexity of malicious MPC. In: Ishai and Rijmen, pp. 504\u2013531 (2019)","DOI":"10.1007\/978-3-030-17656-3_18"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Ananth, P., Choudhuri, A.R., Goel, A., Jain, A.: Round-optimal secure multiparty computation with honest majority. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. Part II, volume 10992 of LNCS, pp. 395\u2013424. Springer, Heidelberg (2018)","DOI":"10.1007\/978-3-319-96881-0_14"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Ananth, P., Choudhuri, A.R., Goel, A., Jain, A.: Two round information-theoretic MPC with malicious security. In: Ishai and Rijmen, pp. 532\u2013561 (2019)","DOI":"10.1007\/978-3-030-17656-3_19"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Goel, A.: On actively-secure elementary MPC reductions. In: Nissim, K., Waters, B. (eds.) TCC 2021. Part I, volume 13042 of LNCS, pp. 717\u2013749. Springer, Heidelberg (2021)","DOI":"10.1007\/978-3-030-90459-3_24"},{"key":"8_CR7","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: Cryptography in NC$$^0$$. In: 45th FOCS, pp. 166\u2013175. IEEE Computer Society Press (2004)"},{"key":"8_CR8","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-540-74143-5_6","volume-title":"CRYPTO 2007","author":"B Applebaum","year":"2007","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: Cryptography with constant input locality. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 92\u2013110. Springer, Heidelberg (2007)"},{"key":"8_CR9","unstructured":"Beimel, A., Dziembowski, S. (eds.): TCC 2018, Part I. LNCS, vol. 11239. Springer, Heidelberg (2018)"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Benhamouda, F., Lin, H.: k-round multiparty computation from k-round oblivious transfer via garbled interactive circuits. In: Nielsen and Rijmen, pp. 500\u2013532 (2018)","DOI":"10.1007\/978-3-319-78375-8_17"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols (extended abstract). In: 22nd ACM STOC, pp. 503\u2013513. ACM Press (1990)","DOI":"10.1145\/100216.100287"},{"key":"8_CR12","series-title":"Part II, volume 12171 of LNCS","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1007\/978-3-030-56880-1_20","volume-title":"CRYPTO 2020","author":"C Baum","year":"2020","unstructured":"Baum, C., Orsini, E., Scholl, P., Soria-Vazquez, E.: Efficient constant-round MPC with identifiable abort and public verifiability. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. Part II, volume 12171 of LNCS, pp. 562\u2013592. Springer, Heidelberg (2020)"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: 42nd FOCS, pp. 136\u2013145. IEEE Computer Society Press (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Cleve, R.: Limits on the security of coin flips when half the processors are faulty (extended abstract). In: 18th ACM STOC, pp. 364\u2013369. ACM Press (1986)","DOI":"10.1145\/12130.12168"},{"key":"8_CR15","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/11535218_23","volume-title":"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)"},{"key":"8_CR16","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/3-540-44647-8_5","volume-title":"CRYPTO 2001","author":"M Fitzi","year":"2001","unstructured":"Fitzi, M., Garay, J.A., Maurer, U.M., Ostrovsky, R.: Minimal complete primitives for secure multi-party computation. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 80\u2013100. Springer, Heidelberg (2001)"},{"key":"8_CR17","unstructured":"27th FOCS.: IEEE Computer Society Press (1986)"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Garg, S., Ishai, Y., Srinivasan, A.: Two-round MPC: information-theoretic and black-box. In: Beimel and Dziembowski, pp. 123\u2013151 (2018)","DOI":"10.1007\/978-3-030-03807-6_5"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity and a methodology of cryptographic protocol design (extended abstract). In: FOCS 1986, pp. 174\u2013187 (2019)","DOI":"10.1109\/SFCS.1986.47"},{"key":"8_CR20","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: Alfred Aho, editor, 19th ACM STOC, pp. 218\u2013229. ACM Press (1987)","DOI":"10.1145\/28395.28420"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Garg, S., Srinivasan, A.: Garbled protocols and two-round MPC from bilinear maps. In: Chris Umans, editor, 58th FOCS, pp. 588\u2013599. IEEE Computer Society Press (2017)","DOI":"10.1109\/FOCS.2017.60"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"Garg, S., Srinivasan, A.: Two-round multiparty secure computation from minimal assumptions. In: Nielsen and Rijmen, pp. 468\u2013499 (2022)","DOI":"10.1007\/978-3-319-78375-8_16"},{"issue":"2","key":"8_CR23","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."},{"issue":"4","key":"8_CR24","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM J. Comput. 28(4), 1364\u20131396 (1999)","journal-title":"SIAM J. Comput."},{"key":"8_CR25","series-title":"Part I, volume 12170 of LNCS","doi-asserted-by":"publisher","first-page":"836","DOI":"10.1007\/978-3-030-56784-2_28","volume-title":"CRYPTO 2020","author":"S Hohenberger","year":"2020","unstructured":"Hohenberger, S., Koppula, V., Waters, B.: Chosen ciphertext security from injective trapdoor functions. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. Part I, volume 12170 of LNCS, pp. 836\u2013866. Springer, Heidelberg (2020)"},{"key":"8_CR26","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E.: Randomizing polynomials: a new representation with applications to round-efficient secure computation. In: 41st FOCS, pp. 294\u2013304. IEEE Computer Society Press (2000)","DOI":"10.1109\/SFCS.2000.892118"},{"key":"8_CR27","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/978-3-642-14623-7_31","volume-title":"CRYPTO 2010","author":"Y Ishai","year":"2010","unstructured":"Ishai, Y., Kushilevitz, E., Paskin, A.: Secure multiparty computation with minimal interaction. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 577\u2013594. Springer, Heidelberg (2010)"},{"key":"8_CR28","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Khurana, D., Sahai, A., Srinivasan, A.: Round-optimal black-box secure computation from two-round malicious OT. In: Kiltz, E., Vaikuntanathan, V. (eds.) Theory of Cryptography - 20th International Conference, TCC 2022, Chicago, IL, USA, 7-10 November, 2022, Proceedings, Part II, LNCS, vol. 13748, pp. 441\u2013469. Springer, cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22365-5_16","DOI":"10.1007\/978-3-031-22365-5_16"},{"key":"8_CR29","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Patra, A., Patranabis, S., Ravi, D., Srinivasan, A.: Fully-secure MPC with minimal trust. In: Kiltz, E., Vaikuntanathan, V. (eds.) Theory of Cryptography - 20th International Conference, TCC 2022, Chicago, IL, USA, 7-10 November 2022, Proceedings, Part II, LNCS, vol. 13748, pp. 470\u2013501. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22365-5_17","DOI":"10.1007\/978-3-031-22365-5_17"},{"key":"8_CR30","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/978-3-540-85174-5_32","volume-title":"CRYPTO 2008","author":"Y Ishai","year":"2008","unstructured":"Ishai, Y., Prabhakaran, M., Sahai, A.: Founding cryptography on oblivious transfer - efficiently. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 572\u2013591. Springer, Heidelberg (2008)"},{"key":"8_CR31","unstructured":"Ishai, Y., Rijmen, V. (eds.): EUROCRYPT 2019, Part II. LNCS, vol. 11477. Springer, Heidelberg (2019)"},{"key":"8_CR32","doi-asserted-by":"crossref","unstructured":"Kilian, J.: Founding cryptography on oblivious transfer. In: 20th ACM STOC, pp. 20\u201331. ACM Press (1988)","DOI":"10.1145\/62212.62215"},{"key":"8_CR33","unstructured":"Lamport, L.: Constructing digital signatures from a one way function (2016)"},{"key":"8_CR34","doi-asserted-by":"crossref","unstructured":"Narayanan, V., Pawar, S.V., Srinivasan, A.: Secure computation with parallel calls to 2-ary functions. Cryptology ePrint Archive (2024)","DOI":"10.1007\/978-3-031-78023-3_8"},{"key":"8_CR35","unstructured":"Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT\u00a02018, Part\u00a0II, LNCS, vol. 10821. Springer, Heidelberg (2018)"},{"key":"8_CR36","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: How to generate and exchange secrets (extended abstract). In: FOCS, pp. 162\u2013167 (1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-78023-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T14:09:40Z","timestamp":1733148580000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-78023-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,3]]},"ISBN":["9783031780226","9783031780233"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-78023-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,12,3]]},"assertion":[{"value":"3 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Theory of Cryptography Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Milan","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}