{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T23:11:57Z","timestamp":1778022717950,"version":"3.51.4"},"publisher-location":"Cham","reference-count":24,"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_18","type":"book-chapter","created":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T22:33:20Z","timestamp":1778020400000},"page":"515-545","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["PUFF: Maximally Proactive Security for Free in\u00a0Perfectly Secure MPC with\u00a0Guaranteed Output Delivery"],"prefix":"10.1007","author":[{"given":"Jiarui","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mengzhen","family":"Zou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guidong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guoyan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chen","family":"Qian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,6]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Kachlon, E., Patra, A.: The round complexity of perfect MPC with active security and optimal resiliency. In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), pp. 1277\u20131284. IEEE (2020)","DOI":"10.1109\/FOCS46700.2020.00121"},{"issue":"1","key":"18_CR2","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/s00145-015-9214-4","volume":"30","author":"G Asharov","year":"2017","unstructured":"Asharov, G., Lindell, Y.: A full proof of the BGW protocol for perfectly secure multiparty computation. J. Cryptol. 30(1), 58\u2013151 (2017)","journal-title":"J. Cryptol."},{"key":"18_CR3","doi-asserted-by":"publisher","unstructured":"Bienstock, A., Escudero, D., Polychroniadou, A.: On linear communication complexity for (maximally) fluid MPC. In: Annual International Cryptology Conference, pp. 263\u2013294. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38557-5_9","DOI":"10.1007\/978-3-031-38557-5_9"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Bienstock, A., Escudero, D., Polychroniadou, A.: Perfectly secure fluid MPC with abort and linear communication complexity. IACR Commun. Cryptol. 1(4) (2025)","DOI":"10.62056\/aesg89n4e"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: 20th ACM STOC, pp. 1\u201310. ACM Press (1988)","DOI":"10.1145\/62212.62213"},{"key":"18_CR6","unstructured":"Berlekamp, E.R., Welzl, M.E.: Error correction of algebraic block codes. US Patent, (4,633,470) (1986)"},{"issue":"1","key":"18_CR7","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":"18_CR8","volume-title":"CRYPTO\u201987, volume 293 of LNCS, page 462","author":"D Chaum","year":"1988","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols (abstract) (informal contribution). In: Pomerance, C. (ed.) CRYPTO\u201987, volume 293 of LNCS, page 462. Springer, Berlin, Heidelberg (1988)"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-030-84245-1_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"AR Choudhuri","year":"2021","unstructured":"Choudhuri, A.R., Goel, A., Green, M., Jain, A., Kaptchuk, G.: Fluid MPC: secure multiparty computation with dynamic participants. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12826, pp. 94\u2013123. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_4"},{"key":"18_CR10","doi-asserted-by":"publisher","unstructured":"David, B., et al.: Perfect MPC over layered graphs. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023. Part I, volume 14081 of LNCS, pp. 360\u2013392. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38557-5_12","DOI":"10.1007\/978-3-031-38557-5_12"},{"issue":"1","key":"18_CR11","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/138027.138036","volume":"40","author":"D Dolev","year":"1993","unstructured":"Dolev, D., Dwork, C., Waarts, O., Yung, M.: Perfectly secure message transmission. J. ACM 40(1), 17\u201347 (1993)","journal-title":"J. ACM"},{"key":"18_CR12","doi-asserted-by":"publisher","unstructured":"Deligios, G., Konring, A., Liu-Zhang, C.-D., Narayanan, V.: Statistical layered MPC. In: TCC (4), volume 15367 of Lecture Notes in Computer Science, pp. 362\u2013394. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-78023-3_12","DOI":"10.1007\/978-3-031-78023-3_12"},{"key":"18_CR13","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/3-540-44598-6_5","volume-title":"CRYPTO 2000","author":"Y Dodis","year":"2000","unstructured":"Dodis, Y., Micali, S.: Parallel reducibility for information-theoretically secure computation. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 74\u201392. Springer, Berlin, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44598-6_5"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-030-84245-1_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"C Gentry","year":"2021","unstructured":"Gentry, C., Halevi, S., Krawczyk, H., Magri, B., Nielsen, J.B., Rabin, T., Yakoubov, S.: YOSO: you only speak once. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12826, pp. 64\u201393. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_3"},{"key":"18_CR15","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 ACM STOC, pp. 580\u2013589. ACM Press (2001)","DOI":"10.1145\/380752.380853"},{"key":"18_CR16","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: Aho, A., editor, 19th ACM STOC, pp. 218\u2013229. ACM Press (1987)","DOI":"10.1145\/28395.28420"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Ito, M., Saito, A., Nishizeki, T.: Secret sharing scheme realizing general access structure. Electr. Commun. Japan (Part III: Fund. Electr. Sci.) 72(9), 56\u201364 (1989)","DOI":"10.1002\/ecjc.4430720906"},{"key":"18_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/978-3-540-70583-3_41","volume-title":"Automata, Languages and Programming","author":"J Katz","year":"2008","unstructured":"Katz, J., Koo, C.-Y., Kumaresan, R.: Improving the round complexity of VSS in point-to-point networks. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008. LNCS, vol. 5126, pp. 499\u2013510. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70583-3_41"},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Lindell, Y., Rabin, T.: Information-theoretically secure protocols and security under composition. In: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, pp. 109\u2013118 (2006)","DOI":"10.1145\/1132516.1132532"},{"key":"18_CR20","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/3-540-46766-1_32","volume-title":"CRYPTO\u201991","author":"S Micali","year":"1992","unstructured":"Micali, S., Rogaway, P.: Secure computation (abstract). In: Feigenbaum, J. (ed.) CRYPTO\u201991. LNCS, vol. 576, pp. 392\u2013404. Springer, Berlin, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_32"},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Ostrovsky, R., Yung, M.: How to withstand mobile virus attacks. In: Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, pp. 51\u201359 (1991)","DOI":"10.1145\/112600.112605"},{"key":"18_CR22","series-title":"Part I, volume 13507 of LNCS","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1007\/978-3-031-15802-5_25","volume-title":"CRYPTO 2022","author":"R Rachuri","year":"2022","unstructured":"Rachuri, R., Scholl, P.: Le Mans: dynamic and fluid MPC for dishonest majority. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022. Part I, volume 13507 of LNCS, pp. 719\u2013749. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_25"},{"issue":"11","key":"18_CR23","first-page":"612","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. Assoc. Comput. Mach. 22(11), 612\u2013613 (1979)","journal-title":"Commun. Assoc. Comput. Mach."},{"key":"18_CR24","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: How to generate and exchange secrets (extended abstract). In: 27th FOCS, pp. 162\u2013167. IEEE Computer Society Press (1986)","DOI":"10.1109\/SFCS.1986.25"}],"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_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T22:33:30Z","timestamp":1778020410000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-25324-8_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032253231","9783032253248"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-25324-8_18","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"}}]}}