{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T23:12:28Z","timestamp":1778022748402,"version":"3.51.4"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032253231","type":"print"},{"value":"9783032253248","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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-25324-8_13","type":"book-chapter","created":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T22:40:35Z","timestamp":1778020835000},"page":"366-396","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["New Upper and\u00a0Lower Bounds for\u00a0Perfectly Secure MPC"],"prefix":"10.1007","author":[{"given":"Ivan","family":"Damg\u00e5rd","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shravani","family":"Patil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arpita","family":"Patra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lawrence","family":"Roy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,6]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., Asharov, G., Patil, S., Patra, A.: Detect, pack and batch: perfectly-secure MPC with linear communication and constant expected time. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 251\u2013281. Springer (2023)","DOI":"10.1007\/978-3-031-30617-4_9"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Abraham, I., Asharov, G., Patil, S., Patra, A.: Perfect asynchronous MPC with linear communication overhead. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 280\u2013309. Springer (2024)","DOI":"10.1007\/978-3-031-58740-5_10"},{"key":"13_CR3","unstructured":"Abraham, I., Asharov, G., Patra, A., Stern, G.: Perfectly secure asynchronous agreement on a core set in constant expected time. IACR Cryptol. ePrint Arch. 1130 (2023). https:\/\/eprint.iacr.org\/2023\/1130"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Kachlon, E., Patra, A.: The round complexity of perfect MPC with active security and optimal resiliency. In: Annual Symposium on Foundations of Computer Science (FOCS) (2020)","DOI":"10.1109\/FOCS46700.2020.00121"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Beerliov\u00e1-Trub\u00edniov\u00e1, Z., Hirt, M.: Perfectly-secure MPC with linear communication complexity. In: Proceedings of the 5th Conference on Theory of Cryptography, TCC 2008, pp. 213\u2013230. Springer, Heidelberg (2008)","DOI":"10.1007\/978-3-540-78524-8_13"},{"key":"13_CR6","unstructured":"Beerliov\u00e1-Trub\u00edniov\u00e1, Z., Hirt, M.: Perfectly-secure MPC with linear communication complexity. In: Theory of Cryptography Conference (2008)"},{"key":"13_CR7","unstructured":"Canetti, R.: Studies in secure multiparty computation and applications (1996). https:\/\/www.wisdom.weizmann.ac.il\/~oded\/PSX\/ran-phd.pdf"},{"key":"13_CR8","unstructured":"Canetti, R.: Studies in secure multiparty computation and applications. Ph.D. thesis, Citeseer (1996)"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Choudhury, A., Patra, A.: An efficient framework for unconditionally secure multiparty computation. IEEE Trans. Inf. Theory (2016)","DOI":"10.1109\/TIT.2016.2614685"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-3-642-13190-5_23","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"I Damg\u00e5rd","year":"2010","unstructured":"Damg\u00e5rd, I., Ishai, Y., Kr\u00f8igaard, M.: Perfectly secure multiparty computation and the computational overhead of cryptography. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 445\u2013465. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_23"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Nielsen, J.B.: Scalable and unconditionally secure multiparty computation. In: Annual International Cryptology Conference (2007)","DOI":"10.1007\/11818175_30"},{"key":"13_CR12","unstructured":"Damg\u00e5rd, I., Patil, S., Patra, A., Roy, L.: New upper and lower bounds for perfectly secure MPC. Cryptology ePrint Archive (2025)"},{"key":"13_CR13","unstructured":"Damg\u00e5rd, I.B., Li, B., Schwartzbach, N.I.: More communication lower bounds for information-theoretic MPC. In: 2nd Conference on Information-Theoretic Cryptography (ITC 2021). Schloss-Dagstuhl-Leibniz Zentrum f\u00fcr Informatik (2021)"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Escudero, D., Goyal, V., Polychroniadou, A., Song, Y.: Turbopack: honest majority MPC with constant online communication. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, pp. 951\u2013964 (2022)","DOI":"10.1145\/3548606.3560633"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Fitzi, M., Gottesman, D., Hirt, M., Holenstein, T., Smith, A.: Detectable byzantine agreement secure against faulty majorities. In: Proceedings of the Twenty-First Annual Symposium on Principles of Distributed Computing, pp. 118\u2013126 (2002)","DOI":"10.1145\/571825.571841"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Goyal, V., Liu, Y., Song, Y.: Communication-efficient unconditional MPC with guaranteed output delivery. In: Annual International Cryptology Conference, pp. 85\u2013114. Springer (2019)","DOI":"10.1007\/978-3-030-26951-7_4"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Goyal, V., Polychroniadou, A., Song, Y.: Unconditional communication-efficient MPC via hall\u2019s marriage theorem. In: Advances in Cryptology\u2013CRYPTO 2021: 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, 16\u201320 August 2021, Proceedings, Part II 41, pp. 275\u2013304. Springer (2021)","DOI":"10.1007\/978-3-030-84245-1_10"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Song, Y., Ye, X.: Perfectly-secure MPC with constant online communication complexity. Cryptology ePrint Archive (2024)","DOI":"10.1007\/978-3-031-78023-3_11"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-25324-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T22:40:41Z","timestamp":1778020841000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-25324-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032253231","9783032253248"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-25324-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"6 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","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":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 May 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}