{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,30]],"date-time":"2026-10-30T18:34:02Z","timestamp":1793385242930,"version":"4.5.0"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032018830","type":"print"},{"value":"9783032018847","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-032-01884-7_9","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T09:31:15Z","timestamp":1755336675000},"page":"261-294","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Computationally Efficient Asynchronous MPC with\u00a0Linear Communication and\u00a0Low Additive Overhead"],"prefix":"10.1007","author":[{"given":"Akhil","family":"Bandarupalli","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaoyu","family":"Ji","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Aniket","family":"Kate","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chen-Da","family":"Liu-Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yifan","family":"Song","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-031-58740-5_10","volume-title":"EUROCRYPT 2024, Part V","author":"I Abraham","year":"2024","unstructured":"Abraham, I., Asharov, G., Patil, S., Patra, A.: Perfect asynchronous MPC with linear communication overhead. In: Joye, M., Leander, G. (eds.) EUROCRYPT 2024, Part V. LNCS, vol. 14655, pp. 280\u2013309. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58740-5_10"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-981-99-8721-4_13","volume-title":"ASIACRYPT 2023, Part I","author":"S Atapoor","year":"2023","unstructured":"Atapoor, S., Baghery, K., Cozzo, D., Pedersen, R.: VSS from distributed ZK proofs and applications. In: Guo, J., Steinfeld, R. (eds.) ASIACRYPT 2023, Part I. LNCS, pp. 405\u2013440. Springer, Singapore (2023). https:\/\/doi.org\/10.1007\/978-981-99-8721-4_13"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Abraham, I., Dolev, D., Stern, G.: Revisiting asynchronous fault tolerant computation with optimal resilience. In: Emek, Y., Cachin, C. (eds.) 39th ACM PODC, pp. 139\u2013148. ACM (2020)","DOI":"10.1145\/3382734.3405722"},{"key":"9_CR4","doi-asserted-by":"publisher","unstructured":"Abraham, I., Jovanovic, P., Maller, M., Meiklejohn, S., Stern, G.: Bingo: adaptivity and asynchrony in verifiable secret sharing and distributed key generation. In: Advances in Cryptology \u2013 CRYPTO 2023: 43rd Annual International Cryptology Conference, CRYPTO 2023, Santa Barbara, CA, USA, 20\u201324 August 2023, Proceedings, Part I, pp. 39\u201370. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-38557-5_2","DOI":"10.1007\/978-3-031-38557-5_2"},{"key":"9_CR5","unstructured":"Bandarupalli, A., Bhat, A., Bagchi, S., Kate, A., Reiter, M.K.: Hashrand: efficient asynchronous random beacon without threshold cryptographic setup. ACM CCS 2024 (to appear) (2024). https:\/\/eprint.iacr.org\/2023\/451"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/3-540-46766-1_34","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201991","author":"D Beaver","year":"1992","unstructured":"Beaver, D.: Efficient multiparty protocols using circuit randomization. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 420\u2013432. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_34"},{"key":"9_CR7","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":"9_CR8","doi-asserted-by":"crossref","unstructured":"Bandarupalli, A., Ji, X., Kate, A., Liu-Zhang, C.D., Song, Y.: Computationally efficient asynchronous MPC with linear communication and low additive overhead. Cryptology ePrint Archive, Paper 2024\/1666 (2024)","DOI":"10.1007\/978-3-032-01884-7_9"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/978-3-030-64375-1_13","volume-title":"TCC 2020, Part I","author":"E Blum","year":"2020","unstructured":"Blum, E., Katz, J., Liu-Zhang, C.-D., Loss, J.: Asynchronous byzantine agreement with subquadratic communication. In: Pass, R., Pietrzak, K. (eds.) TCC 2020, Part I. LNCS, vol. 12550, pp. 353\u2013380. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64375-1_13"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1007\/978-3-642-25385-0_32","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"M Backes","year":"2011","unstructured":"Backes, M., Kate, A., Patra, A.: Computational verifiable secret sharing revisited. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 590\u2013609. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_32"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Kelmer, B., Rabin, T.: Asynchronous secure computations with optimal resilience (extended abstract). In: Anderson, J., Toueg, S. (eds.) 13th ACM PODC, pp. 183\u2013192. ACM (1994)","DOI":"10.1145\/197917.198088"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1007\/978-3-642-32009-5_39","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"E Ben-Sasson","year":"2012","unstructured":"Ben-Sasson, E., Fehr, S., Ostrovsky, R.: Near-linear unconditionally-secure multiparty computation with a dishonest minority. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 663\u2013680. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_39"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/11681878_16","volume-title":"Theory of Cryptography","author":"Z Beerliov\u00e1-Trub\u00edniov\u00e1","year":"2006","unstructured":"Beerliov\u00e1-Trub\u00edniov\u00e1, Z., Hirt, M.: Efficient multi-party computation with dispute control. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 305\u2013328. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11681878_16"},{"key":"9_CR14","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, 143\u2013202 (2000)","journal-title":"J. Cryptol."},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: 42nd Annual Symposium on Foundations of Computer Science, FOCS 2001, Las Vegas, Nevada, USA, 14\u201317 October 2001, pp. 136\u2013145. IEEE Computer Society (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"9_CR16","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":"9_CR17","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-030-90453-1_2","volume-title":"TCC 2021, Part II","author":"A Chopard","year":"2021","unstructured":"Chopard, A., Hirt, M., Liu-Zhang, C.-D.: On communication-efficient asynchronous MPC with adaptive security. In: Nissim, K., Waters, B. (eds.) TCC 2021, Part II. LNCS, vol. 13043, pp. 35\u201365. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90453-1_2"},{"key":"9_CR18","first-page":"183","volume-title":"PKC 2016, Part II","author":"R Cohen","year":"2016","unstructured":"Cohen, R.: Asynchronous secure multiparty computation in constant time. In: Cheng, C.-M., Chung, K.-M., Persiano, G., Yang, B.-Y. (eds.) PKC 2016, Part II. LNCS, vol. 9615, pp. 183\u2013207. Springer, Berlin, Heidelberg (2016)"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Choudhury, A., Patra, A.: Optimally resilient asynchronous MPC with linear communication complexity. In: Proceedings of International Conference on Distributed Computing and Networking (ICDCN), pp. 1\u201310 (2015)","DOI":"10.1145\/2684464.2684470"},{"issue":"2","key":"9_CR20","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/s00145-023-09451-9","volume":"36","author":"A Choudhury","year":"2023","unstructured":"Choudhury, A., Patra, A.: On the communication efficiency of statistically secure asynchronous mpc with optimal resilience. J. Cryptol. 36(2), 13 (2023)","journal-title":"J. Cryptol."},{"key":"9_CR21","unstructured":"Canetti, R., Rabin, T.: Fast asynchronous byzantine agreement with optimal resilience (1998)"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Das, S., Duan, S., Liu, S., Momose, A., Ren, L., Shoup, V.: Asynchronous consensus without trusted setup or public-key cryptography. Cryptology ePrint Archive (2024)","DOI":"10.1145\/3658644.3670327"},{"key":"9_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-642-00468-1_10","volume-title":"Public Key Cryptography \u2013 PKC 2009","author":"I Damg\u00e5rd","year":"2009","unstructured":"Damg\u00e5rd, I., Geisler, M., Kr\u00f8igaard, M., Nielsen, J.B.: Asynchronous multiparty computation: theory and implementation. In: Jarecki, S., Tsudik, G. (eds.) PKC 2009. LNCS, vol. 5443, pp. 160\u2013179. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00468-1_10"},{"key":"9_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/978-3-540-74143-5_32","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"I Damg\u00e5rd","year":"2007","unstructured":"Damg\u00e5rd, I., Nielsen, J.B.: Scalable and unconditionally secure multiparty computation. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 572\u2013590. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74143-5_32"},{"key":"9_CR25","doi-asserted-by":"crossref","unstructured":"Das, S., Xiang, Z., Ren, L.: Asynchronous data dissemination and its applications. In: Vigna, G., Shi, E. (eds.) ACM CCS 2021, pp. 2705\u20132721. ACM Press (2021)","DOI":"10.1145\/3460120.3484808"},{"key":"9_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-030-84245-1_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"V Goyal","year":"2021","unstructured":"Goyal, V., Li, H., Ostrovsky, R., Polychroniadou, A., Song, Y.: ATLAS: efficient and scalable MPC in\u00a0the honest majority setting. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12826, pp. 244\u2013274. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_9"},{"key":"9_CR27","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-031-68397-8_6","volume-title":"CRYPTO 2024, Part VIII","author":"V Goyal","year":"2024","unstructured":"Goyal, V., Liu-Zhang, C.-D., Song, Y.: Towards achieving asynchronous MPC with linear communication and optimal resilience. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024, Part VIII. LNCS, vol. 14927, pp. 170\u2013206. Springer, Cham (2024)"},{"key":"9_CR28","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":"9_CR29","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1007\/978-3-030-56880-1_22","volume-title":"CRYPTO 2020, Part II","author":"V Goyal","year":"2020","unstructured":"Goyal, V., Song, Y., Zhu, C.: Guaranteed output delivery comes free in honest majority MPC. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020, Part II. LNCS, vol. 12171, pp. 618\u2013646. Springer, Cham (2020)"},{"key":"9_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/3-540-44448-3_12","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2000","author":"M Hirt","year":"2000","unstructured":"Hirt, M., Maurer, U., Przydatek, B.: Efficient secure multi-party computation. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 143\u2013161. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44448-3_12"},{"key":"9_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/11426639_19","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"M Hirt","year":"2005","unstructured":"Hirt, M., Nielsen, J.B., Przydatek, B.: Cryptographic asynchronous multi-party computation with optimal resilience. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 322\u2013340. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11426639_19"},{"key":"9_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/978-3-540-70583-3_39","volume-title":"Automata, Languages and Programming","author":"M Hirt","year":"2008","unstructured":"Hirt, M., Nielsen, J.B., Przydatek, B.: Asynchronous multi-party computation with quadratic communication. 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. 473\u2013485. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70583-3_39"},{"key":"9_CR33","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/978-3-031-68397-8_13","volume-title":"CRYPTO 2024, Part VIII","author":"X Ji","year":"2024","unstructured":"Ji, X., Li, J., Song, Y.: Linear-communication asynchronous complete secret sharing with optimal resilience. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024, Part VIII. LNCS, vol. 14927, pp. 418\u2013453. Springer, Cham (2024)"},{"key":"9_CR34","doi-asserted-by":"crossref","unstructured":"Lu, D., Yurek, T., Kulshreshtha, S., Govind, R., Kate, A., Miller, A.K.: Honeybadgermpc and asynchromix: practical asynchronous MPC and its application to anonymous communication. In: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, CCS 2019, London, UK, 11\u201315 November 2019, pp. 887\u2013903. ACM (2019)","DOI":"10.1145\/3319535.3354238"},{"key":"9_CR35","unstructured":"Momose, A.: Practical asynchronous mpc from lightweight cryptography. Cryptology ePrint Archive (2024)"},{"key":"9_CR36","unstructured":"Nayak, K., Ren, L., Shi, E., Vaidya, N.H., Xiang, Z.: Improved extension protocols for byzantine broadcast and agreement. arXiv preprint arXiv:2002.11321 (2020)"},{"key":"9_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-319-93387-0_17","volume-title":"Applied Cryptography and Network Security","author":"PS Nordholt","year":"2018","unstructured":"Nordholt, P.S., Veeningen, M.: Minimising communication in honest-majority MPC by batchwise multiplication verification. In: Preneel, B., Vercauteren, F. (eds.) ACNS 2018. LNCS, vol. 10892, pp. 321\u2013339. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93387-0_17"},{"key":"9_CR38","unstructured":"Patra, A., Choudhury, A., Rangan, C.P.: Efficient asynchronous multiparty computation with optimal resilience. Cryptology ePrint Archive, Report 2008\/425 (2008)"},{"key":"9_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-642-14496-7_7","volume-title":"Information Theoretic Security","author":"A Patra","year":"2010","unstructured":"Patra, A., Choudhary, A., Rangan, C.P.: Efficient statistical asynchronous verifiable secret sharing with optimal resilience. In: Kurosawa, K. (ed.) ICITS 2009. LNCS, vol. 5973, pp. 74\u201392. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14496-7_7"},{"key":"9_CR40","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":"9_CR41","unstructured":"Yuan, S., Yuan, L., Li, J., Wang, Y., Dong, C., Tang, Q.: Dumbo-mpc: efficient fully asynchronous mpc with optimal resilience. Cryptology ePrint Archive (2024)"},{"issue":"3","key":"9_CR42","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s00145-024-09505-6","volume":"37","author":"V Shoup","year":"2024","unstructured":"Shoup, V., Smart, N.P.: Lightweight asynchronous verifiable secret sharing with optimal resilience. J. Cryptol. 37(3), 27 (2024)","journal-title":"J. Cryptol."},{"key":"9_CR43","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: Theory and applications of trapdoor functions (extended abstract). In: 23rd FOCS, pp. 80\u201391. IEEE Computer Society Press (1982)","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-01884-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,5]],"date-time":"2026-08-05T17:29:32Z","timestamp":1785950972000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01884-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032018830","9783032018847"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01884-7_9","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":"17 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2025","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":"crypto2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}