{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T13:10:54Z","timestamp":1765113054835,"version":"3.41.2"},"reference-count":24,"publisher":"International Association for Cryptologic Research","issue":"4","license":[{"start":{"date-parts":[[2024,10,8]],"date-time":"2024-10-08T00:00:00Z","timestamp":1728345600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IACR CiC"],"accepted":{"date-parts":[[2024,12,3]]},"abstract":"<jats:p>The Fluid multiparty computation (MPC) model, introduced in (Choudhuri et al. CRYPTO 2021), addresses dynamic scenarios where participants can join or leave computations between rounds. Communication complexity initially stood at <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n              <mml:mrow>\n                <mml:mi>\u03a9<\/mml:mi>\n                <mml:mo stretchy=\"false\">(<\/mml:mo>\n                <mml:msup>\n                  <mml:mi>n<\/mml:mi>\n                  <mml:mn>2<\/mml:mn>\n                <\/mml:msup>\n                <mml:mo stretchy=\"false\">)<\/mml:mo>\n              <\/mml:mrow>\n            <\/mml:math> elements per gate, where <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n              <mml:mrow>\n                <mml:mi>n<\/mml:mi>\n              <\/mml:mrow>\n            <\/mml:math> is the number of parties in a committee online at a time. This held for both statistical security (honest majority) and computational security (dishonest majority) in (Choudhuri et al.\u00a0CRYPTO'21) and (Rachuri and Scholl, CRYPTO'22), respectively. The work of (Bienstock et al.\u00a0CRYPTO'23) improved communication to <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n              <mml:mrow>\n                <mml:mi>O<\/mml:mi>\n                <mml:mo stretchy=\"false\">(<\/mml:mo>\n                <mml:mi>n<\/mml:mi>\n                <mml:mo stretchy=\"false\">)<\/mml:mo>\n              <\/mml:mrow>\n            <\/mml:math> elements per gate. However, it's important to note that the perfectly secure setting with one-third corruptions per committee has only recently been addressed in the work of (David et al.\u00a0CRYPTO'23). Notably, their contribution marked a significant advancement in the Fluid MPC literature by introducing guaranteed output delivery. However, this achievement comes at the cost of prohibitively expensive communication, which scales to <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n              <mml:mrow>\n                <mml:mi>\u03a9<\/mml:mi>\n                <mml:mo stretchy=\"false\">(<\/mml:mo>\n                <mml:msup>\n                  <mml:mi>n<\/mml:mi>\n                  <mml:mn>9<\/mml:mn>\n                <\/mml:msup>\n                <mml:mo stretchy=\"false\">)<\/mml:mo>\n              <\/mml:mrow>\n            <\/mml:math> elements per gate.<\/jats:p>\n          <jats:p>    In this work, we study the realm of perfectly secure Fluid MPC under one-third active corruptions. Our primary focus lies in proposing efficient protocols that embrace the concept of security with abort. Towards this, we design a protocol for perfectly secure Fluid MPC that requires only linear communication of <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n              <mml:mrow>\n                <mml:mi>O<\/mml:mi>\n                <mml:mo stretchy=\"false\">(<\/mml:mo>\n                <mml:mi>n<\/mml:mi>\n                <mml:mo stretchy=\"false\">)<\/mml:mo>\n              <\/mml:mrow>\n            <\/mml:math> elements per gate, matching the communication of the non-Fluid setting. Our results show that, as in the case of computational and statistical security, perfect security with abort for Fluid MPC comes \u201cfor free\u201d (asymptotically linear in <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n              <mml:mrow>\n                <mml:mi>n<\/mml:mi>\n              <\/mml:mrow>\n            <\/mml:math>) with respect to traditional non-Fluid MPC, marking a substantial leap forward in large scale dynamic computations, such as Fluid MPC. <\/jats:p>","DOI":"10.62056\/aesg89n4e","type":"journal-article","created":{"date-parts":[[2025,1,13]],"date-time":"2025-01-13T17:00:52Z","timestamp":1736787652000},"update-policy":"https:\/\/doi.org\/10.62056\/adfjwm02dj","source":"Crossref","is-referenced-by-count":1,"title":["Perfectly Secure Fluid MPC with Abort and Linear Communication Complexity"],"prefix":"10.62056","volume":"1","author":[{"given":"Alexander","family":"Bienstock","sequence":"first","affiliation":[{"name":"J.P. Morgan AI Research & J.P. Morgan AlgoCRYPT CoE","place":["New York, New York, USA"]}]},{"given":"Daniel","family":"Escudero","sequence":"additional","affiliation":[{"name":"J.P. Morgan AI Research & J.P. Morgan AlgoCRYPT CoE","place":["New York, New York, USA"]}]},{"given":"Antigoni","family":"Polychroniadou","sequence":"additional","affiliation":[{"name":"J.P. Morgan AI Research & J.P. Morgan AlgoCRYPT CoE","place":["New York, New York, USA"]}]}],"member":"48349","published-online":{"date-parts":[[2025,1,13]]},"reference":[{"key":"ref1:abraham2023detect","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-031-30617-4_9","article-title":"Detect, pack and batch: perfectly-secure mpc with linear\n  communication and constant expected time","author":"Ittai Abraham","year":"2023"},{"key":"ref2:wigderson1988completeness","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/62212.62213","article-title":"Completeness theorems for noncryptographic fault-tolerant\n  distributed computations","author":"Avi Wigderson","year":"1988"},{"volume-title":"Cryptology ePrint Archive","year":"2021","author":"Ivan Damg\u00e5rd","key":"ref3:damgaard2021phoenix"},{"key":"ref4:goyal2019communication","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-030-26951-7_4","article-title":"Communication-efficient unconditional MPC with guaranteed\n  output delivery","author":"Vipul Goyal","year":"2019"},{"key":"ref5:fluid-linear","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-031-38557-5_9","article-title":"On Linear Communication Complexity for (Maximally) Fluid\n  MPC","author":"Alexander Bienstock","year":"2023"},{"key":"ref6:bonawitz2017practical","doi-asserted-by":"publisher","first-page":"1175","DOI":"10.1145\/3133956.3133982","article-title":"Practical Secure Aggregation for Privacy-Preserving Machine\n  Learning","author":"Keith Bonawitz","year":"2017"},{"key":"ref7:cryptoeprint:2023\/486","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1109\/SP46215.2023.10179434","article-title":"Flamingo: Multi-Round Single-Server Secure Aggregation with\n  Applications to Private Federated Learning","author":"Yiping Ma","year":"2023"},{"key":"ref8:hirt2008hyper","isbn-type":"print","doi-asserted-by":"publisher","first-page":"213","DOI":"10.5555\/1802614.1802632","article-title":"Perfectly-Secure MPC with Linear Communication Complexity","author":"Zuzana Beerliov\u00e1-Trub\u00edniov\u00e1","year":"2008","ISBN":"https:\/\/id.crossref.org\/isbn\/9783540785248"},{"key":"ref9:gentry2021yoso","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-030-84245-1_3","article-title":"YOSO: you only speak once","author":"Craig Gentry","year":"2021"},{"key":"ref10:damgaard2007scalable","doi-asserted-by":"publisher","first-page":"572","DOI":"10.5555\/1777777.1777823","article-title":"Scalable and unconditionally secure multiparty computation","author":"Ivan Damg\u00e5rd","year":"2007"},{"key":"ref11:abraham2021efficient","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-030-90453-1_3","article-title":"Efficient perfectly secure computation with optimal\n  resilience","author":"Ittai Abraham","year":"2021"},{"key":"ref12:constant-overhead","isbn-type":"print","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-3-642-13190-5_23","article-title":"Perfectly Secure Multiparty Computation and the\n  Computational Overhead of Cryptography","author":"Ivan Damg\u00e5rd","year":"2010","ISBN":"https:\/\/id.crossref.org\/isbn\/9783642131905"},{"key":"ref13:DamgardPSZ12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/978-3-642-32009-5_38","article-title":"Multiparty Computation from Somewhat Homomorphic\n  Encryption","volume":"7417","author":"Ivan Damg\u00e5rd","year":"2012"},{"key":"ref14:GuoPS19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/978-3-030-26948-7_18","article-title":"Synchronous, with a Chance of Partition Tolerance","volume":"11692","author":"Yue Guo","year":"2019"},{"key":"ref15:badrinarayanan2020secure","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/978-3-030-64840-4_5","article-title":"Secure MPC: laziness leads to GOD","author":"Saikrishna Badrinarayanan","year":"2020"},{"key":"ref16:goyal2020guaranteed","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1007\/978-3-030-56880-1_22","article-title":"Guaranteed output delivery comes free in honest majority\n  MPC","author":"Vipul Goyal","year":"2020"},{"key":"ref17:david2023perfect","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/978-3-031-38557-5_12","article-title":"Perfect mpc over layered graphs","author":"Bernardo David","year":"2023"},{"key":"ref18:Canetti","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1145\/3402457","article-title":"Universally Composable Security: A New Paradigm for\n  Cryptographic Protocols","author":"Ran Canetti","year":"2001"},{"key":"ref19:bell2020secure","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1145\/3372297.3417885","article-title":"Secure single-server aggregation with (poly) logarithmic\n  overhead","author":"James Henry Bell","year":"2020"},{"key":"ref20:STOC:FraYun92","series-title":"STOC '92","isbn-type":"print","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1145\/129712.129780","article-title":"Communication complexity of secure computation (extended\n  abstract)","author":"Matthew Franklin","year":"1992","ISBN":"https:\/\/id.crossref.org\/isbn\/0897915119"},{"key":"ref21:fitzi1998trading","doi-asserted-by":"publisher","first-page":"121","DOI":"10.5555\/646763.706313","article-title":"Trading correctness for privacy in unconditional multi-party\n  computation","author":"Matthias Fitzi","year":"1998"},{"key":"ref22:choudhuri2021fluid","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-030-84245-1_4","article-title":"Fluid MPC: secure multiparty computation with dynamic\n  participants","author":"Arka Rai Choudhuri","year":"2021"},{"key":"ref23:beaver","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/3-540-46766-1_34","article-title":"Efficient Multiparty Protocols Using Circuit Randomization","volume":"576","author":"Donald Beaver","year":"1992"},{"key":"ref24:rachuri2021mans","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-15802-5_25","article-title":"Le Mans: Dynamic and Fluid MPC for Dishonest Majority","author":"Rahul Rachuri","year":"2022"}],"container-title":["IACR Communications in Cryptology"],"original-title":[],"language":"en","deposited":{"date-parts":[[2025,1,13]],"date-time":"2025-01-13T17:12:12Z","timestamp":1736788332000},"score":1,"resource":{"primary":{"URL":"https:\/\/cic.iacr.org\/p\/1\/4\/28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,13]]},"references-count":24,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2025,1,13]]}},"URL":"https:\/\/doi.org\/10.62056\/aesg89n4e","archive":["Internet Archive","Internet Archive"],"relation":{},"ISSN":["3006-5496"],"issn-type":[{"type":"electronic","value":"3006-5496"}],"subject":[],"published":{"date-parts":[[2025,1,13]]},"assertion":[{"value":"2024-10-08","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-12-03","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"cc1-4-57"}}