{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,12]],"date-time":"2025-07-12T01:08:06Z","timestamp":1752282486886,"version":"3.40.3"},"publisher-location":"Cham","reference-count":55,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031643804"},{"type":"electronic","value":"9783031643811"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-64381-1_17","type":"book-chapter","created":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T23:01:56Z","timestamp":1719961316000},"page":"376-400","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Guidance for\u00a0Efficient Selection of\u00a0Secure Parameters for\u00a0Fully Homomorphic Encryption"],"prefix":"10.1007","author":[{"given":"Elena","family":"Kirshanova","sequence":"first","affiliation":[]},{"given":"Chiara","family":"Marcolla","sequence":"additional","affiliation":[]},{"given":"Sergi","family":"Rovira","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,7,3]]},"reference":[{"issue":"4","key":"17_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3214303","volume":"51","author":"A Acar","year":"2018","unstructured":"Acar, A., Aksu, H., Uluagac, A.S., Conti, M.: A survey on homomorphic encryption schemes: theory and implementation. ACM Comput. Surv. (CSUR) 51(4), 1\u201335 (2018)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Albrecht, M.R.: On dual lattice attacks against small-secret LWE and parameter choices in HElib and SEAL. In: Advances in Cryptology \u2013 EUROCRYPT 2017, pp. 103\u2013129 (2017)","DOI":"10.1007\/978-3-319-56614-6_4"},{"key":"17_CR3","unstructured":"Albrecht, M.R., et al.: Homomorphic encryption security standard. Technical Report, HomomorphicEncryption.org , Toronto, Canada, November 2018"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Albrecht, M.R., G\u00f6pfert, F., Virdia, F., Wunderer, T.: Revisiting the expected cost of solving uSVP and applications to LWE. In: Advances in Cryptology\u2013ASIACRYPT 2017, pp. 297\u2013322 (2017)","DOI":"10.1007\/978-3-319-70694-8_11"},{"issue":"3","key":"17_CR5","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1515\/jmc-2015-0016","volume":"9","author":"MR Albrecht","year":"2015","unstructured":"Albrecht, M.R., Player, R., Scott, S.: On the concrete hardness of learning with errors. J. Math. Cryptology 9(3), 169\u2013203 (2015)","journal-title":"J. Math. Cryptology"},{"key":"17_CR6","unstructured":"Alkim, E., Ducas, L., P\u00f6ppelmann, T., Schwabe, P.: Post-quantum key exchange: a new hope. In: Proceedings of the 25th USENIX Conference on Security Symposium, pp. 327\u2013343 (2016)"},{"issue":"1","key":"17_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02579403","volume":"6","author":"L Babai","year":"1986","unstructured":"Babai, L.: On Lov\u00e1sz\u2019 lattice reduction and the nearest lattice point problem. Combinatorica 6(1), 1\u201313 (1986)","journal-title":"Combinatorica"},{"key":"17_CR8","unstructured":"Badawi, A.A., et al.: OpenFHE: open-source fully homomorphic encryption library. Cryptology ePrint Archive, Paper 2022\/915 (2022)"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Becker, A., Ducas, L., Gama, N., Laarhoven, T.: New directions in nearest neighbor searching with applications to lattice sieving. In: SODA 2016, pp. 10\u201324. SIAM (2016)","DOI":"10.1137\/1.9781611974331.ch2"},{"issue":"3","key":"17_CR10","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/s00145-023-09463-5","volume":"36","author":"L Bergerat","year":"2023","unstructured":"Bergerat, L., et al.: Parameter optimization and larger precision for (T)FHE. J. Cryptol. 36(3), 28 (2023)","journal-title":"J. Cryptol."},{"key":"17_CR11","unstructured":"Biasioli, B., Marcolla, C., Calderini, M., Mono, J.: Improving and automating BFV parameters selection: an average-case approach. Cryptology ePrint Archive, Paper 2023\/600 (2023)"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Bos, J.W., et al.: CRYSTALS - Kyber: A CCA-secure module-lattice-based KEM. In: 2018 IEEE EuroS &P, pp. 353\u2013367 (2018)","DOI":"10.1109\/EuroSP.2018.00032"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Brakerski, Z.: Fully homomorphic encryption without modulus switching from classical GapSVP. In: Advances in Cryptology \u2013 CRYPTO 2012, pp. 868\u2013886 (2012)","DOI":"10.1007\/978-3-642-32009-5_50"},{"issue":"3","key":"17_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2633600","volume":"6","author":"Z Brakerski","year":"2014","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled) fully homomorphic encryption without bootstrapping. ACM Trans. Comput. Theor. (TOCT) 6(3), 1\u201336 (2014)","journal-title":"ACM Trans. Comput. Theor. (TOCT)"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Carpov, S., Dubrulle, P., Sirdey, R.: Armadillo: a compilation chain for privacy preserving applications. In: Proceedings of the 3rd International Workshop on Security in Cloud Computing, pp. 13\u201319 (2015)","DOI":"10.1145\/2732516.2732520"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Cheon, J.H., et al.: Introduction to homomorphic encryption and schemes. In: Protecting Privacy through Homomorphic Encryption, pp. 3\u201328 (2021)","DOI":"10.1007\/978-3-030-77287-1_1"},{"key":"17_CR17","doi-asserted-by":"publisher","unstructured":"Cheon, J.H., Han, K., Kim, A., Kim, M., Song, Y.: A full RNS variant of approximate homomorphic encryption. In: Cid, C., Jacobson Jr., M. (eds.) Selected Areas in Cryptography - SAC 2018, SAC 2018, LNCS, vol.11349, pp. 347\u2013368. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-10970-7_1","DOI":"10.1007\/978-3-030-10970-7_1"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Cheon, J.H., Kim, A., Kim, M., Song, Y.: Homomorphic encryption for arithmetic of approximate numbers. In: Advances in Cryptology \u2013 ASIACRYPT 2017, pp. 409\u2013437 (2017)","DOI":"10.1007\/978-3-319-70694-8_15"},{"key":"17_CR19","doi-asserted-by":"publisher","unstructured":"Chillotti, I., Gama, N., Georgieva, M., Izabach\u00e8ne, M.: Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds. In: Cheon, J., Takagi, T. (eds.) Advances in Cryptology - ASIACRYPT 2016, ASIACRYPT 2016, LNCS, vol. 10031, pp. 3\u201333. Springer, Berlin (2016). https:\/\/doi.org\/10.1007\/978-3-662-53887-6_1","DOI":"10.1007\/978-3-662-53887-6_1"},{"issue":"1","key":"17_CR20","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/s00145-019-09319-x","volume":"33","author":"I Chillotti","year":"2020","unstructured":"Chillotti, I., Gama, N., Georgieva, M., Izabach\u00e8ne, M.: TFHE: fast fully homomorphic encryption over the torus. J. Cryptol. 33(1), 34\u201391 (2020)","journal-title":"J. Cryptol."},{"key":"17_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-319-29485-8_19","volume-title":"Topics in Cryptology - CT-RSA 2016","author":"A Costache","year":"2016","unstructured":"Costache, A., Smart, N.P.: Which ring based somewhat homomorphic encryption scheme is best? In: Sako, K. (ed.) CT-RSA 2016. LNCS, vol. 9610, pp. 325\u2013340. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-29485-8_19"},{"key":"17_CR22","unstructured":"Costache, A., Smart, N.P.: Homomorphic encryption without gaussian noise. Cryptology ePrint Archive, Paper 2017\/163 (2017)"},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"Crockett, E., Peikert, C., Sharp, C.: Alchemy: a language and compiler for homomorphic encryption made easy. In: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, pp. 1020\u20131037 (2018)","DOI":"10.1145\/3243734.3243828"},{"key":"17_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/978-3-030-56880-1_12","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"D Dachman-Soled","year":"2020","unstructured":"Dachman-Soled, D., Ducas, L., Gong, H., Rossi, M.: LWE with side information: attacks and concrete security estimation. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12171, pp. 329\u2013358. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_12"},{"key":"17_CR25","doi-asserted-by":"crossref","unstructured":"Dathathri, R., Kostova, B., Saarikivi, O., Dai, W., Laine, K., Musuvathi, M.: EVA: an encrypted vector arithmetic language and compiler for efficient homomorphic computation. In: Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 546\u2013561 (2020)","DOI":"10.1145\/3385412.3386023"},{"issue":"1","key":"17_CR26","doi-asserted-by":"publisher","first-page":"238","DOI":"10.46586\/tches.v2018.i1.238-268","volume":"2018","author":"L Ducas","year":"2018","unstructured":"Ducas, L., et al.: CRYSTALS-Dilithium: a lattice-based digital signature scheme. IACR Trans. Cryptographic Hardware Embed. Syst. 2018(1), 238\u2013268 (2018)","journal-title":"IACR Trans. Cryptographic Hardware Embed. Syst."},{"key":"17_CR27","unstructured":"Ducas, L., Pulles, L.N.: Accurate score prediction for dual-sieve attacks. Cryptology ePrint Archive, Report 2023\/1850 (2023)"},{"key":"17_CR28","doi-asserted-by":"publisher","unstructured":"Ducas, L., Pulles, L.N.: Does the dual-sieve attack on learning with errors even work?. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology - CRYPTO 2023, CRYPTO 2023, LNCS, vol. 14083, pp- 37\u201369. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38548-3_2","DOI":"10.1007\/978-3-031-38548-3_2"},{"key":"17_CR29","unstructured":"van Elsloo, T., Patrini, G., Ivey-Law, H.: SEALion: a framework for neural network inference on encrypted data. arXiv preprint arXiv:1904.12840 (2019)"},{"key":"17_CR30","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption. IACR Cryptology ePrint Archive (2012)"},{"issue":"5","key":"17_CR31","first-page":"1","volume":"36","author":"PA Fouque","year":"2018","unstructured":"Fouque, P.A.: FALCON: fast-fourier lattice-based compact signatures over NTRU. Submission NIST\u2019s Post-quantum Crypt. Standardization Process 36(5), 1\u201375 (2018)","journal-title":"Submission NIST\u2019s Post-quantum Crypt. Standardization Process"},{"key":"17_CR32","unstructured":"Gentry, C.: A fully homomorphic encryption scheme, vol.\u00a020. Stanford university Stanford (2009)"},{"key":"17_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-030-92068-5_2","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"Q Guo","year":"2021","unstructured":"Guo, Q., Johansson, T.: Faster dual lattice attacks for\u00a0solving LWE with\u00a0applications to\u00a0CRYSTALS. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13093, pp. 33\u201362. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92068-5_2"},{"key":"17_CR34","doi-asserted-by":"crossref","unstructured":"Hanrot, G., Pujol, X., Stehl\u00e9, D.: Analyzing blockwise lattice algorithms using dynamical systems. In: Advances in Cryptology \u2013 CRYPTO 2011, pp. 447\u2013464 (2011)","DOI":"10.1007\/978-3-642-22792-9_25"},{"key":"17_CR35","doi-asserted-by":"crossref","unstructured":"Herold, G., Kirshanova, E., May, A.: On the asymptotic complexity of solving lwe. Des. Codes Cryptography 86(1), 55\u201383 (2018)","DOI":"10.1007\/s10623-016-0326-0"},{"key":"17_CR36","doi-asserted-by":"crossref","unstructured":"Howgrave-Graham, N.: A hybrid lattice-reduction and meet-in-the-middle attack against NTRU. In: Advances in Cryptology - CRYPTO 2007, pp. 150\u2013169 (2007)","DOI":"10.1007\/978-3-540-74143-5_9"},{"key":"17_CR37","doi-asserted-by":"crossref","unstructured":"Kannan, R.: Improved algorithms for integer programming and related lattice problems. In: Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing, pp. 193\u2013206 (1983)","DOI":"10.1145\/800061.808749"},{"key":"17_CR38","unstructured":"Kirshanova, E., Marcolla, C., Rovira, S.: Guidance for efficient selection of secure parameters for fully homomorphic encryption. Cryptology ePrint Archive, Paper 2024\/1001 (2024). https:\/\/eprint.iacr.org\/2024\/1001"},{"key":"17_CR39","doi-asserted-by":"crossref","unstructured":"Langlois, A., Stehl\u00e9, D.: Worst-case to average-case reductions for module lattices. Des. Codes Cryptography 75(3), 565\u2013599 (2015)","DOI":"10.1007\/s10623-014-9938-4"},{"key":"17_CR40","unstructured":"Lattigo. http:\/\/github.com\/ldsec\/lattigo"},{"key":"17_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-642-36095-4_19","volume-title":"Topics in Cryptology \u2013 CT-RSA 2013","author":"M Liu","year":"2013","unstructured":"Liu, M., Nguyen, P.Q.: Solving BDD by enumeration: an update. In: Dawson, E. (ed.) CT-RSA 2013. LNCS, vol. 7779, pp. 293\u2013309. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36095-4_19"},{"key":"17_CR42","doi-asserted-by":"crossref","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. In: Gilbert, H. (ed.) Advances in Cryptology \u2013 EUROCRYPT 2010, pp. 1\u201323 (2010)","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"17_CR43","doi-asserted-by":"crossref","unstructured":"Ma, S., Huang, T., Wang, A., Wang, X.: Accelerating BGV bootstrapping for large $$p$$ using null polynomials over $$\\mathbb{Z}_{p^e}$$. Cryptology ePrint Archive, Paper 2024\/115 (2024)","DOI":"10.1007\/978-3-031-58723-8_14"},{"issue":"10","key":"17_CR44","doi-asserted-by":"publisher","first-page":"1572","DOI":"10.1109\/JPROC.2022.3205665","volume":"110","author":"C Marcolla","year":"2022","unstructured":"Marcolla, C., Sucasas, V., Manzano, M., Bassoli, R., Fitzek, F.H., Aaraj, N.: Survey on fully homomorphic encryption, theory, and applications. Proc. IEEE 110(10), 1572\u20131609 (2022)","journal-title":"Proc. IEEE"},{"issue":"6","key":"17_CR45","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3124441","volume":"50","author":"P Martins","year":"2017","unstructured":"Martins, P., Sousa, L., Mariano, A.: A survey on fully homomorphic encryption: an engineering perspective. ACM Comput. Surv. (CSUR) 50(6), 1\u201333 (2017)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"17_CR46","unstructured":"MATZOV: Report on the security of LWE: improved dual lattice attack, April 2022. https:\/\/zenodo.org\/records\/6412487"},{"key":"17_CR47","doi-asserted-by":"publisher","unstructured":"Mono, J., Marcolla, C., Land, G., G\u00fcneysu, T., Aaraj, N.: Finding and evaluating parameters for BGV. In: El Mrabet, N., De Feo, L., Duquesne, S. (eds.) Progress in Cryptology - AFRICACRYPT 2023. AFRICACRYPT 2023. LNCS, vol. 14064, pp. 370\u2013394. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-37679-5_16","DOI":"10.1007\/978-3-031-37679-5_16"},{"key":"17_CR48","unstructured":"Paillier, P.: Invited talk: recent advances in homomorphic compilation. https:\/\/youtu.be\/phWYLwlPTY0?si=gwcf8svL6tOYcizv"},{"key":"17_CR49","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, pp. 84\u201393 (2005)","DOI":"10.1145\/1060590.1060603"},{"issue":"2","key":"17_CR50","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0304-3975(87)90064-8","volume":"53","author":"CP Schnorr","year":"1987","unstructured":"Schnorr, C.P.: A hierarchy of polynomial time lattice basis reduction algorithms. Theoret. Comput. Sci. 53(2), 201\u2013224 (1987)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR51","doi-asserted-by":"crossref","unstructured":"Schnorr, C.P.: Lattice reduction by random sampling and birthday methods. In: Alt, H., Habib, M. (eds.) STACS 2003, pp. 145\u2013156 (2003)","DOI":"10.1007\/3-540-36494-3_14"},{"issue":"1\u20133","key":"17_CR52","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01581144","volume":"66","author":"CP Schnorr","year":"1994","unstructured":"Schnorr, C.P., Euchner, M.: Lattice basis reduction: improved practical algorithms and solving subset sum problems. Math. Program. 66(1\u20133), 181\u2013199 (1994)","journal-title":"Math. Program."},{"key":"17_CR53","unstructured":"Microsoft SEAL (release 3.4). https:\/\/github.com\/Microsoft\/SEAL, October 2019, microsoft Research, Redmond, WA"},{"key":"17_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/978-3-642-10366-7_36","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"D Stehl\u00e9","year":"2009","unstructured":"Stehl\u00e9, D., Steinfeld, R., Tanaka, K., Xagawa, K.: Efficient public key encryption based on ideal lattices. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 617\u2013635. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10366-7_36"},{"key":"17_CR55","doi-asserted-by":"crossref","unstructured":"Viand, A., Jattke, P., Hithnawi, A.: SoK: fully homomorphic encryption compilers. In: 2021 IEEE Symposium on Security and Privacy (SP), pp. 1092\u20131108. IEEE Computer Society (2021)","DOI":"10.1109\/SP40001.2021.00068"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology - AFRICACRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-64381-1_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T23:03:57Z","timestamp":1719961437000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-64381-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031643804","9783031643811"],"references-count":55,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-64381-1_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"3 July 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AFRICACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in Africa","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Douala","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cameroon","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 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"africacrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}