{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:01:56Z","timestamp":1786978916989,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":53,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031910913","type":"print"},{"value":"9783031910920","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-91092-0_14","type":"book-chapter","created":{"date-parts":[[2025,4,27]],"date-time":"2025-04-27T08:58:14Z","timestamp":1745744294000},"page":"390-420","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Peeking Into the\u00a0Future: MPC Resilient to\u00a0Super-Rushing Adversaries"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0846-9773","authenticated-orcid":false,"given":"Gilad","family":"Asharov","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4282-1387","authenticated-orcid":false,"given":"Anirudh","family":"Chandramouli","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1293-552X","authenticated-orcid":false,"given":"Ran","family":"Cohen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-4096-6305","authenticated-orcid":false,"given":"Yuval","family":"Ishai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,4,28]]},"reference":[{"key":"14_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: EUROCRYPT \u201923, Part II. vol. 14005, pp. 251\u2013281 (2023)","DOI":"10.1007\/978-3-031-30617-4_9"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Abraham, I., Asharov, G., Patil, S., Patra, A.: Perfect asynchronous MPC with linear communication overhead. In: EUROCRYPT \u201924, Part V. vol. 14655, pp. 280\u2013309 (2024)","DOI":"10.1007\/978-3-031-58740-5_10"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Abraham, I., Asharov, G., Yanai, A.: Efficient perfectly secure computation with optimal resilience. In: TCC \u201921, pp. 66\u201396 (2021)","DOI":"10.1007\/978-3-030-90453-1_3"},{"issue":"1","key":"14_CR4","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.2024.3470513","volume":"71","author":"A Appan","year":"2025","unstructured":"Appan, A., Chandramouli, A., Choudhury, A.: Network agnostic perfectly secure multiparty computation against general adversaries. IEEE Trans. Inf. Theory 71(1), 644\u2013682 (2025)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Brakerski, Z., Tsabary, R.: Degree 2 is complete for the round-complexity of malicious MPC. In: EUROCRYPT \u201919, Part II. vol. 11477, pp. 504\u2013531 (2019)","DOI":"10.1007\/978-3-030-17656-3_18"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Kachlon, E., Patra, A.: The round complexity of perfect MPC with active security and optimal resiliency. In: FOCS \u201920, pp. 1277\u20131284 (2020)","DOI":"10.1109\/FOCS46700.2020.00121"},{"key":"14_CR7","unstructured":"Asharov, G., Cohen, R., Shochat, O.: Static vs. adaptive security in perfect MPC: a separation and the adaptive security of BGW. In: ITC \u201922. vol.\u00a0230, pp. 15:1\u201315:16 (2022)"},{"issue":"1","key":"14_CR8","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":"14_CR9","doi-asserted-by":"crossref","unstructured":"Asharov, G., Lindell, Y., Rabin, T.: Perfectly-secure multiplication for any $${t {<} n}\/3$$. In: CRYPTO \u201911, pp. 240\u2013258 (2011)","DOI":"10.1007\/978-3-642-22792-9_14"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Bacho, R., Collins, D., Liu-Zhang, C., Loss, J.: Network-agnostic security comes (almost) for free in DKG and MPC. In: CRYPTO \u201923, Part I. vol. 14081, pp. 71\u2013106 (2023)","DOI":"10.1007\/978-3-031-38557-5_3"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Baum, C., David, B., Dowsley, R., Nielsen, J.B., Oechsner, S.: TARDIS: A foundation of time-lock puzzles in UC. In: EUROCRYPT \u201921, Part III. vol. 12698, pp. 429\u2013459 (2021)","DOI":"10.1007\/978-3-030-77883-5_15"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Beaver, D.: Foundations of secure interactive computing. In: CRYPTO \u201991. vol.\u00a0576, pp. 377\u2013391 (1991)","DOI":"10.1007\/3-540-46766-1_31"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Beerliov\u00e1-Trub\u00edniov\u00e1, Z., Hirt, M., Nielsen, J.B.: On the theoretical gap between synchronous and asynchronous MPC protocols. In: PODC \u201910, pp. 211\u2013218 (2010)","DOI":"10.1145\/1835698.1835746"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Canetti, R., Goldreich, O.: Asynchronous secure computation. In: STOC \u201993, pp. 52\u201361 (1993)","DOI":"10.1145\/167088.167109"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: STOC \u201988, pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Kelmer, B., Rabin, T.: Asynchronous secure computations with optimal resilience (extended abstract). In: PODC \u201994, pp. 183\u2013192 (1994)","DOI":"10.1145\/197917.198088"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Blum, E., Katz, J., Loss, J.: Synchronous consensus with optimal asynchronous fallback guarantees. In: TCC \u201919, Part I. vol. 11891, pp. 131\u2013150 (2019)","DOI":"10.1007\/978-3-030-36030-6_6"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Blum, E., Zhang, C.L., Loss, J.: Always have a backup plan: fully secure synchronous MPC with asynchronous fallback. In: CRYPTO \u201920, Part II. vol. 12171, pp. 707\u2013731 (2020)","DOI":"10.1007\/978-3-030-56880-1_25"},{"issue":"1","key":"14_CR19","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":"14_CR20","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: FOCS \u201901, pp. 136\u2013145 (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Canetti, R., Damg\u00e5rd, I., Dziembowski, S., Ishai, Y., Malkin, T.: On adaptive vs.\u00a0non-adaptive security of multiparty protocols. In: EUROCRYPT \u201901, pp. 262\u2013279 (2001)","DOI":"10.1007\/3-540-44987-6_17"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols (extended abstract). In: STOC \u201988, pp. 11\u201319 (1988)","DOI":"10.1145\/62212.62214"},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable secret sharing and achieving simultaneity in the presence of faults (extended abstract). In: FOCS \u201985, pp. 383\u2013395 (1985)","DOI":"10.1109\/SFCS.1985.64"},{"issue":"4","key":"14_CR24","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0020-0190(93)90120-X","volume":"45","author":"B Chor","year":"1993","unstructured":"Chor, B., Kushilevitz, E.: A communication-privacy tradeoff for modular addition. Inf. Process. Lett. 45(4), 205\u2013210 (1993)","journal-title":"Inf. Process. Lett."},{"key":"14_CR25","doi-asserted-by":"crossref","unstructured":"Chor, B., Merritt, M., Shmoys, D.B.: Simple constant-time consensus protocols in realistic failure models (extended abstract). In: PODC \u201985, pp. 152\u2013162 (1985)","DOI":"10.1145\/323596.323610"},{"issue":"1","key":"14_CR26","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1109\/TIT.2016.2614685","volume":"63","author":"A Choudhury","year":"2017","unstructured":"Choudhury, A., Patra, A.: An efficient framework for unconditionally secure multiparty computation. IEEE Trans. Inf. Theory 63(1), 428\u2013468 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"14_CR27","doi-asserted-by":"crossref","unstructured":"Cohen, R.: Asynchronous secure multiparty computation in constant time. In: PKC \u201916, Part II. vol.\u00a09615, pp. 183\u2013207 (2016)","DOI":"10.1007\/978-3-662-49387-8_8"},{"issue":"3","key":"14_CR28","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1007\/s00145-018-9279-y","volume":"32","author":"R Cohen","year":"2019","unstructured":"Cohen, R., Coretti, S., Garay, J.A., Zikas, V.: Probabilistic termination and composability of cryptographic protocols. J. Cryptol. 32(3), 690\u2013741 (2019)","journal-title":"J. Cryptol."},{"issue":"2","key":"14_CR29","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/s00145-021-09377-0","volume":"34","author":"R Cohen","year":"2021","unstructured":"Cohen, R., Coretti, S., Garay, J.A., Zikas, V.: Round-preserving parallel composition of probabilistic-termination cryptographic protocols. J. Cryptol. 34(2), 12 (2021)","journal-title":"J. Cryptol."},{"key":"14_CR30","doi-asserted-by":"crossref","unstructured":"Coretti, S., Garay, J.A., Hirt, M., Zikas, V.: Constant-round asynchronous multi-party computation based on one-way functions. In: ASIACRYPT \u201916, Part II. vol. 10032, pp. 998\u20131021 (2016)","DOI":"10.1007\/978-3-662-53890-6_33"},{"key":"14_CR31","doi-asserted-by":"crossref","unstructured":"Cramer, R., Damg\u00e5rd, I., Maurer, U.M.: General secure multi-party computation from any linear secret-sharing scheme. In: EUROCRYPT \u201900. vol.\u00a01807, pp. 316\u2013334 (2000)","DOI":"10.1007\/3-540-45539-6_22"},{"key":"14_CR32","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Nielsen, J.B.: Scalable and unconditionally secure multiparty computation. In: CRYPTO \u201907. vol.\u00a04622, pp. 572\u2013590 (2007)","DOI":"10.1007\/978-3-540-74143-5_32"},{"key":"14_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/978-3-319-12475-9_2","volume-title":"Provable Security","author":"I Damg\u00e5rd","year":"2014","unstructured":"Damg\u00e5rd, I., Nielsen, J.B.: Adaptive versus static security in the UC model. In: Chow, S.S.M., Liu, J.K., Hui, L.C.K., Yiu, S.M. (eds.) ProvSec 2014. LNCS, vol. 8782, pp. 10\u201328. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-12475-9_2"},{"key":"14_CR34","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Micali, S.: Parallel reducibility for information-theoretically secure computation. In: CRYPTO \u201900. vol.\u00a01880, pp. 74\u201392 (2000)","DOI":"10.1007\/3-540-44598-6_5"},{"issue":"2","key":"14_CR35","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1145\/42282.42283","volume":"35","author":"C Dwork","year":"1988","unstructured":"Dwork, C., Lynch, N.A., Stockmeyer, L.J.: Consensus in the presence of partial synchrony. J. ACM 35(2), 288\u2013323 (1988)","journal-title":"J. ACM"},{"issue":"2","key":"14_CR36","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374\u2013382 (1985)","journal-title":"J. ACM"},{"key":"14_CR37","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Ishai, Y., Kushilevitz, E., Rabin, T.: The round complexity of verifiable secret sharing and secure multicast. In: STOC \u201901, pp. 580\u2013589 (2001)","DOI":"10.1145\/380752.380853"},{"key":"14_CR38","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Ishai, Y., Kushilevitz, E., Rabin, T.: On 2-round secure multiparty computation. In: CRYPTO \u201902. vol.\u00a02442, pp. 178\u2013193 (2002)","DOI":"10.1007\/3-540-45708-9_12"},{"key":"14_CR39","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: The Foundations of Cryptography - Volume 2: Basic Applications. Cambridge University Press (2004)","DOI":"10.1017\/CBO9780511721656"},{"key":"14_CR40","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: STOC \u201987, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"14_CR41","doi-asserted-by":"crossref","unstructured":"Goyal, V., Liu, Y., Song, Y.: Communication-efficient unconditional MPC with guaranteed output delivery. In: CRYPTO \u201919, Part II, pp. 85\u2013114 (2019)","DOI":"10.1007\/978-3-030-26951-7_4"},{"key":"14_CR42","doi-asserted-by":"crossref","unstructured":"Hirt, M., Nielsen, J.B., Przydatek, B.: Cryptographic asynchronous multi-party computation with optimal resilience (extended abstract). In: EUROCRYPT \u201905. vol.\u00a03494, pp. 322\u2013340 (2005)","DOI":"10.1007\/11426639_19"},{"key":"14_CR43","unstructured":"Hofheinz, D., M\u00fcller-Quade, J.: A synchronous model for multi-party computation and the incompleteness of oblivious transfer. IACR Cryptol. ePrint Arch, p.\u00a016 (2004). http:\/\/eprint.iacr.org\/2004\/016"},{"issue":"4","key":"14_CR44","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/s00145-007-0567-1","volume":"20","author":"YT Kalai","year":"2007","unstructured":"Kalai, Y.T., Lindell, Y., Prabhakaran, M.: Concurrent composition of secure protocols in the timing model. J. Cryptol. 20(4), 431\u2013492 (2007)","journal-title":"J. Cryptol."},{"key":"14_CR45","doi-asserted-by":"crossref","unstructured":"Katz, J., Maurer, U., Tackmann, B., Zikas, V.: Universally composable synchronous computation. In: TCC \u201913. vol.\u00a07785, pp. 477\u2013498 (2013)","DOI":"10.1007\/978-3-642-36594-2_27"},{"key":"14_CR46","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Lindell, Y., Rabin, T.: Information-theoretically secure protocols and security under composition. In: STOC \u201906, pp. 109\u2013118 (2006)","DOI":"10.1145\/1132516.1132532"},{"issue":"3","key":"14_CR47","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R.E., Pease, M.C.: The Byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382\u2013401 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"14_CR48","doi-asserted-by":"crossref","unstructured":"Liu-Zhang, C., Maurer, U.: Synchronous constructive cryptography. In: TCC \u201920, Part II. vol. 12551, pp. 439\u2013472 (2020)","DOI":"10.1007\/978-3-030-64378-2_16"},{"key":"14_CR49","doi-asserted-by":"crossref","unstructured":"Micali, S., Rogaway, P.: Secure computation (abstract). In: CRYPTO \u201991. vol.\u00a0576, pp. 392\u2013404 (1991)","DOI":"10.1007\/3-540-46766-1_32"},{"key":"14_CR50","unstructured":"Micali, S., Rogaway, P.: Secure computation (unpublished manuscript) (1992), preliminary version in [49]. (All references within refer to the unpublished manuscript.)"},{"key":"14_CR51","unstructured":"Nielsen, J.B.: On Protocol Security in the Cryptographic Model. Ph.D. thesis, University of Aarhus (2003)"},{"issue":"2","key":"14_CR52","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"MC Pease","year":"1980","unstructured":"Pease, M.C., Shostak, R.E., Lamport, L.: Reaching agreement in the presence of faults. J. ACM 27(2), 228\u2013234 (1980)","journal-title":"J. ACM"},{"key":"14_CR53","unstructured":"Yao, A.C.: How to generate and exchange secrets (extended abstract). In: FOCS \u201986, pp. 160\u2013164 (1986)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-91092-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,27]],"date-time":"2025-04-27T08:58:22Z","timestamp":1745744302000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-91092-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031910913","9783031910920"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-91092-0_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"28 April 2025","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":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","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":"4 May 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 May 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}