{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T04:26:50Z","timestamp":1778128010117,"version":"3.51.4"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031159817","type":"print"},{"value":"9783031159824","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-15982-4_13","type":"book-chapter","created":{"date-parts":[[2022,10,11]],"date-time":"2022-10-11T04:40:54Z","timestamp":1665463254000},"page":"376-405","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Improving Support-Minors Rank Attacks: Applications to\u00a0G$$\\displaystyle e$$MSS and\u00a0Rainbow"],"prefix":"10.1007","author":[{"given":"John","family":"Baena","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Briaud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Cabarcas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ray","family":"Perlner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Smith-Tone","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Javier","family":"Verbel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,10,12]]},"reference":[{"key":"13_CR1","unstructured":"Albrecht, M.R., et al.: Classic McEliece: round 3 (2020). www.classic.mceliece.org\/nist\/mceliece-20201010.pdf. Accessed 10 Sep. 2021"},{"key":"13_CR2","unstructured":"Baena, J., Verbel, J.: Sage tool for the GeMSS attack (2021). www.github.com\/jbbaena\/Attack_on_GeMSS\/blob\/main\/Attack_on_GeMSS.ipynb"},{"key":"13_CR3","unstructured":"Baena, J., Briaud, P., Cabarcas, D., Perlner, R., Smith-Tone, D., Verbel, J.: Improving support-minors rank attacks: applications to G$$e$$MSS and Rainbow. Cryptology ePrint Archive, Paper 2021\/1677 (2021). www.eprint.iacr.org\/2021\/1677"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/978-3-030-81293-5_23","volume-title":"Post-Quantum Cryptography","author":"M Bardet","year":"2021","unstructured":"Bardet, M., Briaud, P.: An algebraic approach to the rank support learning problem. In: Cheon, J.H., Tillich, J.-P. (eds.) PQCrypto 2021 2021. LNCS, vol. 12841, pp. 442\u2013462. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81293-5_23"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/978-3-030-64837-4_17","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"M Bardet","year":"2020","unstructured":"Bardet, M., et al.: Improvements of algebraic attacks for solving the rank decoding and MinRank problems. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12491, pp. 507\u2013536. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64837-4_17"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Bardet, M., Mora, R., Tillich, J.P.: Decoding Reed-Solomon codes by solving a bilinear system with a Gr\u00f6bner basis approach. In: 2021 IEEE International Symposium on Information Theory (ISIT), pp. 872\u2013877 (2021)","DOI":"10.1109\/ISIT45174.2021.9517838"},{"key":"13_CR7","unstructured":"Bernstein, D.J., et al.: NTRU prime: round 3 (2020). www.ntruprime.cr.yp.to\/nist\/ntruprime-20201007.pdf. Accessed 26 Sep. 2021"},{"issue":"1","key":"13_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10623-012-9617-2","volume":"69","author":"L Bettale","year":"2013","unstructured":"Bettale, L., Faug\u00e8re, J.C., Perret, L.: Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic. Des. Codes Cryptogr. 69(1), 1\u201352 (2013)","journal-title":"Des. Codes Cryptogr."},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-030-77870-5_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"W Beullens","year":"2021","unstructured":"Beullens, W.: Improved cryptanalysis of UOV and rainbow. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12696, pp. 348\u2013373. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_13"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/11832072_23","volume-title":"Security and Cryptography for Networks","author":"O Billet","year":"2006","unstructured":"Billet, O., Gilbert, H.: Cryptanalysis of rainbow. In: De Prisco, R., Yung, M. (eds.) SCN 2006. LNCS, vol. 4116, pp. 336\u2013347. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11832072_23"},{"key":"13_CR11","doi-asserted-by":"publisher","unstructured":"Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system. I. The user language. J. Symb. Comput. 24(3\u20134), 235\u2013265 (1997). https:\/\/doi.org\/10.1006\/jsco.1996.0125","DOI":"10.1006\/jsco.1996.0125"},{"issue":"3","key":"13_CR12","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1006\/jcss.1998.1608","volume":"58","author":"JF Buss","year":"1999","unstructured":"Buss, J.F., Frandsen, G.S., Shallit, J.O.: The computational complexity of some problems of linear algebra. J. Comput. Syst. Sci. 58(3), 572\u2013596 (1999)","journal-title":"J. Comput. Syst. Sci."},{"key":"13_CR13","unstructured":"Casanova, A., Faug\u00e8re, J.C., Macario-Rat, G., Patarin, J., Perret, L., Ryckeghem, J.: GeMSS: a great multivariate short signature. NIST CSRC (2020). www.polsys.lip6.fr\/Links\/NIST\/GeMSS_specification_round2.pdf"},{"key":"13_CR14","unstructured":"Chen, M.S., Yang, B.Y., Smith-Tone, D.: PFLASH\u2014Secure asymmetric signatures on smart cards. In: Lightweight Cryptography Workshop 2015 (2015). www.csrc.nist.gov\/groups\/ST\/lwc-workshop2015\/papers\/session3-smith-tone-paper.pdf"},{"key":"13_CR15","unstructured":"Chen, C., et al.: NTRU: round 3 (2019). www.ntru.org\/f\/ntru-20190330.pdf"},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/978-3-642-33027-8_21","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2012","author":"C-M Cheng","year":"2012","unstructured":"Cheng, C.-M., Chou, T., Niederhagen, R., Yang, B.-Y.: Solving quadratic equations with XL on parallel architectures. In: Prouff, E., Schaumont, P. (eds.) CHES 2012. LNCS, vol. 7428, pp. 356\u2013373. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33027-8_21"},{"issue":"205","key":"13_CR17","first-page":"333","volume":"62","author":"D Coppersmith","year":"1994","unstructured":"Coppersmith, D.: Solving homogeneous linear equations over GF(2) via block Wiedemann algorithm. Math. Comput. 62(205), 333\u2013350 (1994)","journal-title":"Math. Comput."},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Courtois, N.: Algebraic attacks over GF(2k), application to HFE challenge 2 and Sflash-v2, pp. 201\u2013217 (2004)","DOI":"10.1007\/978-3-540-24632-9_15"},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/3-540-45539-6_27","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2000","author":"N Courtois","year":"2000","unstructured":"Courtois, N., Klimov, A., Patarin, J., Shamir, A.: Efficient algorithms for solving overdefined systems of multivariate polynomial equations. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 392\u2013407. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45539-6_27"},{"key":"13_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/3-540-45682-1_24","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2001","author":"NT Courtois","year":"2001","unstructured":"Courtois, N.T.: Efficient zero-knowledge authentication based on a linear algebra problem MinRank. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 402\u2013421. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45682-1_24"},{"key":"13_CR21","unstructured":"Ding, J., Chen, M.S., Petzoldt, A., Schmidt, D.: Gui. NIST CSRC (2017). http:\/\/www.csrc.nist.gov\/Projects\/post-quantum-cryptography\/Round-1-Submissions"},{"key":"13_CR22","unstructured":"Ding, J., Chen, M.S., Petzoldt, A., Schmidt, D., Yang, B.Y.: Rainbow. NIST CSRC (2020). http:\/\/www.csrc.nist.gov\/Projects\/post-quantum-cryptography\/round-3-submissions"},{"key":"13_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-319-11659-4_5","volume-title":"Post-Quantum Cryptography","author":"J Ding","year":"2014","unstructured":"Ding, J., Petzoldt, A., Wang, L.: The cubic simple matrix encryption scheme. In: Mosca, M. (ed.) PQCrypto 2014. LNCS, vol. 8772, pp. 76\u201387. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11659-4_5"},{"key":"13_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-74143-5_1","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"V Dubois","year":"2007","unstructured":"Dubois, V., Fouque, P.-A., Shamir, A., Stern, J.: Practical cryptanalysis of SFLASH. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 1\u201312. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74143-5_1"},{"key":"13_CR25","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re, J.C., Safey El Din, M., Spaenlehauer, P.J.: Computing loci of rank defects of linear matrices using G\u00f6bner bases and applications to cryptology. In: ISSAC 2010\u201335th International Symposium on Symbolic and Algebraic Computation, pp. 257\u2013264. ACM, Munich (2010). http:\/\/www.hal.archives-ouvertes.fr\/hal-01057840","DOI":"10.1145\/1837934.1837984"},{"key":"13_CR26","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S0022-4049(99)00005-5","volume":"139","author":"JC Faug\u00e9re","year":"1999","unstructured":"Faug\u00e9re, J.C.: A new efficient algorithm for computing Gr\u00f6bner bases (F4). J. Pure Appl. Algebra 139, 61\u201388 (1999)","journal-title":"J. Pure Appl. Algebra"},{"key":"13_CR27","doi-asserted-by":"crossref","unstructured":"Fauq\u00e9re, J.C.: A new efficient algorithm for computing Gr\u00f6bner bases without reduction to zero (F5). In: ISSAC 2002, pp. 75\u201383. ACM Press (2002)","DOI":"10.1145\/780506.780516"},{"key":"13_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/3-540-44448-3_4","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2000","author":"L Goubin","year":"2000","unstructured":"Goubin, L., Courtois, N.T.: Cryptanalysis of the TTM cryptosystem. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 44\u201357. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44448-3_4"},{"key":"13_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/978-3-540-79499-8_31","volume-title":"Information Security and Cryptology","author":"X Jiang","year":"2008","unstructured":"Jiang, X., Ding, J., Hu, L.: Kipnis-Shamir attack on HFE revisited. In: Pei, D., Yung, M., Lin, D., Wu, C. (eds.) Inscrypt 2007. LNCS, vol. 4990, pp. 399\u2013411. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-79499-8_31"},{"key":"13_CR30","doi-asserted-by":"crossref","unstructured":"Kaltofen, E.: Analysis of Coppersmith\u2019s block Wiedemann algorithm for the parallel solution of sparse linear systems. Math. Comput. 64(210), 777\u2013806 (1995). https:\/\/www.jstor.org\/stable\/2153451","DOI":"10.1090\/S0025-5718-1995-1270621-1"},{"key":"13_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-48405-1_2","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 99","author":"A Kipnis","year":"1999","unstructured":"Kipnis, A., Shamir, A.: Cryptanalysis of the HFE public key cryptosystem by relinearization. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 19\u201330. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_2"},{"key":"13_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/978-3-030-84252-9_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"P Longa","year":"2021","unstructured":"Longa, P., Wang, W., Szefer, J.: The cost to break SIKE: a comparative hardware-based analysis with AES and SHA-3. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12827, pp. 402\u2013431. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84252-9_14"},{"key":"13_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/3-540-45961-8_39","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201988","author":"T Matsumoto","year":"1988","unstructured":"Matsumoto, T., Imai, H.: Public quadratic polynomial-tuples for efficient signature-verification and message-encryption. In: Barstow, D., et al. (eds.) EUROCRYPT 1988. LNCS, vol. 330, pp. 419\u2013453. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/3-540-45961-8_39"},{"key":"13_CR34","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-642-23141-4_12","volume-title":"Information Security and Assurance","author":"MSE Mohamed","year":"2011","unstructured":"Mohamed, M.S.E., Ding, J., Buchmann, J.: Towards algebraic cryptanalysis of HFE challenge 2. In: Kim, T., Adeli, H., Robles, R.J., Balitanas, M. (eds.) ISA 2011. CCIS, vol. 200, pp. 123\u2013131. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23141-4_12"},{"key":"13_CR35","unstructured":"Niederhagen, R.: Parallel cryptanalysis. Ph.D. thesis. Eindhoven University of Technology (2012). http:\/\/www.polycephaly.org\/thesis\/index.shtml"},{"key":"13_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-030-81293-5_6","volume-title":"Post-Quantum Cryptography","author":"M \u00d8ygarden","year":"2021","unstructured":"\u00d8ygarden, M., Smith-Tone, D., Verbel, J.: On the effect of projection on rank attacks in multivariate cryptography. In: Cheon, J.H., Tillich, J.-P. (eds.) PQCrypto 2021 2021. LNCS, vol. 12841, pp. 98\u2013113. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81293-5_6"},{"key":"13_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/3-540-68339-9_4","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201996","author":"J Patarin","year":"1996","unstructured":"Patarin, J.: Hidden fields equations (HFE) and isomorphisms of polynomials (IP): two new families of asymmetric algorithms. In: Maurer, U. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 33\u201348. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68339-9_4"},{"key":"13_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-662-48797-6_14","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"A Petzoldt","year":"2015","unstructured":"Petzoldt, A., Chen, M.-S., Yang, B.-Y., Tao, C., Ding, J.: Design principles for HFEv- based multivariate signature schemes. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9452, pp. 311\u2013334. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48797-6_14"},{"key":"13_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-319-11659-4_14","volume-title":"Post-Quantum Cryptography","author":"J Porras","year":"2014","unstructured":"Porras, J., Baena, J., Ding, J.: ZHFE, a new multivariate public key encryption scheme. In: Mosca, M. (ed.) PQCrypto 2014. LNCS, vol. 8772, pp. 229\u2013245. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11659-4_14"},{"key":"13_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-030-84242-0_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"C Tao","year":"2021","unstructured":"Tao, C., Petzoldt, A., Ding, J.: Efficient key recovery for all HFE signature variants. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12825, pp. 70\u201393. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_4"},{"key":"13_CR41","unstructured":"The Rainbow Team: Response to recent paper by Ward Beullens (2020). http:\/\/www.troll.iis.sinica.edu.tw\/by-publ\/recent\/response-ward.pdf"},{"key":"13_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/978-3-319-59879-6_16","volume-title":"Post-Quantum Cryptography","author":"J Vates","year":"2017","unstructured":"Vates, J., Smith-Tone, D.: Key recovery attack for all parameters of HFE-. In: Lange, T., Takagi, T. (eds.) PQCrypto 2017. LNCS, vol. 10346, pp. 272\u2013288. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59879-6_16"},{"key":"13_CR43","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/BF02165411","volume":"13","author":"S Volker","year":"1969","unstructured":"Volker, S.: Gaussian elimination is not optimal. Numerische Mathematik 13, 354\u2013356 (1969)","journal-title":"Numerische Mathematik"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15982-4_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T22:04:12Z","timestamp":1760133852000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15982-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031159817","9783031159824"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15982-4_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"12 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"42","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}