{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T16:20:03Z","timestamp":1764606003200,"version":"3.46.0"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032122865","type":"print"},{"value":"9783032122872","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T00:00:00Z","timestamp":1764633600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T00:00:00Z","timestamp":1764633600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-12287-2_6","type":"book-chapter","created":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T16:17:54Z","timestamp":1764605874000},"page":"152-181","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Information-Theoretic Broadcast-Optimal MPC"],"prefix":"10.1007","author":[{"given":"Michele","family":"Ciampi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivan","family":"Damg\u00e1rd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Divya","family":"Ravi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luisa","family":"Siniscalchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sophia","family":"Yakoubov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,12,2]]},"reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1007\/978-3-030-64378-2_20","volume-title":"Theory of Cryptography","author":"B Applebaum","year":"2020","unstructured":"Applebaum, B., Kachlon, E., Patra, A.: The resiliency of MPC with low interaction: the benefit of making errors (extended abstract). In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12551, pp. 562\u2013594. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64378-2_20"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Kachlon, E., Patra, A.: The round complexity of perfect MPC with active security and optimal resiliency. In: 61st Annual Symposium on Foundations of Computer Science, Durham, NC, USA, 16\u201319 November 2020, pp. 1277\u20131284. IEEE Computer Society Press (2020)","DOI":"10.1109\/FOCS46700.2020.00121"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Kachlon, E., Patra, A.: The round complexity of statistical MPC with optimal resiliency, pp. 1527\u20131536. ACM Press (2023)","DOI":"10.1145\/3564246.3585228"},{"key":"6_CR4","unstructured":"Asharov, G., Lindell, Y.: A full proof of the BGW protocol for perfectly-secure multiparty computation. Cryptology ePrint Archive, Report 2011\/136 (2011)"},{"issue":"1","key":"6_CR5","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R Canetti","year":"2000","unstructured":"Canetti, R.: Security and composition of multiparty cryptographic protocols. J. Cryptol. 13(1), 143\u2013202 (2000)","journal-title":"J. Cryptol."},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Ciampi, M., Damg\u00e5rd, I., Ravi, D., Siniscalchi, L., Xia, Y., Yakoubov, S.: Broadcast-optimal four-round MPC in the plain model. In: TCC\u00a02023: 21st Theory of Cryptography Conference, Part\u00a0II. Lecture Notes in Computer Science, pp. 3\u201332 (2023)","DOI":"10.1007\/978-3-031-48618-0_1"},{"key":"6_CR7","unstructured":"Ciampi, M., Damg\u00e5rd, I., Ravi, D., Siniscalchi, L., Yakoubov, S.: Information-theoretic broadcast-optimal MPC. Cryptology ePrint Archive, Paper 2025\/1710 (2025)"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"828","DOI":"10.1007\/978-3-030-45724-2_28","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"R Cohen","year":"2020","unstructured":"Cohen, R., Garay, J., Zikas, V.: Broadcast-optimal two-round MPC. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12106, pp. 828\u2013858. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_28"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-030-84245-1_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"I Damg\u00e5rd","year":"2021","unstructured":"Damg\u00e5rd, I., Magri, B., Ravi, D., Siniscalchi, L., Yakoubov, S.: Broadcast-optimal two round MPC with an honest majority. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12826, pp. 155\u2013184. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_6"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Ravi, D., Siniscalchi, L., Yakoubov, S.: Minimizing setup in broadcast-optimal two round MPC. Cryptology ePrint Archive, Paper 2022\/293 (2022). To appear in Eurocrypt2023","DOI":"10.1007\/978-3-031-30617-4_5"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Ravi, D., Siniscalchi, L., Yakoubov, S.: Broadcast-optimal two round MPC with asynchronous peer-to-peer channels. Lecture Notes in Computer Science, pp. 87\u2013106 (2023)","DOI":"10.1007\/978-3-031-44469-2_5"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-642-54242-8_4","volume-title":"Theory of Cryptography","author":"S Garg","year":"2014","unstructured":"Garg, S., Gentry, C., Halevi, S., Raykova, M.: Two-round secure MPC from indistinguishability obfuscation. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol. 8349, pp. 74\u201394. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54242-8_4"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Ishai, Y., Kushilevitz, E., Rabin, T.: The round complexity of verifiable secret sharing and secure multicast. In: 33rd Annual ACM Symposium on Theory of Computing, Crete, Greece, 6\u20138 July 2001, pp. 580\u2013589. ACM Press (2001)","DOI":"10.1145\/380752.380853"},{"key":"6_CR14","unstructured":"Goldreich, O.: Foundations of Cryptography: Basic Applications, vol. 2. Cambridge University Press, Cambridge (2004)"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-642-22792-9_8","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"S Halevi","year":"2011","unstructured":"Halevi, S., Lindell, Y., Pinkas, B.: Secure computation on the web: computing without simultaneous interaction. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 132\u2013150. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_8"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/978-3-642-17373-8_25","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"R Kumaresan","year":"2010","unstructured":"Kumaresan, R., Patra, A., Rangan, C.P.: The round complexity of verifiable secret sharing: the statistical case. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 431\u2013447. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17373-8_25"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/978-3-642-03356-8_29","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"A Patra","year":"2009","unstructured":"Patra, A., Choudhary, A., Rabin, T., Rangan, C.P.: The round complexity of verifiable secret sharing revisited. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 487\u2013504. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03356-8_29"}],"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-032-12287-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T16:17:56Z","timestamp":1764605876000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-12287-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,2]]},"ISBN":["9783032122865","9783032122872"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-12287-2_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,2]]},"assertion":[{"value":"2 December 2025","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":"Aarhus","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}