{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T13:01:15Z","timestamp":1784638875639,"version":"3.55.0"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032325594","type":"print"},{"value":"9783032325600","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T00:00:00Z","timestamp":1784678400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T00:00:00Z","timestamp":1784678400000},"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":[[2027]]},"DOI":"10.1007\/978-3-032-32560-0_13","type":"book-chapter","created":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T12:04:56Z","timestamp":1784635496000},"page":"351-381","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Cost of\u00a0Fluidity: Communication Complexity Trade-Offs in\u00a0Fluid MPC"],"prefix":"10.1007","author":[{"given":"Shancheng","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zongyang","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bernardo","family":"Magri","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,22]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","unstructured":"Bienstock, A., Escudero, D., Polychroniadou, A.: On linear communication complexity for (maximally) fluid MPC. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02023, Part\u00a0I. Lecture Notes in Computer Science, vol. 14081, pp. 263\u2013294. Springer, Cham, Switzerland, Santa Barbara, CA, USA (Aug\u00a020\u201324, 2023). https:\/\/doi.org\/10.1007\/978-3-031-38557-5_9","DOI":"10.1007\/978-3-031-38557-5_9"},{"key":"13_CR2","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). https:\/\/doi.org\/10.62056\/aesg89n4e","DOI":"10.62056\/aesg89n4e"},{"key":"13_CR3","doi-asserted-by":"publisher","unstructured":"Blakley, G.R., Meadows, C.: Security of ramp schemes. In: Blakley, G.R., Chaum, D. (eds.) Advances in Cryptology \u2013 CRYPTO\u201984. Lecture Notes in Computer Science, vol.\u00a0196, pp. 242\u2013268. Springer Berlin Heidelberg, Germany, Santa Barbara, CA, USA (Aug\u00a019\u201323, 1984). https:\/\/doi.org\/10.1007\/3-540-39568-7_20","DOI":"10.1007\/3-540-39568-7_20"},{"key":"13_CR4","doi-asserted-by":"publisher","unstructured":"Campanelli, M., David, B., Khoshakhlagh, H., Konring, A., Nielsen, J.B.: Encryption to the future - a paradigm for sending secret messages to future (anonymous) committees. In: Agrawal, S., Lin, D. (eds.) Advances in Cryptology \u2013 ASIACRYPT\u00a02022, Part\u00a0III. Lecture Notes in Computer Science, vol. 13793, pp. 151\u2013180. Springer, Cham, Switzerland, Taipei, Taiwan (Dec\u00a05\u20139, 2022). https:\/\/doi.org\/10.1007\/978-3-031-22969-5_6","DOI":"10.1007\/978-3-031-22969-5_6"},{"key":"13_CR5","doi-asserted-by":"publisher","unstructured":"Cascudo, I., David, B., Garms, L., Konring, A.: YOLO YOSO: fast and simple encryption and secret sharing in the YOSO model. In: Agrawal, S., Lin, D. (eds.) Advances in Cryptology \u2013 ASIACRYPT\u00a02022, Part\u00a0I. Lecture Notes in Computer Science, vol. 13791, pp. 651\u2013680. Springer, Cham, Switzerland, Taipei, Taiwan (Dec\u00a05\u20139, 2022). https:\/\/doi.org\/10.1007\/978-3-031-22963-3_22","DOI":"10.1007\/978-3-031-22963-3_22"},{"key":"13_CR6","doi-asserted-by":"publisher","unstructured":"Chida, K., et al.: Fast large-scale honest-majority MPC for malicious adversaries. In: Shacham, H., Boldyreva, A. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02018, Part\u00a0III. Lecture Notes in Computer Science, vol. 10993, pp. 34\u201364. Springer, Cham, Switzerland, Santa Barbara, CA, USA (Aug\u00a019\u201323, 2018). https:\/\/doi.org\/10.1007\/978-3-319-96878-0_2","DOI":"10.1007\/978-3-319-96878-0_2"},{"key":"13_CR7","doi-asserted-by":"publisher","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.) Advances in Cryptology \u2013 CRYPTO\u00a02021, Part\u00a0II. Lecture Notes in Computer Science, vol. 12826, pp. 94\u2013123. Springer, Cham, Switzerland, Virtual Event (Aug\u00a016\u201320, 2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_4","DOI":"10.1007\/978-3-030-84245-1_4"},{"key":"13_CR8","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd, I., Nielsen, J.B.: Scalable and unconditionally secure multiparty computation. In: Menezes, A. (ed.) Advances in Cryptology \u2013 CRYPTO\u00a02007. Lecture Notes in Computer Science, vol.\u00a04622, pp. 572\u2013590. Springer Berlin Heidelberg, Germany, Santa Barbara, CA, USA (Aug\u00a019\u201323, 2007). https:\/\/doi.org\/10.1007\/978-3-540-74143-5_32","DOI":"10.1007\/978-3-540-74143-5_32"},{"key":"13_CR9","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd, I., Pastro, V., Smart, N.P., Zakarias, S.: Multiparty computation from somewhat homomorphic encryption. In: Safavi-Naini, R., Canetti, R. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02012. Lecture Notes in Computer Science, vol.\u00a07417, pp. 643\u2013662. Springer Berlin Heidelberg, Germany, Santa Barbara, CA, USA (Aug\u00a019\u201323, 2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_38","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"13_CR10","doi-asserted-by":"publisher","unstructured":"David, B., et al.: Perfect MPC over layered graphs. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02023, Part\u00a0I. Lecture Notes in Computer Science, vol. 14081, pp. 360\u2013392. Springer, Cham, Switzerland, Santa Barbara, CA, USA (Aug\u00a020\u201324, 2023). https:\/\/doi.org\/10.1007\/978-3-031-38557-5_12","DOI":"10.1007\/978-3-031-38557-5_12"},{"key":"13_CR11","doi-asserted-by":"publisher","unstructured":"David, B., Mondal, A., Satish, R.: Rumors MPC: GOD for dynamic committees, low communication via constant-round chat. In: Hanaoka, G., Yang, B. (eds.) Advances in Cryptology - ASIACRYPT 2025 - 31st International Conference on the Theory and Application of Cryptology and Information Security, Melbourne, VIC, Australia, December 8-12, 2025, Proceedings, Part V. Lecture Notes in Computer Science, vol. 16249, pp. 102\u2013132. Springer (2025). https:\/\/doi.org\/10.1007\/978-981-95-5116-3_4","DOI":"10.1007\/978-981-95-5116-3_4"},{"key":"13_CR12","doi-asserted-by":"publisher","unstructured":"Deligios, G., Konring, A., Liu-Zhang, C., Narayanan, V.: Statistical layered MPC. In: Boyle, E., Mahmoody, M. (eds.) Theory of Cryptography - 22nd International Conference, TCC 2024, Milan, Italy, December 2\u20136, 2024, Proceedings, Part IV, pp. 362\u2013394. Lecture Notes in Computer Science, Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-78023-3_12","DOI":"10.1007\/978-3-031-78023-3_12"},{"key":"13_CR13","first-page":"2078","volume":"2025","author":"G Dettling","year":"2025","unstructured":"Dettling, G., Liu-Zhang, C., Masserova, E., Rambaud, M., Urban, A.: Broadcast for dynamic committees without trusted setup. IACR Cryptol. ePrint Arch. 2025, 2078 (2025)","journal-title":"IACR Cryptol. ePrint Arch."},{"issue":"1","key":"13_CR14","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1145\/2455.214112","volume":"32","author":"D Dolev","year":"1985","unstructured":"Dolev, D., Reischuk, R.: Bounds on information exchange for byzantine agreement. J. ACM 32(1), 191\u2013204 (1985). https:\/\/doi.org\/10.1145\/2455.214112","journal-title":"J. ACM"},{"key":"13_CR15","doi-asserted-by":"publisher","unstructured":"Escudero, D., Masserova, E., Polychroniadou, A.: Towards scalable YOSO MPC via packed secret-sharing. In: Hanaoka, G., Yang, B. (eds.) Advances in Cryptology - ASIACRYPT 2025 - 31st International Conference on the Theory and Application of Cryptology and Information Security, Melbourne, VIC, Australia, December 8-12, 2025, Proceedings, Part V, pp. 68\u2013101. Lecture Notes in Computer Science, Springer (2025). https:\/\/doi.org\/10.1007\/978-981-95-5116-3_3","DOI":"10.1007\/978-981-95-5116-3_3"},{"key":"13_CR16","doi-asserted-by":"publisher","unstructured":"Escudero, D., Tjuawinata, I., Xing, C.: On information-theoretic secure multiparty computation with local repairability. In: Tang, Q., Teague, V. (eds.) Public-Key Cryptography - PKC 2024 - 27th IACR International Conference on Practice and Theory of Public-Key Cryptography, Sydney, NSW, Australia, April 15-17, 2024, Proceedings, Part II. Lecture Notes in Computer Science, vol. 14602, pp. 205\u2013239. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-57722-2_7","DOI":"10.1007\/978-3-031-57722-2_7"},{"key":"13_CR17","doi-asserted-by":"publisher","unstructured":"Gama, M., Beni, E.H., Orsini, E., Smart, N.P., Zajonc, O.: MPC with delayed parties over star-like networks. In: Guo, J., Steinfeld, R. (eds.) Advances in Cryptology \u2013 ASIACRYPT\u00a02023, Part\u00a0I. Lecture Notes in Computer Science, vol. 14438, pp. 172\u2013203. Springer, Singapore, Singapore, Guangzhou, China (Dec\u00a04\u20138, 2023). https:\/\/doi.org\/10.1007\/978-981-99-8721-4_6","DOI":"10.1007\/978-981-99-8721-4_6"},{"key":"13_CR18","doi-asserted-by":"publisher","unstructured":"Gennaro, R., Rabin, M.O., Rabin, T.: Simplified VSS and fast-track multiparty computations with applications to threshold cryptography. In: Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, pp. 101\u2013111. PODC \u201998, Association for Computing Machinery, New York, NY, USA (1998). https:\/\/doi.org\/10.1145\/277697.277716","DOI":"10.1145\/277697.277716"},{"key":"13_CR19","doi-asserted-by":"publisher","unstructured":"Gentry, C., et al.: YOSO: You only speak once - secure MPC with stateless ephemeral roles. In: Malkin, T., Peikert, C. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02021, Part\u00a0II. Lecture Notes in Computer Science, vol. 12826, pp. 64\u201393. Springer, Cham, Switzerland, Virtual Event (Aug\u00a016\u201320, 2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_3","DOI":"10.1007\/978-3-030-84245-1_3"},{"key":"13_CR20","doi-asserted-by":"publisher","unstructured":"Goyal, V., Li, H., Ostrovsky, R., Polychroniadou, A., Song, Y.: ATLAS: efficient and scalable MPC in the honest majority setting. In: Malkin, T., Peikert, C. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02021, Part\u00a0II. Lecture Notes in Computer Science, vol. 12826, pp. 244\u2013274. Springer, Cham, Switzerland, Virtual Event (Aug\u00a016\u201320, 2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_9","DOI":"10.1007\/978-3-030-84245-1_9"},{"key":"13_CR21","doi-asserted-by":"publisher","unstructured":"Goyal, V., Song, Y., Zhu, C.: Guaranteed output delivery comes free in honest majority MPC. In: Micciancio, D., Ristenpart, T. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02020, Part\u00a0II. Lecture Notes in Computer Science, vol. 12171, pp. 618\u2013646. Springer, Cham, Switzerland, Santa Barbara, CA, USA (Aug\u00a017\u201321, 2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_22","DOI":"10.1007\/978-3-030-56880-1_22"},{"key":"13_CR22","doi-asserted-by":"publisher","unstructured":"Mohassel, P., Rindal, P.: ABY$$^3$$: A mixed protocol framework for machine learning. In: Lie, D., Mannan, M., Backes, M., Wang, X. (eds.) ACM CCS 2018: 25th Conference on Computer and Communications Security, pp. 35\u201352. ACM Press, Toronto, ON, Canada (Oct\u00a015\u201319, 2018). https:\/\/doi.org\/10.1145\/3243734.3243760","DOI":"10.1145\/3243734.3243760"},{"key":"13_CR23","doi-asserted-by":"publisher","unstructured":"Nordholt, P.S., Veeningen, M.: Minimising communication in honest-majority MPC by batchwise multiplication verification. In: Preneel, B., Vercauteren, F. (eds.) ACNS 2018: 16th International Conference on Applied Cryptography and Network Security. Lecture Notes in Computer Science, vol. 10892, pp. 321\u2013339. Springer, Cham, Switzerland, Leuven, Belgium (Jul\u00a02\u20134, 2018). https:\/\/doi.org\/10.1007\/978-3-319-93387-0_17","DOI":"10.1007\/978-3-319-93387-0_17"},{"key":"13_CR24","doi-asserted-by":"publisher","unstructured":"Rachuri, R., Scholl, P.: Le mans: dynamic and fluid MPC for dishonest majority. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02022, Part\u00a0I. Lecture Notes in Computer Science, vol. 13507, pp. 719\u2013749. Springer, Cham, Switzerland, Santa Barbara, CA, USA (Aug\u00a015\u201318, 2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_25","DOI":"10.1007\/978-3-031-15802-5_25"},{"issue":"11","key":"13_CR25","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979). https:\/\/doi.org\/10.1145\/359168.359176","journal-title":"Commun. ACM"},{"key":"13_CR26","doi-asserted-by":"publisher","unstructured":"Varga, A.: OMNeT++, pp. 35\u201359. Springer Berlin Heidelberg, Berlin, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12331-3_3","DOI":"10.1007\/978-3-642-12331-3_3"},{"key":"13_CR27","doi-asserted-by":"publisher","unstructured":"Yao, A.C.: How to generate and exchange secrets (extended abstract). In: 27th Annual Symposium on Foundations of Computer Science, pp. 162\u2013167. IEEE Computer Society, Los Alamitos, CA, USA (1986). https:\/\/doi.org\/10.1109\/SFCS.1986.25","DOI":"10.1109\/SFCS.1986.25"},{"key":"13_CR28","unstructured":"Zeng, Y., Yang, K., Feng, D., Zhang, M.: Ion: Concretely efficient submaximal-fluid MPC with linear communication. IACR Cryptol. ePrint Arch. 2025, 1508 (2025). https:\/\/eprint.iacr.org\/2025\/1508"},{"key":"13_CR29","unstructured":"Zhang, S., Zhang, Z., Magri, B.: The cost of fluidity: Communication complexity trade-offs in fluid MPC. Cryptology ePrint Archive, Paper 2026\/725 (2026). https:\/\/eprint.iacr.org\/2026\/725"}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-32560-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T12:04:58Z","timestamp":1784635498000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-32560-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,22]]},"ISBN":["9783032325594","9783032325600"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-32560-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,22]]},"assertion":[{"value":"22 July 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACNS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applied Cryptography and Network Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Stony Brook, WI","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":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acns2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/acns2026.github.io\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}