{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,3]],"date-time":"2026-09-03T22:59:39Z","timestamp":1788476379553,"version":"build-2803163510"},"publisher-location":"Singapore","reference-count":44,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819750276","type":"print"},{"value":"9789819750283","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-981-97-5028-3_12","type":"book-chapter","created":{"date-parts":[[2024,7,15]],"date-time":"2024-07-15T12:02:12Z","timestamp":1721044932000},"page":"225-244","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Algebraic Cryptanalysis of\u00a0the\u00a0HADES Design Strategy: Application to\u00a0Poseidon and\u00a0Poseidon2"],"prefix":"10.1007","author":[{"given":"Tomer","family":"Ashur","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"Buschman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohammad","family":"Mahzoun","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,7,16]]},"reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-3-030-34618-8_13","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"MR Albrecht","year":"2019","unstructured":"Albrecht, M.R., et al.: Algebraic cryptanalysis of\u00a0STARK-friendly designs: application to MARVELlous and MiMC. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11923, pp. 371\u2013397. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34618-8_13"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-662-53887-6_7","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"M Albrecht","year":"2016","unstructured":"Albrecht, M., Grassi, L., Rechberger, C., Roy, A., Tiessen, T.: MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016, Part I. LNCS, vol. 10031, pp. 191\u2013219. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53887-6_7"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1007\/978-3-662-46800-5_17","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"MR Albrecht","year":"2015","unstructured":"Albrecht, M.R., Rechberger, C., Schneider, T., Tiessen, T., Zohner, M.: Ciphers for MPC and FHE. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 430\u2013454. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_17"},{"key":"12_CR4","doi-asserted-by":"publisher","unstructured":"Aly, A., Ashur, T., Ben-Sasson, E., Dhooghe, S., Szepieniec, A.: Design of symmetric-key primitives for advanced cryptographic protocols. IACR Trans. Symmetric Cryptol. 2020(3), 1\u201345 (2020). https:\/\/doi.org\/10.13154\/tosc.v2020.i3.1-45","DOI":"10.13154\/tosc.v2020.i3.1-45"},{"key":"12_CR5","unstructured":"Ashur, T., Kindi, A., Mahzoun, M.: XHash8 and XHash12: efficient stark-friendly hash functions. IACR Cryptol. ePrint Arch. p.\u00a01045 (2023). https:\/\/eprint.iacr.org\/2023\/1045"},{"key":"12_CR6","unstructured":"Ashur, T., Kindi, A., Meier, W., Szepieniec, A., Threadbare, B.: Rescue-prime optimized. Cryptology ePrint Archive, Paper 2022\/1577 (2022). https:\/\/eprint.iacr.org\/2022\/1577"},{"key":"12_CR7","doi-asserted-by":"publisher","unstructured":"Ashur, T., Mahzoun, M., Toprakhisar, D.: Chaghri - a FHE-friendly block cipher. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, CCS 2022, pp. 139\u2013150. Association for Computing Machinery, New York (2022). https:\/\/doi.org\/10.1145\/3548606.3559364","DOI":"10.1145\/3548606.3559364"},{"key":"12_CR8","unstructured":"Aumasson, J., Khovratovich, D., Mennink, B., Quine, P.: SAFE: Sponge API for field elements. Cryptology ePrint Archive, Paper 2023\/522 (2023). https:\/\/eprint.iacr.org\/2023\/522"},{"key":"12_CR9","doi-asserted-by":"publisher","unstructured":"Bariant, A., Bouvier, C., Leurent, G., Perrin, L.: Algebraic attacks against some arithmetization-oriented primitives. IACR Trans. Sym. Cryptol. 2022(3), 73\u2013101 (2022). https:\/\/doi.org\/10.46586\/tosc.v2022.i3.73-101. https:\/\/tosc.iacr.org\/index.php\/ToSC\/article\/view\/9850","DOI":"10.46586\/tosc.v2022.i3.73-101"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-540-78967-3_11","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"G Bertoni","year":"2008","unstructured":"Bertoni, G., Daemen, J., Peeters, M., Van Assche, G.: On the indifferentiability of the sponge construction. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 181\u2013197. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78967-3_11"},{"key":"12_CR11","doi-asserted-by":"publisher","unstructured":"Bettale, L., Faug\u00e8re, J., Perret, L.: Solving polynomial systems over finite fields: improved analysis of the hybrid approach. In: van\u00a0der Hoeven, J., van Hoeij, M. (eds.) International Symposium on Symbolic and Algebraic Computation, ISSAC 2012, Grenoble, France - 22\u201325 July 2012, pp. 67\u201374. ACM (2012). https:\/\/doi.org\/10.1145\/2442829.2442843","DOI":"10.1145\/2442829.2442843"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-030-56877-1_11","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"T Beyne","year":"2020","unstructured":"Beyne, T., et al.: Out of oddity \u2013 new cryptanalytic techniques against symmetric primitives optimized for integrity proof systems. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12172, pp. 299\u2013328. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_11"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-642-21702-9_15","volume-title":"Fast Software Encryption","author":"C Boura","year":"2011","unstructured":"Boura, C., Canteaut, A., De Canni\u00e8re, C.: Higher-order differential properties of Keccak and Luffa. In: Joux, A. (ed.) FSE 2011. LNCS, vol. 6733, pp. 252\u2013269. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21702-9_15"},{"key":"12_CR14","unstructured":"Bouvier, C., Briaud, P., et al.: New design techniques for efficient arithmetization-oriented hash functions: anemoi permutations and jive compression mode. Cryptology ePrint Archive, Paper 2022\/840 (2022). https:\/\/eprint.iacr.org\/2022\/840"},{"key":"12_CR15","doi-asserted-by":"publisher","unstructured":"Canteaut, A., et al.: Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression. J. Cryptol. 31(3), 885\u2013916 (2018). https:\/\/doi.org\/10.1007\/s00145-017-9273-9","DOI":"10.1007\/s00145-017-9273-9"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Cantor, D.G., Zassenhaus, H.: A new algorithm for factoring polynomials over finite fields. Math. Comput. 36(154), 587\u2013592 (1981). http:\/\/www.jstor.org\/stable\/2007663","DOI":"10.1090\/S0025-5718-1981-0606517-5"},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-030-95312-6_19","volume-title":"Topics in Cryptology \u2013 CT-RSA 2022","author":"C Cid","year":"2022","unstructured":"Cid, C., Indr\u00f8y, J.P., Raddum, H.: FASTA \u2013 a stream cipher for fast FHE evaluation. In: Galbraith, S.D. (ed.) CT-RSA 2022. LNCS, vol. 13161, pp. 451\u2013483. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-95312-6_19"},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-031-22969-5_2","volume-title":"ASIACRYPT 2022, Part III","author":"O Cosseron","year":"2022","unstructured":"Cosseron, O., Hoffmann, C., M\u00e9aux, P., Standaert, F.: Towards case-optimized hybrid homomorphic encryption - featuring the Elisabeth stream cipher. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT 2022, Part III. LNCS, vol. 13793, pp. 32\u201367. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22969-5_2"},{"key":"12_CR19","unstructured":"Cox, D., Little, J., O\u2019Shea, D.: Ideals, Varieties, and Algorithms. An Introduction to Computational Algebraic Geometry and Commutative Algebra. Springer, Cham (2007). https:\/\/link.springer.com\/book\/10.1007\/978-0-387-35651-8"},{"key":"12_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-642-42001-6_4","volume-title":"Number Theory and Cryptography","author":"J Ding","year":"2013","unstructured":"Ding, J., Schmidt, D.: Solving degree and degree of regularity for polynomial systems over a finite fields. In: Fischlin, M., Katzenbeisser, S. (eds.) Number Theory and Cryptography. LNCS, vol. 8260, pp. 34\u201349. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-42001-6_4"},{"key":"12_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1007\/978-3-319-96884-1_22","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"C Dobraunig","year":"2018","unstructured":"Dobraunig, C., et al.: Rasta: a cipher with low ANDdepth and few ANDs per bit. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10991, pp. 662\u2013692. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_22"},{"key":"12_CR22","unstructured":"Dobraunig, C., Grassi, L., Helminger, L., Rechberger, C., Schofnegger, M., Walch, R.: Pasta: a case for hybrid homomorphic encryption. Cryptology ePrint Archive, Paper 2021\/731 (2021). https:\/\/eprint.iacr.org\/2021\/731"},{"key":"12_CR23","doi-asserted-by":"publisher","unstructured":"Faug\u00e8re, J., Gianni, P., Lazard, D., Mora, T.: Efficient computation of zero-dimensional Gr\u00f6bner bases by change of ordering. J. Symb. Comput. 16(4), 329\u2013344 (1993). https:\/\/doi.org\/10.1006\/jsco.1993.1051. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0747717183710515","DOI":"10.1006\/jsco.1993.1051"},{"key":"12_CR24","doi-asserted-by":"publisher","unstructured":"Faug\u00e8re, J.C., Mou, C.: Sparse fglm algorithms. J. Symb. Comput. 80, 538\u2013569 (2017). https:\/\/doi.org\/10.1016\/j.jsc.2016.07.025. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0747717116300700","DOI":"10.1016\/j.jsc.2016.07.025"},{"key":"12_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/978-3-642-40349-1_22","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2013","author":"B G\u00e9rard","year":"2013","unstructured":"G\u00e9rard, B., Grosso, V., Naya-Plasencia, M., Standaert, F.-X.: Block ciphers that are easier to mask: how far can we go? In: Bertoni, G., Coron, J.-S. (eds.) CHES 2013. LNCS, vol. 8086, pp. 383\u2013399. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40349-1_22"},{"key":"12_CR26","unstructured":"Grassi, L., Hao, Y., Rechberger, C., Schofnegger, M., Walch, R., Wang, Q.: Horst meets fluid-SPN: Griffin for zero-knowledge applications. Cryptology ePrint Archive, Paper 2022\/403 (2022). https:\/\/eprint.iacr.org\/2022\/403"},{"key":"12_CR27","unstructured":"Grassi, L., Kales, D., Khovratovich, D., Roy, A., Rechberger, C., Schofnegger, M.: Starkad and POSEIDON: new hash functions for zero knowledge proof systems. IACR Cryptol. ePrint Arch., p.\u00a0458 (2019). https:\/\/eprint.iacr.org\/2019\/458"},{"key":"12_CR28","unstructured":"Grassi, L., Khovratovich, D., L\u00fcftenegger, R., Rechberger, C., Schofnegger, M., Walch, R.: Hash functions monolith for ZK applications: may the speed of SHA-3 be with you. Cryptology ePrint Archive, Paper 2023\/1025 (2023). https:\/\/eprint.iacr.org\/2023\/1025"},{"key":"12_CR29","unstructured":"Grassi, L., Khovratovich, D., Rechberger, C., Roy, A., Schofnegger, M.: POSEIDON: a new hash function for Zero-Knowledge proof systems. In: 30th USENIX Security Symposium (USENIX Security 2021), pp. 519\u2013535. USENIX Association, August 2021. https:\/\/www.usenix.org\/conference\/usenixsecurity21\/presentation\/grassi"},{"key":"12_CR30","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-031-37679-5_8","volume-title":"Progress in Cryptology - AFRICACRYPT 2023","author":"L Grassi","year":"2023","unstructured":"Grassi, L., Khovratovich, D., Schofnegger, M.: POSEIDON2: a faster version of the POSEIDON hash function. In: El Mrabet, N., De Feo, L., Duquesne, S. (eds.) Progress in Cryptology - AFRICACRYPT 2023. LNCS, vol. 14064, pp. 177\u2013203. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-37679-5_8"},{"key":"12_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1007\/978-3-030-45724-2_23","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"L Grassi","year":"2020","unstructured":"Grassi, L., L\u00fcftenegger, R., Rechberger, C., Rotaru, D., Schofnegger, M.: On a generalization of substitution-permutation networks: the HADES design strategy. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020, Part II. LNCS, vol. 12106, pp. 674\u2013704. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_23"},{"key":"12_CR32","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/978-3-031-06944-4_20","volume-title":"Advances in Cryptology - EUROCRYPT 2022","author":"J Ha","year":"2022","unstructured":"Ha, J., Kim, S., Lee, B., Lee, J., Son, M.: Rubato: Noisy cipheras for approximate homomorphic encryption. In: Dunkelman, O., Dziembowski, S. (eds.) Advances in Cryptology - EUROCRYPT 2022. LNCS, vol. 13275, pp. 581\u2013610. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-06944-4_20"},{"key":"12_CR33","doi-asserted-by":"publisher","unstructured":"Hebborn, P., Leander, G.: Dasta - alternative linear layer for Rasta. IACR Trans. Symmetric Cryptol. 2020(3), 46\u201386 (2020). https:\/\/doi.org\/10.13154\/tosc.v2020.i3.46-86","DOI":"10.13154\/tosc.v2020.i3.46-86"},{"key":"12_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/BFb0052332","volume-title":"Fast Software Encryption","author":"T Jakobsen","year":"1997","unstructured":"Jakobsen, T., Knudsen, L.R.: The interpolation attack on block ciphers. In: Biham, E. (ed.) FSE 1997. LNCS, vol. 1267, pp. 28\u201340. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0052332"},{"key":"12_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-030-77886-6_2","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"N Keller","year":"2021","unstructured":"Keller, N., Rosemarin, A.: Mind the middle layer: the HADES design strategy revisited. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12697, pp. 35\u201363. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_2"},{"key":"12_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/3-540-60590-8_16","volume-title":"Fast Software Encryption","author":"LR Knudsen","year":"1995","unstructured":"Knudsen, L.R.: Truncated and higher order differentials. In: Preneel, B. (ed.) FSE 1994. LNCS, vol. 1008, pp. 196\u2013211. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60590-8_16"},{"key":"12_CR37","doi-asserted-by":"publisher","unstructured":"MacAulay, F.S.: Some formul\u00e6 in elimination. Proc. Lond. Math. Soc. s1-35(1), 3\u201327 (1902). https:\/\/doi.org\/10.1112\/plms\/s1-35.1.3. https:\/\/londmathsoc.onlinelibrary.wiley.com\/doi\/abs\/10.1112\/plms\/s1-35.1.3","DOI":"10.1112\/plms\/s1-35.1.3"},{"key":"12_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-662-49890-3_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"P M\u00e9aux","year":"2016","unstructured":"M\u00e9aux, P., Journault, A., Standaert, F.-X., Carlet, C.: Towards stream ciphers for efficient FHE with low-noise ciphertexts. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9665, pp. 311\u2013343. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49890-3_13"},{"key":"12_CR39","unstructured":"Sauer, J.F.: Gr\u00f6bner basis-attacking a tiny sponge. Technical report, AS Discrete Mathematics (2021). https:\/\/asdm.gmbh\/2021\/06\/28\/gb_experiment_summary\/"},{"key":"12_CR40","unstructured":"Shoup, V.: Factoring polynomials over finite fields: asymptotic complexity vs. reality (1993)"},{"key":"12_CR41","unstructured":"Szepieniec, A., Ashur, T., Dhooghe, S.: Rescue-prime: a standard specification (SoK). IACR Cryptol. ePrint Arch., p.\u00a01143 (2020). https:\/\/eprint.iacr.org\/2020\/1143"},{"key":"12_CR42","unstructured":"Szepieniec, A., Lemmens, A., Sauer, J.F., Threadbare, B., Al-Kindi: the tip5 hash function for recursive starks. Cryptology ePrint Archive, Paper 2023\/107 (2023). https:\/\/eprint.iacr.org\/2023\/107"},{"key":"12_CR43","doi-asserted-by":"crossref","unstructured":"Williams, V.V., Xu, Y., Xu, Z., Zhou, R.: New bounds for matrix multiplication: from alpha to omega (2023)","DOI":"10.1137\/1.9781611977912.134"},{"key":"12_CR44","unstructured":"Youssef, A., Mister, S., Tavares, S.: On the design of linear transformations for substitution permutation encryption networks, pp. 40\u201348, October 1997"}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-5028-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,15]],"date-time":"2024-07-15T12:06:44Z","timestamp":1721045204000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-5028-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819750276","9789819750283"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-5028-3_12","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":"16 July 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACISP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australasian Conference on Information Security and Privacy","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sydney, NSW","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","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":"15 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acisp2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.acisp24.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}