{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T23:28:05Z","timestamp":1784676485179,"version":"3.55.0"},"publisher-location":"Singapore","reference-count":45,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819551156","type":"print"},{"value":"9789819551163","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"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-981-95-5116-3_4","type":"book-chapter","created":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T11:22:20Z","timestamp":1765106540000},"page":"102-132","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Rumors MPC: GOD for\u00a0Dynamic Committees, Low Communication via\u00a0Constant-Round Chat"],"prefix":"10.1007","author":[{"given":"Bernardo","family":"David","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Arup","family":"Mondal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rahul","family":"Satish","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,12,8]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Acharya, A., Hazay, C., Kolesnikov, V., Prabhakaran, M.: SCALES - MPC with small clients and larger ephemeral servers. In: Kiltz, E., Vaikuntanathan, V. (eds.) TCC 2022, Part II. LNCS, vol. 13748, pp. 502\u2013531. Springer, Cham (2022)","DOI":"10.1007\/978-3-031-22365-5_18"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Kachlon, E., Patra, A.: The round complexity of perfect MPC with active security and optimal resiliency. In: 61st FOCS, pp. 1277\u20131284. IEEE Computer Society Press (2020)","DOI":"10.1109\/FOCS46700.2020.00121"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Kachlon, E., Patra, A.: The round complexity of statistical MPC with optimal resiliency. In: Saha, B., Servedio, R.A. (eds.) 55th ACM STOC, pp. 1527\u20131536. ACM Press (2023)","DOI":"10.1145\/3564246.3585228"},{"issue":"1","key":"4_CR4","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":"4_CR5","doi-asserted-by":"publisher","unstructured":"Badrinarayanan, S., Jain, A., Manohar, N., Sahai, A.: Secure MPC: laziness leads to GOD. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12493, pp. 120\u2013150. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64840-4_5","DOI":"10.1007\/978-3-030-64840-4_5"},{"key":"4_CR6","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":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-030-64375-1_10","volume-title":"Theory of Cryptography","author":"F Benhamouda","year":"2020","unstructured":"Benhamouda, F., et al.: Can a public blockchain keep a secret? In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12550, pp. 260\u2013290. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64375-1_10"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Benhamouda, F., Halevi, S., Krawczyk, H., Miao, A., Rabin, T.: Threshold cryptography as a service (in the multiserver and YOSO models). In: Yin, H., Stavrou, A., Cremers, C., Shi, E. (eds.) ACM CCS 2022, pp. 323\u2013336. ACM Press (2022)","DOI":"10.1145\/3548606.3559397"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Bienstock, A., Escudero, D., Polychroniadou, A.: On linear communication complexity for (maximally) fluid MPC. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023, Part I. LNCS, vol. 14081, pp. 263\u2013294. Springer, Cham (2023)","DOI":"10.1007\/978-3-031-38557-5_9"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Bienstock, A., Escudero, D., Polychroniadou, A.: Perfectly secure fluid MPC with abort and linear communication complexity. IACR Cryptol. ePrint Arch. 2071 (2024). https:\/\/eprint.iacr.org\/2024\/2071","DOI":"10.62056\/aesg89n4e"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Braun, L., Damg\u00e5rd, I., Orlandi, C.: Secure multiparty computation from threshold encryption based on class groups. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023, Part I. LNCS, vol. 14081, pp. 613\u2013645. Springer, Cham (2023)","DOI":"10.1007\/978-3-031-38557-5_20"},{"key":"4_CR12","doi-asserted-by":"crossref","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.) ASIACRYPT 2022, Part III. LNCS, vol. 13793, pp. 151\u2013180. Springer, Cham (2022)","DOI":"10.1007\/978-3-031-22969-5_6"},{"issue":"1","key":"4_CR13","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":"4_CR14","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: 42nd FOCS, pp. 136\u2013145. IEEE Computer Society Press (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"issue":"3","key":"4_CR15","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s00145-004-0135-x","volume":"17","author":"R Canetti","year":"2004","unstructured":"Canetti, R., Damg\u00e5rd, I., Dziembowski, S., Ishai, Y., Malkin, T.: Adaptive versus non-adaptive security of multi-party protocols. J. Cryptol. 17(3), 153\u2013207 (2004)","journal-title":"J. Cryptol."},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Canetti, R., Kolby, S., Ravi, D., Soria-Vazquez, E., Yakoubov, S.: Taming adaptivity in YOSO protocols: the modular way. In: Rothblum, G.N., Wee, H. (eds.) TCC 2023, Part II. LNCS, vol. 14370, pp. 33\u201362. Springer, Cham (2023)","DOI":"10.1007\/978-3-031-48618-0_2"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Cascudo, I., David, B.: Publicly verifiable secret sharing over class groups and applications to DKG and YOSO. In: Joye, M., Leander, G. (eds.) EUROCRYPT\u00a02024, Part\u00a0V. LNCS, vol. 14655, pp. 216\u2013248. Springer, Cham (2024)","DOI":"10.1007\/978-3-031-58740-5_8"},{"key":"4_CR18","doi-asserted-by":"crossref","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.) ASIACRYPT 2022, Part I. LNCS, vol. 13791, pp. 651\u2013680. Springer, Cham (2022)","DOI":"10.1007\/978-3-031-22963-3_22"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols (extended abstract). In: 20th ACM STOC, pp. 11\u201319. ACM Press (1988)","DOI":"10.1145\/62212.62214"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Chen, J., Micali, S.: Algorand: a secure and efficient distributed ledger. Theor. Comput. Sci. 777, 155\u2013183 (2019). https:\/\/doi.org\/10.1016\/j.tcs.2019.02.001","DOI":"10.1016\/j.tcs.2019.02.001"},{"key":"4_CR21","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":"4_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/3-540-48910-X_22","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201999","author":"R Cramer","year":"1999","unstructured":"Cramer, R., Damg\u00e5rd, I., Dziembowski, S., Hirt, M., Rabin, T.: Efficient multiparty computations secure against an adaptive adversary. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 311\u2013326. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_22"},{"key":"4_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/3-540-45539-6_22","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2000","author":"R Cramer","year":"2000","unstructured":"Cramer, R., Damg\u00e5rd, I., Maurer, U.: General secure multi-party computation from any linear secret-sharing scheme. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 316\u2013334. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45539-6_22"},{"key":"4_CR24","unstructured":"Damg\u00e5rd, I., Escudero, D., Polychroniadou, A.: Phoenix: secure computation in an unstable network with dropouts and comebacks. In: Chung, K.M. (ed.) ITC 2023. LIPIcs, vol. 267, pp. 7:1\u20137:21. Schloss Dagstuhl (2023)"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"David, B., et al.: Perfect MPC over layered graphs. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023, Part I. LNCS, vol. 14081, pp. 360\u2013392. Springer, Cham (2023)","DOI":"10.1007\/978-3-031-38557-5_12"},{"key":"4_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-319-78375-8_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"B David","year":"2018","unstructured":"David, B., Ga\u017ei, P., Kiayias, A., Russell, A.: Ouroboros praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10821, pp. 66\u201398. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_3"},{"key":"4_CR27","unstructured":"David, B., Mondal, A., Satish, R.: Rumors MPC: GOD for dynamic committees low communication via constant-round chat. Cryptology ePrint Archive, Paper 2025\/1464 (2025). https:\/\/eprint.iacr.org\/2025\/1464"},{"key":"4_CR28","doi-asserted-by":"crossref","unstructured":"Deligios, G., Konring, A., Liu-Zhang, C.D., Narayanan, V.: Statistical layered MPC. In: Boyle, E., Mahmoody, M. (eds.) TCC 2024, Part IV. LNCS, vol. 15367, pp. 362\u2013394. Springer, Cham (2024)","DOI":"10.1007\/978-3-031-78023-3_12"},{"key":"4_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-030-57990-6_6","volume-title":"Security and Cryptography for Networks","author":"K Eldefrawy","year":"2020","unstructured":"Eldefrawy, K., Hwang, S., Ostrovsky, R., Yung, M.: Communication-efficient (proactive) secure computation for dynamic general adversary structures and dynamic groups. In: Galdi, C., Kolesnikov, V. (eds.) SCN 2020. LNCS, vol. 12238, pp. 108\u2013129. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-57990-6_6"},{"key":"4_CR30","doi-asserted-by":"crossref","unstructured":"Eldefrawy, K., Lepoint, T., Leroux, A.: Communication-efficient proactive MPC for dynamic groups with dishonest majorities. In: Ateniese, G., Venturi, D. (eds.) ACNS 2022. LNCS, vol. 13269, pp. 565\u2013584. Springer, Cham (2022)","DOI":"10.1007\/978-3-031-09234-3_28"},{"key":"4_CR31","unstructured":"Erwig, A., Faust, S., Riahi, S.: Large-scale non-interactive threshold cryptosystems through anonymity. Cryptology ePrint Archive, Report 2021\/1290 (2021). https:\/\/eprint.iacr.org\/2021\/1290"},{"key":"4_CR32","doi-asserted-by":"publisher","unstructured":"Fitzi, M., Hirt, M., Maurer, U.: Trading correctness for privacy in unconditional multi-party computation. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 121\u2013136. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0055724","DOI":"10.1007\/BFb0055724"},{"key":"4_CR33","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":"4_CR34","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Rabin, M.O., Rabin, T.: Simplified VSS and fast-track multiparty computations with applications to threshold cryptography. In: Coan, B.A., Afek, Y. (eds.) 17th ACM PODC, pp. 101\u2013111. ACM (1998)","DOI":"10.1145\/277697.277716"},{"key":"4_CR35","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., et al.: 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":"4_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-030-90456-2_2","volume-title":"Theory of Cryptography","author":"C Gentry","year":"2021","unstructured":"Gentry, C., Halevi, S., Magri, B., Nielsen, J.B., Yakoubov, S.: Random-index PIR and applications. In: Nissim, K., Waters, B. (eds.) TCC 2021. LNCS, vol. 13044, pp. 32\u201361. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90456-2_2"},{"key":"4_CR37","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. (ed.) 19th ACM STOC, pp. 218\u2013229. ACM Press (1987)","DOI":"10.1145\/28395.28420"},{"key":"4_CR38","doi-asserted-by":"publisher","unstructured":"Guo, Y., Pass, R., Shi, E.: Synchronous, with a chance of partition tolerance. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11692, pp. 499\u2013529. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_18","DOI":"10.1007\/978-3-030-26948-7_18"},{"key":"4_CR39","doi-asserted-by":"crossref","unstructured":"Kolby, S., Ravi, D., Yakoubov, S.: Constant-round YOSO MPC without setup. CiC 1(3), 30 (2024)","DOI":"10.62056\/ae5w4fe-3"},{"key":"4_CR40","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Lindell, Y., Rabin, T.: Information-theoretically secure protocols and security under composition. In: Kleinberg, J.M. (ed.) 38th ACM STOC, pp. 109\u2013118. ACM Press (2006)","DOI":"10.1145\/1132516.1132532"},{"key":"4_CR41","unstructured":"Liu-Zhang, C.D., Masserova, E., Ribeiro, J., Soni, P., Thyagarajan, S.A.: Improved YOSO randomness generation with worst-case corruptions. Cryptology ePrint Archive, Report 2024\/1268 (2024). https:\/\/eprint.iacr.org\/2024\/1268"},{"key":"4_CR42","doi-asserted-by":"crossref","unstructured":"Nielsen, J.B., Ribeiro, J.L., Obremski, M.: Public randomness extraction with ephemeral roles and worst-case corruptions. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022, Part I. LNCS, vol. 13507, pp. 127\u2013147. Springer, Cham (2022)","DOI":"10.1007\/978-3-031-15802-5_5"},{"key":"4_CR43","doi-asserted-by":"crossref","unstructured":"Ostrovsky, R., Yung, M.: How to withstand mobile virus attacks (extended abstract). In: Logrippo, L. (ed.) 10th ACM PODC, pp. 51\u201359. ACM (1991)","DOI":"10.1145\/112600.112605"},{"key":"4_CR44","doi-asserted-by":"crossref","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority (extended abstract). In: 21st ACM STOC, pp. 73\u201385. ACM Press (1989)","DOI":"10.1145\/73007.73014"},{"key":"4_CR45","doi-asserted-by":"crossref","unstructured":"Rachuri, R., Scholl, P.: Le mans: dynamic and fluid MPC for dishonest majority. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022, Part I. LNCS, vol. 13507, pp. 719\u2013749. Springer, Cham (2022)","DOI":"10.1007\/978-3-031-15802-5_25"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-5116-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T11:22:23Z","timestamp":1765106543000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-5116-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,8]]},"ISBN":["9789819551156","9789819551163"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-5116-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,8]]},"assertion":[{"value":"8 December 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","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":"8 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}