{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T22:33:52Z","timestamp":1775774032355,"version":"3.50.1"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031627453","type":"print"},{"value":"9783031627460","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-62746-0_2","type":"book-chapter","created":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T09:02:26Z","timestamp":1718010146000},"page":"20-53","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Updatable Encryption from\u00a0Group Actions"],"prefix":"10.1007","author":[{"given":"Antonin","family":"Leroux","sequence":"first","affiliation":[]},{"given":"Maxime","family":"Rom\u00e9as","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,6,11]]},"reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1007\/978-3-031-15979-4_24","volume-title":"Advances in Cryptology - CRYPTO 2022","author":"M Abdalla","year":"2022","unstructured":"Abdalla, M., Eisenhofer, T., Kiltz, E., Kunzweiler, S., Riepel, D.: Password-authenticated key exchange from group actions. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022, Part II. LNCS, vol. 13508, pp. 699\u2013728. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_24"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/978-3-030-64834-3_14","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"N Alamati","year":"2020","unstructured":"Alamati, N., De Feo, L., Montgomery, H., Patranabis, S.: Cryptographic group actions and applications. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020, Part II. LNCS, vol. 12492, pp. 411\u2013439. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_14"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Azarderakhsh, R., Jao, D., Kalach, K., Koziel, B., Leonardi, C.: Key compression for isogeny-based cryptosystems. In: Proceedings of the 3rd ACM International Workshop on ASIA Public-Key Cryptography. ACM (2016)","DOI":"10.1145\/2898420.2898421"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Basso, A.: A post-quantum round-optimal oblivious PRF from isogenies. Cryptology ePrint Archive (2023)","DOI":"10.1007\/978-3-031-53368-6_8"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-3-030-34578-5_9","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"W Beullens","year":"2019","unstructured":"Beullens, W., Kleinjung, T., Vercauteren, F.: CSI-FiSh: efficient isogeny based signatures through class group computations. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11921, pp. 227\u2013247. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34578-5_9"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/978-3-642-40041-4_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"D Boneh","year":"2013","unstructured":"Boneh, D., Lewi, K., Montgomery, H., Raghunathan, A.: Key homomorphic PRFs and their applications. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 410\u2013428. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_23"},{"key":"2_CR7","unstructured":"Booher, J., et\u00a0al.: Failing to hash into supersingular isogeny graphs. arXiv preprint arXiv:2205.00135 (2022)"},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/978-3-030-56784-2_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"C Boyd","year":"2020","unstructured":"Boyd, C., Davies, G.T., Gj\u00f8steen, K., Jiang, Y.: Fast and secure updatable encryption. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020, Part I. LNCS, vol. 12170, pp. 464\u2013493. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56784-2_16"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1007\/978-3-031-38548-3_25","volume-title":"Advances in Cryptology - CRYPTO 2023","author":"W Castryck","year":"2023","unstructured":"Castryck, W., Houben, M., Merz, S.P., Mula, M., Buuren, S.V., Vercauteren, F.: Weak instances of class group action based cryptography via self-pairings. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023. LNCS, vol. 14083, pp. 762\u2013792. Springer, Cham (2023)"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-030-03332-3_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"W Castryck","year":"2018","unstructured":"Castryck, W., Lange, T., Martindale, C., Panny, L., Renes, J.: CSIDH: an efficient post-quantum commutative group action. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11274, pp. 395\u2013427. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03332-3_15"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-030-56880-1_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"W Castryck","year":"2020","unstructured":"Castryck, W., Sot\u00e1kov\u00e1, J., Vercauteren, F.: Breaking the decisional Diffie-Hellman problem for class group actions using genus theory. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12171, pp. 92\u2013120. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_4"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Chen, M., Leroux, A.: Scallop-HD: group action from 2-dimensional isogenies., Cryptology ePrint Archive (2023)","DOI":"10.1007\/978-3-031-57725-3_7"},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1515\/jmc-2019-0034","volume":"14","author":"L Col\u00f2","year":"2020","unstructured":"Col\u00f2, L., Kohel, D.: Orienting supersingular isogeny graphs. J. Math. Cryptol. 14, 414\u2013437 (2020)","journal-title":"J. Math. Cryptol."},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-85174-5_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"J-S Coron","year":"2008","unstructured":"Coron, J.-S., Patarin, J., Seurin, Y.: The random oracle model and the ideal cipher model are equivalent. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 1\u201320. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_1"},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/978-3-319-56620-7_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"C Costello","year":"2017","unstructured":"Costello, C., Jao, D., Longa, P., Naehrig, M., Renes, J., Urbanik, D.: Efficient compression of SIDH public keys. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10210, pp. 679\u2013706. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56620-7_24"},{"issue":"1","key":"2_CR16","first-page":"39","volume":"4","author":"DJ Bernstein","year":"2020","unstructured":"Bernstein, D.J., De Feo, L., Leroux, A., Smith, B.: Faster computation of isogenies of large prime degree. ANTS XIV 4(1), 39\u201355 (2020)","journal-title":"ANTS XIV"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-030-92068-5_9","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"L De Feo","year":"2021","unstructured":"De Feo, L., et al.: S\u00e9ta: supersingular encryption from\u00a0torsion attacks. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13093, pp. 249\u2013278. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92068-5_9"},{"issue":"1","key":"2_CR18","doi-asserted-by":"publisher","first-page":"251","DOI":"10.2140\/obs.2020.4.251","volume":"4","author":"T Espitau","year":"2020","unstructured":"Espitau, T., Kirchner, P.: The nearest-colattice algorithm: time-approximation tradeoff for approx-CVP. Open Book Series 4(1), 251\u2013266 (2020)","journal-title":"Open Book Series"},{"key":"2_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-031-31368-4_13","volume-title":"Public-Key Cryptography - PKC 2023","author":"LD Feo","year":"2023","unstructured":"Feo, L.D., et al.: SCALLOP: scaling the CSI-FiSh. In: Boldyreva, A., Kolesnikov, V. (eds.) PKC 2023. LNCS, vol. 13940, pp. 345\u2013375. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-31368-4_13"},{"key":"2_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-031-30589-4_10","volume-title":"Advances in Cryptology - EUROCRYPT 2023","author":"TB Fouotsa","year":"2023","unstructured":"Fouotsa, T.B., Moriya, T., Petit, C.: M-SIDH and MD-SIDH: countering SIDH attacks by masking information. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023. LNCS, vol. 14008, pp. 282\u2013309. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_10"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Holenstein, T., K\u00fcnzler, R., Tessaro, S.: The equivalence of the random oracle model and the ideal cipher model, revisited. In: Proceedings of the Forty-Third Annual ACM Symposium on Theory of Computing, STOC 2011, pp.\u00a089-98. Association for Computing Machinery, New York (2011)","DOI":"10.1145\/1993636.1993650"},{"key":"2_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-030-36030-6_11","volume-title":"Theory of Cryptography","author":"Z Ji","year":"2019","unstructured":"Ji, Z., Qiao, Y., Song, F., Yun, A.: General linear group action on tensors: a candidate for post-quantum cryptography. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019. LNCS, vol. 11891, pp. 251\u2013281. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36030-6_11"},{"key":"2_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/978-3-030-64840-4_18","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"Y Jiang","year":"2020","unstructured":"Jiang, Y.: The direction of updatable encryption does not matter much. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12493, pp. 529\u2013558. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64840-4_18"},{"key":"2_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-030-17653-2_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"M Kloo\u00df","year":"2019","unstructured":"Kloo\u00df, M., Lehmann, A., Rupp, A.: (R)CCA secure updatable encryption with integrity protection. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11476, pp. 68\u201399. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_3"},{"key":"2_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1007\/978-3-319-78372-7_22","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"A Lehmann","year":"2018","unstructured":"Lehmann, A., Tackmann, B.: Updatable encryption with\u00a0post-compromise security. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10822, pp. 685\u2013716. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78372-7_22"},{"key":"2_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/978-3-031-30589-4_16","volume-title":"Advances in Cryptology - EUROCRYPT 2023","author":"L Maino","year":"2023","unstructured":"Maino, L., Martindale, C., Panny, L., Pope, G., Wesolowski, B.: A direct key recovery attack on SIDH. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023. LNCS, vol. 14008, pp. 448\u2013471. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_16"},{"key":"2_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-031-31371-4_13","volume-title":"Public-Key Cryptography - PKC 2023","author":"P Miao","year":"2023","unstructured":"Miao, P., Patranabis, S., Watson, G.: Unidirectional updatable encryption and proxy re-encryption from DDH. In: Boldyreva, A., Kolesnikov, V. (eds.) PKC 2023. LNCS, vol. 13941, pp. 368\u2013398. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-31371-4_13"},{"key":"2_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/978-3-030-64834-3_19","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"T Moriya","year":"2020","unstructured":"Moriya, T., Onuki, H., Takagi, T.: SiGamal: a supersingular isogeny-based PKE and its application to a PRF. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12492, pp. 551\u2013580. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_19"},{"key":"2_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-030-34621-8_9","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"M Naehrig","year":"2019","unstructured":"Naehrig, M., Renes, J.: Dual isogenies and their application to public-key compression for isogeny-based cryptography. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11922, pp. 243\u2013272. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34621-8_9"},{"key":"2_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-030-97131-1_7","volume-title":"Public-Key Cryptography - PKC 2022","author":"R Nishimaki","year":"2022","unstructured":"Nishimaki, R.: The direction of updatable encryption does matter. In: Hanaoka, G., Shikata, J., Watanabe, Y. (eds.) PKC 2022, Part II. LNCS, vol. 13178, pp. 194\u2013224. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-97131-1_7"},{"key":"2_CR31","doi-asserted-by":"publisher","first-page":"101777","DOI":"10.1016\/j.ffa.2020.101777","volume":"69","author":"H Onuki","year":"2021","unstructured":"Onuki, H.: On oriented supersingular elliptic curves. Finite Fields Appl. 69, 101777 (2021)","journal-title":"Finite Fields Appl."},{"key":"2_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13389-020-00245-4","volume":"11","author":"G Pereira","year":"2021","unstructured":"Pereira, G., Doliskani, J., Jao, D.: X-only point addition formula and faster compressed SIKE. J. Cryptogr. Eng. 11, 1\u201313 (2021)","journal-title":"J. Cryptogr. Eng."},{"key":"2_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1007\/978-3-031-30589-4_17","volume-title":"Advances in Cryptology - EUROCRYPT 2023","author":"D Robert","year":"2023","unstructured":"Robert, D.: Breaking SIDH in polynomial time. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023. LNCS, vol. 14008, pp. 472\u2013503. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_17"},{"issue":"4","key":"2_CR34","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","volume":"28","author":"CE Shannon","year":"1949","unstructured":"Shannon, C.E.: Communication theory of secrecy systems. Bell Syst. Tech. J. 28(4), 656\u2013715 (1949)","journal-title":"Bell Syst. Tech. J."},{"key":"2_CR35","doi-asserted-by":"crossref","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings 35th Annual Symposium on Foundations of Computer Science, pp.\u00a0124\u2013134 (1994)","DOI":"10.1109\/SFCS.1994.365700"},{"key":"2_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1007\/978-3-031-07082-2_21","volume-title":"Advances in Cryptology - EUROCRYPT 2022","author":"G Tang","year":"2022","unstructured":"Tang, G., Duong, D.H., Joux, A., Plantard, T., Qiao, Y., Susilo, W.: Practical post-quantum signature schemes from isomorphism problems of trilinear forms. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022. LNCS, vol. 13277, pp. 582\u2013612. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07082-2_21"},{"key":"2_CR37","first-page":"238","volume":"273","author":"J V\u00e9lu","year":"1971","unstructured":"V\u00e9lu, J.: Isog\u00e9nies entre courbes elliptiques. Compt.-Rendus l\u2019Acad. Sci. S\u00e9rie I 273, 238\u2013241 (1971)","journal-title":"Compt.-Rendus l\u2019Acad. Sci. S\u00e9rie I"},{"key":"2_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-031-07082-2_13","volume-title":"Advances in Cryptology - EUROCRYPT 2022","author":"B Wesolowski","year":"2022","unstructured":"Wesolowski, B.: Orientations and the supersingular endomorphism ring problem. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022. LNCS, vol. 13277, pp. 345\u2013371. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07082-2_13"},{"key":"2_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-319-79063-3_12","volume-title":"Post-Quantum Cryptography","author":"GHM Zanon","year":"2018","unstructured":"Zanon, G.H.M., Simplicio, M.A., Pereira, G.C.C.F., Doliskani, J., Barreto, P.S.L.M.: Faster isogeny-based compressed key agreement. In: Lange, T., Steinwandt, R. (eds.) PQCrypto 2018. LNCS, vol. 10786, pp. 248\u2013268. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-79063-3_12"}],"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-62746-0_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,21]],"date-time":"2024-11-21T13:17:22Z","timestamp":1732195042000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-62746-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031627453","9783031627460"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-62746-0_2","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"}}]}}