{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T01:56:36Z","timestamp":1783562196187,"version":"3.55.0"},"publisher-location":"Cham","reference-count":49,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031627422","type":"print"},{"value":"9783031627439","type":"electronic"}],"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-62743-9_9","type":"book-chapter","created":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T23:02:58Z","timestamp":1718060578000},"page":"265-299","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Phoenix: Hash-and-Sign with\u00a0Aborts from\u00a0Lattice Gadgets"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2869-3833","authenticated-orcid":false,"given":"Corentin","family":"Jeudy","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0617-9606","authenticated-orcid":false,"given":"Adeline","family":"Roux-Langlois","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1283-7257","authenticated-orcid":false,"given":"Olivier","family":"Sanders","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,6,11]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","unstructured":"Agrawal, S., Kirshanova, E., Stehl\u00e9, D., Yadav, A.: Practical. Round-Optimal Lattice-Based Blind Signatures. In: CCS (2022). https:\/\/doi.org\/10.1145\/3548606.3560650","DOI":"10.1145\/3548606.3560650"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Albrecht, M.R., Player, R., Scott, S.: On the concrete hardness of learning with errors. J. Math, Cryptol. 9(3), 169\u2013203 (2015)","DOI":"10.1515\/jmc-2015-0016"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/978-3-030-57808-4_22","volume-title":"Applied Cryptography and Network Security","author":"E Alkim","year":"2020","unstructured":"Alkim, E., Barreto, P.S.L.M., Bindel, N., Kr\u00e4mer, J., Longa, P., Ricardini, J.E.: The lattice-based digital signature scheme qTESLA. In: Conti, M., Zhou, J., Casalicchio, E., Spognardi, A. (eds.) ACNS 2020. LNCS, vol. 12146, pp. 441\u2013460. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-57808-4_22"},{"key":"9_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/BF01445125","volume-title":"New Bounds in Some Transference Theorems in the Geometry of Numbers","author":"W Banaszczyk","year":"1993","unstructured":"Banaszczyk, W.: New Bounds in Some Transference Theorems in the Geometry of Numbers. Math, Ann (1993)"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-030-81293-5_11","volume-title":"Post-Quantum Cryptography","author":"P Bert","year":"2021","unstructured":"Bert, P., Eberhart, G., Prabel, L., Roux-Langlois, A., Sabt, M.: Implementation of lattice trapdoors on modules and applications. In: Cheon, J.H., Tillich, J.-P. (eds.) PQCrypto 2021 2021. LNCS, vol. 12841, pp. 195\u2013214. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81293-5_11"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-319-79063-3_13","volume-title":"Post-Quantum Cryptography","author":"P Bert","year":"2018","unstructured":"Bert, P., Fouque, P.-A., Roux-Langlois, A., Sabt, M.: Practical implementation of\u00a0ring-SIS\/LWE based signature and\u00a0IBE. In: Lange, T., Steinwandt, R. (eds.) PQCrypto 2018. LNCS, vol. 10786, pp. 271\u2013291. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-79063-3_13"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Beullens, W., Lyubashevsky, V., Nguyen, N.K., Seiler, G.: Lattice-based blind signatures: short, efficient, and round-optimal. IACR Cryptol. ePrint Arch. p.\u00a077 (2023)","DOI":"10.1145\/3576915.3616613"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-642-25385-0_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"D Boneh","year":"2011","unstructured":"Boneh, D., Dagdelen, \u00d6., Fischlin, M., Lehmann, A., Schaffner, C., Zhandry, M.: Random oracles in a quantum world. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 41\u201369. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_3"},{"key":"9_CR9","doi-asserted-by":"publisher","unstructured":"Bos, J.W., et al.: CRYSTALS - Kyber: a CCA-secure module-lattice-based KEM. In: EuroS &P (2018). https:\/\/doi.org\/10.1109\/EuroSP.2018.00032","DOI":"10.1109\/EuroSP.2018.00032"},{"key":"9_CR10","unstructured":"Chen, Y.: R\u00e9duction de R\u00e9seau et S\u00e9curit\u00e9 Concr\u00e8te du Chiffrement Compl\u00e8tement Homomorphe. Ph.D. thesis, Paris 7 (2013)"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-34618-8_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"Y Chen","year":"2019","unstructured":"Chen, Y., Genise, N., Mukherjee, P.: Approximate trapdoors for lattices and\u00a0smaller hash-and-sign signatures. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11923, pp. 3\u201332. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34618-8_1"},{"key":"9_CR12","unstructured":"Cheon, J.H., et al.: HAETAE: Shorter lattice-based fiat-shamir signatures. IACR Cryptol. ePrint Arch. p.\u00a0624 (2023)"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-030-92548-2_14","volume-title":"Cryptology and Network Security","author":"A Le D\u00e9v\u00e9hat","year":"2021","unstructured":"Le D\u00e9v\u00e9hat, A., Shizuya, H., Hasegawa, S.: On the\u00a0higher-bit version of\u00a0approximate inhomogeneous short integer solution problem. In: Conti, M., Stevens, M., Krenn, S. (eds.) CANS 2021. LNCS, vol. 13099, pp. 253\u2013272. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92548-2_14"},{"key":"9_CR14","doi-asserted-by":"publisher","unstructured":"Devevey, J., Fawzi, O., Passel\u00e8gue, A., Stehl\u00e9, D.: On rejection sampling in lyubashevsky\u2019s signature scheme. In: ASIACRYPT (2022). https:\/\/doi.org\/10.1007\/978-3-031-22972-5_2","DOI":"10.1007\/978-3-031-22972-5_2"},{"key":"9_CR15","doi-asserted-by":"publisher","unstructured":"Devevey, J., Passel\u00e8gue, A., Stehl\u00e9, D.: G+G: A fiat-shamir lattice signature based on convolved gaussians. In: ASIACRYPT (2023). https:\/\/doi.org\/10.1007\/978-981-99-8739-9_2","DOI":"10.1007\/978-981-99-8739-9_2"},{"key":"9_CR16","doi-asserted-by":"publisher","unstructured":"Ducas, L., Espitau, T., Postlethwaite, E.W.: Finding short integer solutions when the modulus is small. In: CRYPTO (2023). https:\/\/doi.org\/10.1007\/978-3-031-38548-3_6","DOI":"10.1007\/978-3-031-38548-3_6"},{"key":"9_CR17","doi-asserted-by":"publisher","unstructured":"Ducas, L., et al.: CRYSTALS-dilithium: a lattice-based digital signature scheme. IACR Trans. Cryptographic Hardware Embed. Syst. 2018, 238\u2013268 (2018). https:\/\/doi.org\/10.13154\/tches.v2018.i1.238-268","DOI":"10.13154\/tches.v2018.i1.238-268"},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/978-3-662-45608-8_2","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"L Ducas","year":"2014","unstructured":"Ducas, L., Lyubashevsky, V., Prest, T.: Efficient identity-based encryption over NTRU lattices. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8874, pp. 22\u201341. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45608-8_2"},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-662-44371-2_19","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"L Ducas","year":"2014","unstructured":"Ducas, L., Micciancio, D.: Improved short lattice signatures in the standard model. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8616, pp. 335\u2013352. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44371-2_19"},{"key":"9_CR20","doi-asserted-by":"publisher","unstructured":"Espitau, T., et al: A simpler, parallelizable. maskable variant of falcon. In: EUROCRYPT (2022). https:\/\/doi.org\/10.1007\/978-3-031-07082-2_9","DOI":"10.1007\/978-3-031-07082-2_9"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"Espitau, T., Kirchner, P.: The nearest-colattice algorithm: time-approxmation tradeoff for approx-CVP. In: ANTS XIV (2020)","DOI":"10.2140\/obs.2020.4.251"},{"key":"9_CR22","doi-asserted-by":"publisher","unstructured":"Espitau, T., Tibouchi, M., Wallet, A., Yu, Y.: Shorter hash-and-sign lattice-based signatures. In: CRYPTO (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_9","DOI":"10.1007\/978-3-031-15979-4_9"},{"key":"9_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-319-78381-9_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"N Genise","year":"2018","unstructured":"Genise, N., Micciancio, D.: Faster gaussian sampling for trapdoor lattices with arbitrary modulus. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10820, pp. 174\u2013203. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_7"},{"key":"9_CR24","doi-asserted-by":"publisher","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: STOC (2008). https:\/\/doi.org\/10.1145\/1374376.1374407","DOI":"10.1145\/1374376.1374407"},{"key":"9_CR25","doi-asserted-by":"crossref","unstructured":"Jackson, K., Miller, C., Wang, D.: Evaluating the security of CRYSTALS-dilithium in the quantum random oracle model. IACR Cryptol. ePrint Arch, pp.\u00a01968 (2023)","DOI":"10.1007\/978-3-031-58751-1_15"},{"key":"9_CR26","doi-asserted-by":"publisher","unstructured":"Jeudy, C., Roux-Langlois, A., Sanders, O.: Lattice signature with efficient protocols. application to anonymous credentials. In: CRYPTO (2023). https:\/\/doi.org\/10.1007\/978-3-031-38545-2_12","DOI":"10.1007\/978-3-031-38545-2_12"},{"key":"9_CR27","doi-asserted-by":"crossref","unstructured":"Jeudy, C., Roux-Langlois, A., Sanders, O.: Phoenix: hash-and-sign with aborts from lattice gadgets. IACR Cryptol. ePrint Arch, pp.\u00a0446 (2023)","DOI":"10.1007\/978-3-031-62743-9_9"},{"key":"9_CR28","doi-asserted-by":"publisher","unstructured":"Kiltz, E., Lyubashevsky, V., Schaffner, C.: A concrete treatment of fiat-shamir signatures in the quantum random-oracle mode. In: EUROCRYPT (2018). https:\/\/doi.org\/10.1007\/978-3-319-78372-7_18","DOI":"10.1007\/978-3-319-78372-7_18"},{"issue":"3","key":"9_CR29","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s10623-014-9938-4","volume":"75","author":"A Langlois","year":"2014","unstructured":"Langlois, A., Stehl\u00e9, D.: Worst-case to average-case reductions for module lattices. Des. Codes Crypt. 75(3), 565\u2013599 (2014). https:\/\/doi.org\/10.1007\/s10623-014-9938-4","journal-title":"Des. Codes Crypt."},{"key":"9_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/978-3-662-53890-6_13","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"B Libert","year":"2016","unstructured":"Libert, B., Ling, S., Mouhartem, F., Nguyen, K., Wang, H.: Signature schemes with efficient protocols and dynamic group signatures from lattice assumptions. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10032, pp. 373\u2013403. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53890-6_13"},{"key":"9_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1007\/978-3-642-29011-4_43","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"V Lyubashevsky","year":"2012","unstructured":"Lyubashevsky, V.: Lattice signatures without trapdoors. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 738\u2013755. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_43"},{"key":"9_CR32","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V., Nguyen, N.K., Plan\u00e7on, M.: Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general. In: CRYPTO (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_3","DOI":"10.1007\/978-3-031-15979-4_3"},{"key":"9_CR33","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V., Nguyen, N.K., Plan\u00e7on, M., Seiler, G.: Shorter Lattice-Based Group Signatures via \u201cAlmost Free\u201d Encryption and Other Optimizations. In: ASIACRYPT (2021). https:\/\/doi.org\/10.1007\/978-3-030-92068-5_8","DOI":"10.1007\/978-3-030-92068-5_8"},{"key":"9_CR34","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V., Wichs, D.: Simple lattice trapdoor sampling from a broad class of distributions. In: PKC (2015). https:\/\/doi.org\/10.1007\/978-3-662-46447-2_32","DOI":"10.1007\/978-3-662-46447-2_32"},{"key":"9_CR35","doi-asserted-by":"publisher","unstructured":"Micciancio, D., Peikert, C.: Trapdoors for lattices: simpler, tighter, faster. smaller. In: EUROCRYPT (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_41","DOI":"10.1007\/978-3-642-29011-4_41"},{"key":"9_CR36","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447360","author":"D Micciancio","year":"2007","unstructured":"Micciancio, D., Regev, O.: Worst-case to average-case reductions based on gaussian measures. SIAM J. Comput. (2007). https:\/\/doi.org\/10.1137\/S0097539705447360","journal-title":"SIAM J. Comput."},{"key":"9_CR37","doi-asserted-by":"publisher","unstructured":"Micciancio, D., Walter, M.: Practical, predictable lattice basis reduction. In: EUROCRYPT (2016). https:\/\/doi.org\/10.1007\/978-3-662-49890-3_31","DOI":"10.1007\/978-3-662-49890-3_31"},{"key":"9_CR38","unstructured":"NIST: Post-Quantum Cryptography Standardization. https:\/\/csrc.nist.gov\/Projects\/Post-Quantum-Cryptography\/Post-Quantum-Cryptography-Standardization"},{"key":"9_CR39","unstructured":"NIST: Post-quantum cryptography: standardization of additional digital signature schemes. https:\/\/csrc.nist.gov\/Projects\/pqc-dig-sig\/standardization"},{"key":"9_CR40","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-008-0251-3","author":"C Peikert","year":"2008","unstructured":"Peikert, C.: Limits on the hardness of lattice problems in l$${}_{\\text{ p }}$$ norms. Comput. Complex. (2008). https:\/\/doi.org\/10.1007\/s00037-008-0251-3","journal-title":"Comput. Complex."},{"key":"9_CR41","doi-asserted-by":"publisher","unstructured":"Peikert, C.: An efficient and parallel gaussian sampler for lattices. In: CRYPTO (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_5","DOI":"10.1007\/978-3-642-14623-7_5"},{"key":"9_CR42","unstructured":"del Pino, R., et al.: Raccoon: a side-channel secure signature scheme. https:\/\/github.com\/masksign\/raccoon\/blob\/main\/doc\/raccoon.pdf"},{"key":"9_CR43","doi-asserted-by":"publisher","unstructured":"del Pino, R., Katsumata, S.: A new framework for more efficient round-optimal lattice-based (partially) blind signature via trapdoor sampling. In: CRYPTO (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_11","DOI":"10.1007\/978-3-031-15979-4_11"},{"key":"9_CR44","doi-asserted-by":"publisher","unstructured":"del Pino, R., Lyubashevsky, V., Seiler, G.: Lattice-based group signatures and zero-knowledge proofs of automorphism stability. In: CCS (2018). https:\/\/doi.org\/10.1145\/3243734.3243852","DOI":"10.1145\/3243734.3243852"},{"key":"9_CR45","doi-asserted-by":"publisher","unstructured":"Prest, T.: Sharper bounds in lattice-based cryptography using the R\u00e9nyi divergence. In: ASIACRYPT (2017). https:\/\/doi.org\/10.1007\/978-3-319-70694-8_13","DOI":"10.1007\/978-3-319-70694-8_13"},{"key":"9_CR46","unstructured":"Prest, T., et al.: FALCON. Tech. rep. (2020). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/selected-algorithms-2022"},{"key":"9_CR47","doi-asserted-by":"publisher","unstructured":"Vershynin, R.: Introduction to the non-asymptotic analysis of random matrices. In: Compressed Sensing (2012). https:\/\/doi.org\/10.1017\/cbo9780511794308.006","DOI":"10.1017\/cbo9780511794308.006"},{"key":"9_CR48","doi-asserted-by":"publisher","unstructured":"Yu, Y., Jia, H., Wang, X.: Compact lattice gadget and its applications to hash-and-sign signatures. In: CRYPTO (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_13","DOI":"10.1007\/978-3-031-38554-4_13"},{"key":"9_CR49","doi-asserted-by":"publisher","unstructured":"Zhang, S., Yu, Y.: Towards a simpler lattice gadget toolkit. In: PKC (2022). https:\/\/doi.org\/10.1007\/978-3-030-97121-2_18","DOI":"10.1007\/978-3-030-97121-2_18"}],"container-title":["Lecture Notes in Computer Science","Post-Quantum Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-62743-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,21]],"date-time":"2024-11-21T14:53:46Z","timestamp":1732200826000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-62743-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031627422","9783031627439"],"references-count":49,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-62743-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"11 June 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PQCrypto","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Post-Quantum Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Oxford","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","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":"12 June 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 June 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pqcrypto2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.maths.ox.ac.uk\/events\/conferences\/pqcrypto-2024","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}