{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T10:55:23Z","timestamp":1776941723068,"version":"3.51.4"},"publisher-location":"Singapore","reference-count":45,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819609376","type":"print"},{"value":"9789819609383","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T00:00:00Z","timestamp":1733961600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T00:00:00Z","timestamp":1733961600000},"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-981-96-0938-3_3","type":"book-chapter","created":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T18:20:05Z","timestamp":1733941205000},"page":"69-101","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["FOLEAGE: $$\\mathbb {F}_{\\scriptstyle 4}$$OLE-Based Multi-party Computation for\u00a0Boolean Circuits"],"prefix":"10.1007","author":[{"given":"Maxime","family":"Bombar","sequence":"first","affiliation":[]},{"given":"Dung","family":"Bui","sequence":"additional","affiliation":[]},{"given":"Geoffroy","family":"Couteau","sequence":"additional","affiliation":[]},{"given":"Alain","family":"Couvreur","sequence":"additional","affiliation":[]},{"given":"Cl\u00e9ment","family":"Ducros","sequence":"additional","affiliation":[]},{"given":"Sacha","family":"Servan-Schreiber","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,12]]},"reference":[{"key":"3_CR1","unstructured":"Aguilar, C., Blazy, O., Deneuville, J.C., Gaborit, P., Z\u00e9mor, G.: Efficient encryption from random quasi-cyclic codes. Cryptology ePrint Archive, Report 2016\/1194 (2016), https:\/\/eprint.iacr.org\/2016\/1194"},{"key":"3_CR2","unstructured":"Aguilar Melchor, C., Aragon, N., Bettaieb, S., Bidoux, L., Blazy, O., Bos, J., Deneuville, J.C., Dion, A., Gaborit, P., Lacan, J., Persichetti, E., Robert, J.M., V\u00e9ron, P., Z\u00e9mor, G., Bos, J.: HQC. Round 4 Submission to the NIST Post-Quantum Cryptography Call (Oct 2022), https:\/\/pqc-hqc.org\/"},{"issue":"5","key":"3_CR3","doi-asserted-by":"publisher","first-page":"3927","DOI":"10.1109\/TIT.2018.2804444","volume":"64","author":"C Aguilar-Melchor","year":"2018","unstructured":"Aguilar-Melchor, C., Blazy, O., Deneuville, J.C., Gaborit, P., Z\u00e9mor, G.: Efficient encryption from random quasi-cyclic codes. IEEE Transactions on Information Theory 64(5), 3927\u20133943 (2018)","journal-title":"IEEE Transactions on Information Theory"},{"key":"3_CR4","doi-asserted-by":"publisher","unstructured":"Amiri, H., Shahbahrami, A.: SIMD programming using Intel vector extensions. J. Parallel Distrib. Comput. 135(C), 83-100 (Jan 2020). https:\/\/doi.org\/10.1016\/j.jpdc.2019.09.012","DOI":"10.1016\/j.jpdc.2019.09.012"},{"key":"3_CR5","doi-asserted-by":"publisher","unstructured":"Beaver, D.: Efficient multiparty protocols using circuit randomization. In: Feigenbaum, J. (ed.) CRYPTO\u201991. LNCS, vol.\u00a0576, pp. 420\u2013432. Springer, Heidelberg (Aug 1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_34","DOI":"10.1007\/3-540-46766-1_34"},{"key":"3_CR6","doi-asserted-by":"publisher","unstructured":"Beaver, D.: Correlated pseudorandomness and the complexity of private computations. In: 28th ACM STOC. pp. 479\u2013488. ACM Press (May 1996). https:\/\/doi.org\/10.1145\/237814.237996","DOI":"10.1145\/237814.237996"},{"key":"3_CR7","unstructured":"Bombar, M., Bui, D., Couteau, G., Couvreur, A., Ducros, C., Servan-Schreiber, S.: FOLEAGE: $$\\mathbb{F}_4$$OLE-based multi-party computation for boolean circuits. Cryptology ePrint Archive, Paper 2024\/429 (2024), https:\/\/eprint.iacr.org\/2024\/429"},{"key":"3_CR8","doi-asserted-by":"publisher","unstructured":"Bombar, M., Couteau, G., Couvreur, A., Ducros, C.: Correlated pseudorandomness from the hardness of quasi-abelian decoding. In: CRYPTO\u00a02023, Part\u00a0IV. pp. 567\u2013601. LNCS, Springer, Heidelberg (Aug 2023). https:\/\/doi.org\/10.1007\/978-3-031-38551-3_18","DOI":"10.1007\/978-3-031-38551-3_18"},{"key":"3_CR9","doi-asserted-by":"publisher","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y.: Compressing vector OLE. In: Lie, D., Mannan, M., Backes, M., Wang, X. (eds.) ACM CCS 2018. pp. 896\u2013912. ACM Press (Oct 2018).https:\/\/doi.org\/10.1145\/3243734.3243868","DOI":"10.1145\/3243734.3243868"},{"key":"3_CR10","doi-asserted-by":"publisher","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Resch, N., Scholl, P.: Correlated pseudorandomness from expand-accumulate codes. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO\u00a02022, Part\u00a0II. LNCS, vol. 13508, pp. 603\u2013633. Springer, Heidelberg (Aug 2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_21","DOI":"10.1007\/978-3-031-15979-4_21"},{"key":"3_CR11","doi-asserted-by":"publisher","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Rindal, P., Scholl, P.: Efficient two-round OT extension and silent non-interactive secure computation. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J. (eds.) ACM CCS 2019. pp. 291\u2013308. ACM Press (Nov 2019). https:\/\/doi.org\/10.1145\/3319535.3354255","DOI":"10.1145\/3319535.3354255"},{"key":"3_CR12","doi-asserted-by":"publisher","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Scholl, P.: Efficient pseudorandom correlation generators: Silent OT extension and more. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO\u00a02019, Part\u00a0III. LNCS, vol. 11694, pp. 489\u2013518. Springer, Heidelberg (Aug 2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_16","DOI":"10.1007\/978-3-030-26954-8_16"},{"key":"3_CR13","doi-asserted-by":"publisher","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Scholl, P.: Correlated pseudorandom functions from variable-density LPN. In: 61st FOCS. pp. 1069\u20131080. IEEE Computer Society Press (Nov 2020). https:\/\/doi.org\/10.1109\/FOCS46700.2020.00103","DOI":"10.1109\/FOCS46700.2020.00103"},{"key":"3_CR14","doi-asserted-by":"publisher","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Scholl, P.: Correlated pseudorandom functions from variable-density LPN. In: 61st FOCS. pp. 1069\u20131080. IEEE Computer Society Press (Nov 2020). https:\/\/doi.org\/10.1109\/FOCS46700.2020.00103","DOI":"10.1109\/FOCS46700.2020.00103"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Function secret sharing. In: Annual international conference on the theory and applications of cryptographic techniques. pp. 337\u2013367. Springer (2015)","DOI":"10.1007\/978-3-662-46803-6_12"},{"key":"3_CR16","doi-asserted-by":"publisher","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Function secret sharing: Improvements and extensions. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) ACM CCS 2016. pp. 1292\u20131303. ACM Press (Oct 2016). https:\/\/doi.org\/10.1145\/2976749.2978429","DOI":"10.1145\/2976749.2978429"},{"key":"3_CR17","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled) fully homomorphic encryption without bootstrapping. vol.\u00a06. Association for Computing Machinery, New York, NY, USA (jul 2014). https:\/\/doi.org\/10.1145\/2633600, https:\/\/doi.org\/10.1145\/2633600","DOI":"10.1145\/2633600"},{"key":"3_CR18","doi-asserted-by":"publisher","unstructured":"Cascudo, I., Cramer, R., Xing, C., Yuan, C.: Amortized complexity of information-theoretically secure MPC revisited. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO\u00a02018, Part\u00a0III. LNCS, vol. 10993, pp. 395\u2013426. Springer, Heidelberg (Aug 2018). https:\/\/doi.org\/10.1007\/978-3-319-96878-0_14","DOI":"10.1007\/978-3-319-96878-0_14"},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1090\/S0025-5718-1965-0178586-1","volume":"19","author":"JW Cooley","year":"1965","unstructured":"Cooley, J.W., Tukey, J.W.: An Algorithm for the Machine Calculation of Complex Fourier Series. Math. Comput. 19, 297\u2013301 (1965). https:\/\/doi.org\/10.1090\/S0025-5718-1965-0178586-1","journal-title":"Math. Comput."},{"key":"3_CR20","doi-asserted-by":"publisher","unstructured":"Couteau, G., Ducros, C.: Pseudorandom correlation functions from variable-density LPN, revisited. In: Boldyreva, A., Kolesnikov, V. (eds.) PKC\u00a02023, Part\u00a0II. LNCS, vol. 13941, pp. 221\u2013250. Springer, Heidelberg (May 2023). https:\/\/doi.org\/10.1007\/978-3-031-31371-4_8","DOI":"10.1007\/978-3-031-31371-4_8"},{"key":"3_CR21","doi-asserted-by":"publisher","unstructured":"Couteau, G., Rindal, P., Raghuraman, S.: Silver: Silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes. In: Malkin, T., Peikert, C. (eds.) CRYPTO\u00a02021, Part\u00a0III. LNCS, vol. 12827, pp. 502\u2013534. Springer, Heidelberg, Virtual Event (Aug 2021). https:\/\/doi.org\/10.1007\/978-3-030-84252-9_17","DOI":"10.1007\/978-3-030-84252-9_17"},{"key":"3_CR22","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd, I., Nielsen, J.B., Nielsen, M., Ranellucci, S.: The TinyTable protocol for 2-party secure computation, or: Gate-scrambling revisited. In: Katz, J., Shacham, H. (eds.) CRYPTO\u00a02017, Part\u00a0I. LNCS, vol. 10401, pp. 167\u2013187. Springer, Heidelberg (Aug 2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_6","DOI":"10.1007\/978-3-319-63688-7_6"},{"key":"3_CR23","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.) CRYPTO\u00a02012. LNCS, vol.\u00a07417, pp. 643\u2013662. Springer, Heidelberg (Aug 2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_38","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"3_CR24","doi-asserted-by":"publisher","unstructured":"Doerner, J., shelat, a.: Scaling ORAM for secure computation. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017. pp. 523\u2013535. ACM Press (Oct\u00a0\/\u00a0Nov 2017). https:\/\/doi.org\/10.1145\/3133956.3133967","DOI":"10.1145\/3133956.3133967"},{"key":"3_CR25","first-page":"205","volume-title":"CRYPTO\u201982","author":"S Even","year":"1982","unstructured":"Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. In: Chaum, D., Rivest, R.L., Sherman, A.T. (eds.) CRYPTO\u201982. pp. 205\u2013210. Plenum Press, New York, USA (1982)"},{"key":"3_CR26","doi-asserted-by":"publisher","unstructured":"Gilboa, N.: Two party RSA key generation. In: Wiener, M.J. (ed.) CRYPTO\u201999. LNCS, vol.\u00a01666, pp. 116\u2013129. Springer, Heidelberg (Aug 1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_8","DOI":"10.1007\/3-540-48405-1_8"},{"key":"3_CR27","doi-asserted-by":"crossref","unstructured":"Gilboa, N., Ishai, Y.: Distributed point functions and their applications. In: Advances in Cryptology\u2013EUROCRYPT 2014: 33rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Copenhagen, Denmark, May 11-15, 2014. Proceedings 33. pp. 640\u2013658. Springer (2014)","DOI":"10.1007\/978-3-642-55220-5_35"},{"key":"3_CR28","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions, p. 241-264. Association for Computing Machinery, New York, NY, USA (2019), https:\/\/doi.org\/10.1145\/3335741.3335752","DOI":"10.1145\/3335741.3335752"},{"key":"3_CR29","doi-asserted-by":"publisher","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 (May 1987). https:\/\/doi.org\/10.1145\/28395.28420","DOI":"10.1145\/28395.28420"},{"key":"3_CR30","doi-asserted-by":"crossref","unstructured":"Guo, X., Yang, K., Wang, X., Zhang, W., Xie, X., Zhang, J., Liu, Z.: Half-tree: Halving the cost of tree expansion in COT and DPF. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques. pp. 330\u2013362. Springer (2023)","DOI":"10.1007\/978-3-031-30545-0_12"},{"key":"3_CR31","doi-asserted-by":"publisher","unstructured":"Hazay, C., Orsini, E., Scholl, P., Soria-Vazquez, E.: Concretely efficient large-scale MPC with active security (or, TinyKeys for TinyOT). In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT\u00a02018, Part\u00a0III. LNCS, vol. 11274, pp. 86\u2013117. Springer, Heidelberg (Dec 2018). https:\/\/doi.org\/10.1007\/978-3-030-03332-3_4","DOI":"10.1007\/978-3-030-03332-3_4"},{"key":"3_CR32","doi-asserted-by":"crossref","unstructured":"Huffman, W.C., Kim, J.L., Sol\u00e9, P.: Concise encyclopedia of coding theory. Chapman and Hall\/CRC (2021)","DOI":"10.1201\/9781315147901"},{"key":"3_CR33","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Kilian, J., Nissim, K., Petrank, E.: Extending oblivious transfers efficiently. In: Boneh, D. (ed.) CRYPTO\u00a02003. LNCS, vol.\u00a02729, pp. 145\u2013161. Springer, Heidelberg (Aug 2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_9","DOI":"10.1007\/978-3-540-45146-4_9"},{"key":"3_CR34","doi-asserted-by":"crossref","unstructured":"Keller, M.: MP-SPDZ: A versatile framework for multi-party computation. In: Proceedings of the 2020 ACM SIGSAC conference on computer and communications security. pp. 1575\u20131590 (2020)","DOI":"10.1145\/3372297.3417872"},{"key":"3_CR35","doi-asserted-by":"publisher","unstructured":"Keller, M., Orsini, E., Scholl, P.: MASCOT: Faster malicious arithmetic secure computation with oblivious transfer. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) ACM CCS 2016. pp. 830\u2013842. ACM Press (Oct 2016). https:\/\/doi.org\/10.1145\/2976749.2978357","DOI":"10.1145\/2976749.2978357"},{"key":"3_CR36","doi-asserted-by":"publisher","unstructured":"Keller, M., Pastro, V., Rotaru, D.: Overdrive: Making SPDZ great again. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT\u00a02018, Part\u00a0III. LNCS, vol. 10822, pp. 158\u2013189. Springer, Heidelberg (Apr\u00a0\/\u00a0May 2018). https:\/\/doi.org\/10.1007\/978-3-319-78372-7_6","DOI":"10.1007\/978-3-319-78372-7_6"},{"key":"3_CR37","doi-asserted-by":"crossref","unstructured":"Kolesnikov, V., Schneider, T.: Improved garbled circuit: Free xor gates and applications. In: Automata, Languages and Programming: 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part II 35. pp. 486\u2013498. Springer (2008)","DOI":"10.1007\/978-3-540-70583-3_40"},{"issue":"2","key":"3_CR38","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1137\/060658242","volume":"46","author":"U Oberst","year":"2007","unstructured":"Oberst, U.: The fast fourier transform. SIAM journal on control and optimization 46(2), 496\u2013540 (2007)","journal-title":"SIAM journal on control and optimization"},{"key":"3_CR39","unstructured":"OpenSSL Project: OpenSSL cryptography and SSL\/TLS toolkit. https:\/\/www.openssl.org\/, accessed: 2024-02-12"},{"key":"3_CR40","unstructured":"Rabin, M.: How to exchange secrets by oblivious transfer. Technical Report TR-81, Harvard University, (1981)"},{"key":"3_CR41","doi-asserted-by":"publisher","unstructured":"Raghuraman, S., Rindal, P., Tanguy, T.: Expand-convolute codes for pseudorandom correlation generators from LPN. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology - CRYPTO 2023 - 43rd Annual International Cryptology Conference, CRYPTO 2023, Santa Barbara, CA, USA, August 20-24, 2023, Proceedings, Part IV. Lecture Notes in Computer Science, vol. 14084, pp. 602\u2013632. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-38551-3_19, https:\/\/doi.org\/10.1007\/978-3-031-38551-3_19","DOI":"10.1007\/978-3-031-38551-3_19"},{"key":"3_CR42","unstructured":"Rindal, P., Roy, L.: libOTe: an efficient, portable, and easy to use oblivious transfer library. https:\/\/github.com\/osu-crypto\/libOTe"},{"key":"3_CR43","doi-asserted-by":"publisher","unstructured":"Roy, L.: SoftSpokenOT: Quieter OT extension from small-field silent VOLE in the minicrypt model. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO\u00a02022, Part\u00a0I. LNCS, vol. 13507, pp. 657\u2013687. Springer, Heidelberg (Aug 2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_23","DOI":"10.1007\/978-3-031-15802-5_23"},{"key":"3_CR44","doi-asserted-by":"publisher","unstructured":"Twogood, R.E., Ekstrom, M.P.: An extension of Eklundh\u2019s matrix transposition algorithm and its application in digital image processing. IEEE Trans. Comput. 25(9), 950-952 (sep 1976). https:\/\/doi.org\/10.1109\/TC.1976.1674721, https:\/\/doi.org\/10.1109\/TC.1976.1674721","DOI":"10.1109\/TC.1976.1674721"},{"key":"3_CR45","doi-asserted-by":"publisher","unstructured":"Yao, A.C.C.: How to generate and exchange secrets (extended abstract). In: 27th FOCS. pp. 162\u2013167. IEEE Computer Society Press (Oct 1986). https:\/\/doi.org\/10.1109\/SFCS.1986.25","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-0938-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T19:29:00Z","timestamp":1733945340000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0938-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,12]]},"ISBN":["9789819609376","9789819609383"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0938-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,12]]},"assertion":[{"value":"12 December 2024","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":"Kolkata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}