{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T20:00:50Z","timestamp":1767988850010,"version":"3.49.0"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031865985","type":"print"},{"value":"9783031865992","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-031-86599-2_5","type":"book-chapter","created":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T18:55:07Z","timestamp":1742842507000},"page":"129-161","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Enhancing Threshold Group Action Signature Schemes: Adaptive Security and\u00a0Scalability Improvements"],"prefix":"10.1007","author":[{"given":"Michele","family":"Battagliola","sequence":"first","affiliation":[]},{"given":"Giacomo","family":"Borin","sequence":"additional","affiliation":[]},{"given":"Giovanni","family":"Di Crescenzo","sequence":"additional","affiliation":[]},{"given":"Alessio","family":"Meneghetti","sequence":"additional","affiliation":[]},{"given":"Edoardo","family":"Persichetti","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,3,15]]},"reference":[{"key":"5_CR1","unstructured":"Baccarini, A., Blanton, M., Yuan, C.: Multi-party replicated secret sharing over a ring with applications to privacy-preserving machine learning. Cryptology ePrint Archive (2020)"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Bacho, R., Loss, J., Stern, G., Wagner, B.: HARTS: High-threshold, adaptively secure, and robust threshold Schnorr signatures. Cryptology ePrint Archive, Paper 2024\/280 (2024). https:\/\/eprint.iacr.org\/2024\/280","DOI":"10.1007\/978-981-96-0891-1_4"},{"key":"5_CR3","doi-asserted-by":"publisher","unstructured":"Bacho, R., Loss, J., Tessaro, S., Wagner, B., Zhu, C.: Twinkle: threshold signatures from DDH with full adaptive security. In: Joye, M., Leander, G. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2024. LNCS, vol. 14651, pp. 429\u2013459. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58716-0_15","DOI":"10.1007\/978-3-031-58716-0_15"},{"key":"5_CR4","doi-asserted-by":"publisher","unstructured":"Bardet, M., Otmani, A., Saeed-Taha, M.: Permutation code equivalence is not harder than graph isomorphism when hulls are trivial. In: IEEE International Symposium on Information Theory (ISIT), pp. 2464\u20132468. IEEE Press (2019). https:\/\/doi.org\/10.1109\/ISIT.2019.8849855","DOI":"10.1109\/ISIT.2019.8849855"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-030-81293-5_2","volume-title":"Post-Quantum Cryptography","author":"A Barenghi","year":"2021","unstructured":"Barenghi, A., Biasse, J.-F., Persichetti, E., Santini, P.: LESS-FM: fine-tuning signatures from the code equivalence problem. In: Cheon, J.H., Tillich, J.-P. (eds.) PQCrypto 2021 2021. LNCS, vol. 12841, pp. 23\u201343. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81293-5_2"},{"key":"5_CR6","doi-asserted-by":"publisher","unstructured":"Battagliola, M., Borin, G., Meneghetti, A., Persichetti, E.: Cutting the grass: threshold group action signature schemes. In: Topics in Cryptology - CT-RSA 2024: Cryptographers\u2019 Track at the RSA Conference 2024, San Francisco, CA, USA, May 6-9, 2024, Proceedings, pp. 460\u2013489. Springer-Verlag, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-3-031-58868-6_18. ISBN 978-3-031-58867-9","DOI":"10.1007\/978-3-031-58868-6_18"},{"key":"5_CR7","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":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-030-81293-5_14","volume-title":"Post-Quantum Cryptography","author":"W Beullens","year":"2021","unstructured":"Beullens, W., Disson, L., Pedersen, R., Vercauteren, F.: CSI-RAShi: distributed key generation for CSIDH. In: Cheon, J.H., Tillich, J.-P. (eds.) PQCrypto 2021 2021. LNCS, vol. 12841, pp. 257\u2013276. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81293-5_14"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-030-51938-4_3","volume-title":"Progress in Cryptology - AFRICACRYPT 2020","author":"J-F Biasse","year":"2020","unstructured":"Biasse, J.-F., Micheli, G., Persichetti, E., Santini, P.: LESS is more: code-based signatures without syndromes. In: Nitaj, A., Youssef, A. (eds.) AFRICACRYPT 2020. LNCS, vol. 12174, pp. 45\u201365. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51938-4_3"},{"key":"5_CR10","doi-asserted-by":"publisher","unstructured":"Biasse, J.-F., Micheli, G.: A search-to-decision reduction for the permutation code equivalence problem. In: 2023 IEEE International Symposium on Information Theory (ISIT), pp. 602\u2013607 (2023).https:\/\/doi.org\/10.1109\/ISIT54713.2023.10206940","DOI":"10.1109\/ISIT54713.2023.10206940"},{"key":"5_CR11","unstructured":"Bl\u00e4ser, M., et al.: The Alteq signature scheme: Algorithm specifications and supporting documentation (2023). https:\/\/pqcalteq.github.io\/ALTEQ_spec_2023.09.18.pdf"},{"key":"5_CR12","doi-asserted-by":"publisher","unstructured":"Boneh, D., Guan, J., Zhandry, M.: A lower bound on the length of signatures based on group actions and generic isogenies. In: Hazay, C., Stam, M. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2023. LNCS, vol. 14008, pp. 507\u2013531. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_18","DOI":"10.1007\/978-3-031-30589-4_18"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"2702","DOI":"10.1093\/comjnl\/bxae038","volume":"67","author":"J Booher","year":"2024","unstructured":"Booher, J., et al.: Failing to hash into supersingular isogeny graphs. Comput. J. 67, 2702\u20132719 (2024)","journal-title":"Comput. J."},{"key":"5_CR14","unstructured":"Borin, G., Persichetti, E., Santini, P., Pintore, F., Reijnders, K.: A Guide to the Design of Digital Signatures Based on Cryptographic Group Actions (2023)"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Brandao, L., Peralta, R.: NIST first call for multi-party threshold schemes (2023)","DOI":"10.6028\/NIST.IR.8214C.ipd"},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/10718964_37","volume-title":"Information Security and Privacy","author":"E Brickell","year":"2000","unstructured":"Brickell, E., Di Crescenzo, G., Frankel, Y.: Sharing block ciphers. In: Dawson, E.P., Clark, A., Boyd, C. (eds.) ACISP 2000. LNCS, vol. 1841, pp. 457\u2013470. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10718964_37"},{"key":"5_CR17","doi-asserted-by":"publisher","unstructured":"Budroni, A., Chi-Dom\u00ednguez, J.J., D\u2019Alconzo, G., Di Scala, A.J., Kulkarni, M.: Don\u2019t use it twice! Solving relaxed linear equivalence problems. In: Chung, KM., Sasaki, Y. (eds) Advances in Cryptology. ASIACRYPT 2024. LNCS, vol. 15491, pp. 35\u201365. Springer, Singapore (2025). https:\/\/doi.org\/10.1007\/978-981-96-0944-4_2","DOI":"10.1007\/978-981-96-0944-4_2"},{"key":"5_CR18","doi-asserted-by":"publisher","unstructured":"Campos, F., Muth, P.: On actively secure fine-grained access structures from isogeny assumptions. In: Cheon, J.H., Johansson, T. (eds.) Post-Quantum Cryptography. PQCrypto 2022. LNCS, vol. 13512, pp. 375\u2013398. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-17234-2_18","DOI":"10.1007\/978-3-031-17234-2_18"},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/3-540-48405-1_7","volume-title":"Advances in Cryptology \u2014 CRYPTO 1999","author":"R Canetti","year":"1999","unstructured":"Canetti, R., Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Adaptive security for threshold cryptosystems. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 98\u2013116. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_7"},{"key":"5_CR20","doi-asserted-by":"publisher","unstructured":"Canetti, R., Feige, U., Goldreich, O., Naor, M.: Adaptively secure multi-party computation. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, STOC 1996, pp. 639\u2013648, New York, NY, USA, 1996. Association for Computing Machinery. ISBN 0897917855. https:\/\/doi.org\/10.1145\/237814.238015","DOI":"10.1145\/237814.238015"},{"key":"5_CR21","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":"5_CR22","doi-asserted-by":"publisher","unstructured":"Chou, T., et al.: Take your MEDS: digital signatures from matrix code equivalence. In: El Mrabet, N., De Feo, L., Duquesne, S. (eds.) Progress in Cryptology. AFRICACRYPT 2023. LNCS, vol. 14064, pp. 28\u201352. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-37679-5_2","DOI":"10.1007\/978-3-031-37679-5_2"},{"key":"5_CR23","doi-asserted-by":"publisher","unstructured":"Cozzo, D., Giunta, E.: Round-robin is optimal: lower bounds for group action based protocols. In: Rothblum, G., Wee, H. (eds.) Theory of Cryptography. TCC 2023. LNCS, vol. 14372, pp. 310\u2013335. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-48624-1_12","DOI":"10.1007\/978-3-031-48624-1_12"},{"key":"5_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-030-44223-1_10","volume-title":"Post-Quantum Cryptography","author":"D Cozzo","year":"2020","unstructured":"Cozzo, D., Smart, N.P.: Sashimi: cutting up CSI-FiSh secret keys to produce an actively secure distributed signing protocol. In: Ding, J., Tillich, J.-P. (eds.) PQCrypto 2020. LNCS, vol. 12100, pp. 169\u2013186. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-44223-1_10"},{"key":"5_CR25","unstructured":"Di Crescenzo, G., Frankel, Y.: Existence of multiplicative secret sharing schemes with polynomial share expansion. In: Tarjan, R.E., Warnow, T.J. (eds.), Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 17-19 January 1999, Baltimore, Maryland, USA, pp. 895\u2013896. ACM\/SIAM (1999). http:\/\/dl.acm.org\/citation.cfm?id=314500.315074"},{"key":"5_CR26","doi-asserted-by":"publisher","unstructured":"Crites, E., Komlo, C., Maller, M.: Fully adaptive Schnorr threshold signatures. In: Advances in Cryptology - CRYPTO 2023: 43rd Annual International Cryptology Conference, CRYPTO 2023, Santa Barbara, CA, USA, August 20-24, 2023, Proceedings, Part I, pp. 678\u2013709, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-38557-5_22. ISBN 978-3-031-38556-8","DOI":"10.1007\/978-3-031-38557-5_22"},{"key":"5_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-030-45388-6_7","volume-title":"Public-Key Cryptography \u2013 PKC 2020","author":"L De Feo","year":"2020","unstructured":"De Feo, L., Meyer, M.: Threshold schemes from isogeny assumptions. In: Kiayias, A., Kohlweiss, M., Wallden, P., Zikas, V. (eds.) PKC 2020. LNCS, vol. 12111, pp. 187\u2013212. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45388-6_7"},{"key":"5_CR28","doi-asserted-by":"publisher","unstructured":"Desmedt, Y., Di\u00a0Crescenzo, G., Burmester, M.: Multiplicative non-abelian sharing schemes and their application to threshold cryptography. In: Advances in Cryptology-ASIACRYPT 1994: 4th International Conferences on the Theory and Applications of Cryptology Wollongong, Australia, November 28\u2013December 1, 1994 Proceedings 4, pp. 19\u201332. Springer (1995). https:\/\/doi.org\/10.1007\/bfb0000421","DOI":"10.1007\/bfb0000421"},{"key":"5_CR29","doi-asserted-by":"publisher","unstructured":"Duman, J., Hartmann, D., Kiltz, E., Kunzweiler, S., Lehmann, J., Riepel, D.: Generic models for group actions. In: Boldyreva, A., Kolesnikov, V. (eds.) Public-Key Cryptography \u2013 PKC 2023. LNCS, vol. 13940, pp. 406\u2013435. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-31368-4_15","DOI":"10.1007\/978-3-031-31368-4_15"},{"key":"5_CR30","doi-asserted-by":"publisher","unstructured":"Espitau, T., Katsumata, S., Takemure, K.: Two-round threshold signature from algebraic one-more learning with errors. In: Reyzin, L., Stebila, D. (eds.) Advances in Cryptology \u2013 CRYPTO 2024. LNCS, vol. 14926, pp. 387\u2013424. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68394-7_13","DOI":"10.1007\/978-3-031-68394-7_13"},{"key":"5_CR31","doi-asserted-by":"publisher","unstructured":"Fischlin, M.: Communication-efficient non-interactive proofs of knowledge with online extractors. In: Shoup, V. (eds.) Advances in Cryptology \u2013 CRYPTO 2005. LNCS, vol. 3621, pp. 152\u2013168. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11535218_10","DOI":"10.1007\/11535218_10"},{"key":"5_CR32","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1002\/ecjc.4430720906","volume":"72","author":"M Ito","year":"1989","unstructured":"Ito, M., Saito, A., Nishizeki, T.: Secret sharing scheme realizing general access structure. Electron. Commun. Japan 72, 56\u201364 (1989)","journal-title":"Electron. Commun. Japan"},{"key":"5_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/3-540-45539-6_16","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2000","author":"S Jarecki","year":"2000","unstructured":"Jarecki, S., Lysyanskaya, A.: Adaptively secure threshold cryptography: introducing concurrency, removing erasures. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 221\u2013242. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45539-6_16"},{"key":"5_CR34","doi-asserted-by":"publisher","unstructured":"Katsumata, S., Reichle, M., Takemure, K.: Adaptively secure 5 round threshold signatures from MLWE\/MSIS and DL with rewinding. In: Reyzin, L., Stebila, D. (eds.) Advances in Cryptology \u2013 CRYPTO 2024. LNCS, vol. 14926, pp. 459\u2013491. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68394-7_15","DOI":"10.1007\/978-3-031-68394-7_15"},{"key":"5_CR35","doi-asserted-by":"publisher","unstructured":"Khaburzaniya, I., Chalkias, K., Lewi, K., Malvai, H.: Aggregating and thresholdizing hash-based signatures using starks. In: Proceedings of the 2022 ACM on Asia Conference on Computer and Communications Security, ASIA CCS 2022, pp. 393\u2013407, New York, NY, USA. Association for Computing Machinery. ISBN 9781450391405 (2022). https:\/\/doi.org\/10.1145\/3488932.3524128","DOI":"10.1145\/3488932.3524128"},{"key":"5_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-030-84242-0_8","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"J Nick","year":"2021","unstructured":"Nick, J., Ruffing, T., Seurin, Y.: MuSig2: simple two-round Schnorr multi-signatures. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12825, pp. 189\u2013221. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_8"},{"key":"5_CR37","unstructured":"NIST: Call for Additional Digital Signature Schemes for the Post-Quantum Cryptography Standardization Process (2023). https:\/\/csrc.nist.gov\/projects\/pqc-dig-sig\/standardization\/call-for-proposals"},{"key":"5_CR38","unstructured":"NIST: Post-Quantum Cryptography Standardization (2017). https:\/\/csrc.nist.gov\/Projects\/Post-Quantum-Cryptography"},{"key":"5_CR39","doi-asserted-by":"publisher","unstructured":"Orsini, E., Zanotto, R.: Simple two-message OT in the explicit isogeny model. IACR Commun. Cryptol. 1(1), 1-34 (2024). https:\/\/doi.org\/10.62056\/a39qgy4e-","DOI":"10.62056\/a39qgy4e-"},{"key":"5_CR40","doi-asserted-by":"publisher","unstructured":"del Pino, R., Katsumata, S., Maller, M., Mouhartem, F., Prest, T., Saarinen, M.J.: Threshold raccoon: practical threshold signatures from standard lattice assumptions. In: Joye, M., Leander, G. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2024. LNCS, vol. 14652, pp. 219\u2013248. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58723-8_8","DOI":"10.1007\/978-3-031-58723-8_8"},{"key":"5_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1007\/978-3-662-46803-6_25","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"D Unruh","year":"2015","unstructured":"Unruh, D.: Non-interactive zero-knowledge proofs in the quantum random oracle model. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9057, pp. 755\u2013784. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_25"}],"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-86599-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T18:55:21Z","timestamp":1742842521000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-86599-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031865985","9783031865992"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-86599-2_5","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":"15 March 2025","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":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","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":"9 April 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pqcrypto2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pqcrypto2025.iis.sinica.edu.tw\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}