{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T11:38:22Z","timestamp":1776425902069,"version":"3.51.2"},"publisher-location":"Cham","reference-count":47,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031376788","type":"print"},{"value":"9783031376795","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-37679-5_2","type":"book-chapter","created":{"date-parts":[[2023,7,12]],"date-time":"2023-07-12T20:31:42Z","timestamp":1689193902000},"page":"28-52","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":33,"title":["Take Your MEDS: Digital Signatures from\u00a0Matrix Code Equivalence"],"prefix":"10.1007","author":[{"given":"Tung","family":"Chou","sequence":"first","affiliation":[]},{"given":"Ruben","family":"Niederhagen","sequence":"additional","affiliation":[]},{"given":"Edoardo","family":"Persichetti","sequence":"additional","affiliation":[]},{"given":"Tovohery Hajatiana","family":"Randrianarisoa","sequence":"additional","affiliation":[]},{"given":"Krijn","family":"Reijnders","sequence":"additional","affiliation":[]},{"given":"Simona","family":"Samardjiska","sequence":"additional","affiliation":[]},{"given":"Monika","family":"Trimoska","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,13]]},"reference":[{"key":"2_CR1","unstructured":"Aguilar Melchor, C., et al.: HQC. NIST PQC Submission (2020)"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Aguilar-Melchor, C., Gama, N., Howe, J., H\u00fclsing, A., Joseph, D., Yue, D.: The return of the SDitH. Cryptology ePrint Archive, Paper 2022\/1645 (2022, to appear at Eurocrypt 2023)","DOI":"10.1007\/978-3-031-30589-4_20"},{"key":"2_CR3","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. LNCS, vol. 12492, pp. 411\u2013439. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_14"},{"key":"2_CR4","unstructured":"Albrecht, M.R., et al.: Classic McEliece. NIST PQC Submission (2020)"},{"key":"2_CR5","unstructured":"Aragon, N., et al.: BIKE. NIST PQC Submission (2020)"},{"key":"2_CR6","unstructured":"Banegas, G., Debris-Alazard, T., Nedeljkovi\u0107, M., Smith, B.: Wavelet: code-based postquantum signatures with fast verification on microcontrollers. Cryptology ePrint Archive, Paper 2021\/1432 (2021)"},{"key":"2_CR7","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":"2_CR8","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"},{"issue":"2","key":"2_CR9","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1080\/23799927.2022.2048206","volume":"7","author":"A Barenghi","year":"2022","unstructured":"Barenghi, A., Biasse, J.-F., Ngo, T., Persichetti, E., Santini, P.: Advanced signature functionalities from the code equivalence problem. Int. J. Comput. Math. Comput. Syst. Theory 7(2), 112\u2013128 (2022)","journal-title":"Int. J. Comput. Math. Comput. Syst. Theory"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-030-81652-0_15","volume-title":"Selected Areas in Cryptography","author":"W Beullens","year":"2021","unstructured":"Beullens, W.: Not enough LESS: an improved algorithm for solving code equivalence problems over $$\\mathbb{F}_q$$. In: Dunkelman, O., Jacobson, Jr., M.J., O\u2019Flynn, C. (eds.) SAC 2020. LNCS, vol. 12804, pp. 387\u2013403. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81652-0_15"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Beullens, W., et al.: Oil and vinegar: modern parameters and implementations. Cryptology ePrint Archive, Paper 2023\/059 (2023)","DOI":"10.46586\/tches.v2023.i3.321-365"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/978-3-030-64834-3_16","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"W Beullens","year":"2020","unstructured":"Beullens, W., Katsumata, S., Pintore, F.: Calamari and Falafl: logarithmic (linkable) ring signatures from isogenies and lattices. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12492, pp. 464\u2013492. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_16"},{"key":"2_CR13","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_CR14","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":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/978-3-030-45724-2_17","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"X Bonnetain","year":"2020","unstructured":"Bonnetain, X., Schrottenloher, A.: Quantum security analysis of CSIDH. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12106, pp. 493\u2013522. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_17"},{"key":"2_CR16","unstructured":"Bouillaguet, C.: Algorithms for some hard problems and cryptographic attacks against specific cryptographic primitives. Ph.D. thesis, Universit\u00e9 Paris Diderot (2011)"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-642-38348-9_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"C Bouillaguet","year":"2013","unstructured":"Bouillaguet, C., Fouque, P.-A., V\u00e9ber, A.: Graph-theoretic algorithms for the \u201cisomorphism of polynomials\u2019\u2019 problem. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 211\u2013227. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_13"},{"key":"2_CR18","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_CR19","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":"2_CR20","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":"2_CR21","unstructured":"Couveignes, J.-M.: Hard homogeneous spaces. Cryptology ePrint Archive, Paper 2006\/291 (2006)"},{"key":"2_CR22","unstructured":"Couvreur, A., Debris-Alazard, T., Gaborit, P.: On the hardness of code equivalence problems in rank metric. CoRR, abs\/2011.04611 (2020)"},{"key":"2_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1007\/978-3-030-17659-4_26","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"L De Feo","year":"2019","unstructured":"De Feo, L., Galbraith, S.D.: SeaSign: compact isogeny signatures from class group actions. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11478, pp. 759\u2013789. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_26"},{"key":"2_CR24","unstructured":"Ding, J., et al.: Rainbow. Technical report, National Institute of Standards and Technology (2020)"},{"issue":"4","key":"2_CR25","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1016\/j.jsc.2010.10.014","volume":"46","author":"J-C Faug\u00e8re","year":"2011","unstructured":"Faug\u00e8re, J.-C., Din, M.S.E., Spaenlehauer, P.-J.: Gr\u00f6bner bases of bihomogeneous ideals generated by polynomials of bidegree (1, 1): algorithms and complexity. J. Symb. Comput. 46(4), 406\u2013437 (2011)","journal-title":"J. Symb. Comput."},{"key":"2_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-540-85174-5_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"J-C Faug\u00e8re","year":"2008","unstructured":"Faug\u00e8re, J.-C., Levy-dit-Vehel, F., Perret, L.: Cryptanalysis of MinRank. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 280\u2013296. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_16"},{"key":"2_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/11761679_3","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"J-C Faug\u00e8re","year":"2006","unstructured":"Faug\u00e8re, J.-C., Perret, L.: Polynomial equivalence problems: algorithmic and theoretical aspects. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 30\u201347. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11761679_3"},{"key":"2_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-47721-7_12","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 86","author":"A Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186\u2013194. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_12"},{"issue":"1","key":"2_CR29","doi-asserted-by":"publisher","first-page":"5","DOI":"10.3390\/cryptography6010005","volume":"6","author":"S Gueron","year":"2022","unstructured":"Gueron, S., Persichetti, E., Santini, P.: Designing a practical code-based signature scheme from zero-knowledge proofs with trusted setup. Cryptography 6(1), 5 (2022)","journal-title":"Cryptography"},{"key":"2_CR30","doi-asserted-by":"crossref","unstructured":"Haviv, I., Regev, O.: On the lattice isomorphism problem. In: Chekuri, C. (ed.) SODA 2014, pp. 391\u2013404. ACM SIAM (2014)","DOI":"10.1137\/1.9781611973402.29"},{"key":"2_CR31","unstructured":"Hulsing, A., et al.: SPHINCS+. NIST PQC Submission (2020)"},{"key":"2_CR32","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":"2_CR33","unstructured":"Kuperberg, G.: Another subexponential-time quantum algorithm for the dihedral hidden subgroup problem. In: Severini, S., Brand\u00e3o, F.G.S.L. (eds.) TQC 2013. LIPIcs, vol. 22, pp. 20\u201334. Schloss Dagstuhl (2013)"},{"issue":"3","key":"2_CR34","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1109\/TIT.1982.1056498","volume":"28","author":"JS Leon","year":"1982","unstructured":"Leon, J.S.: Computing automorphism groups of error-correcting codes. IEEE Trans. Inf. Theory 28(3), 496\u2013510 (1982)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2_CR35","unstructured":"Lyubashevsky, V., et al.: CRYSTALS. NIST PQC Submission (2020)"},{"key":"2_CR36","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. DSN PR 42-44, California Institute of Technology (1978)"},{"key":"2_CR37","unstructured":"Nguyen, P., Wolf, C.: International workshop on post-quantum cryptography (2006)"},{"key":"2_CR38","unstructured":"NIST. Post-Quantum Cryptography Standardization (2017). https:\/\/csrc.nist.gov\/Projects\/Post-Quantum-Cryptography"},{"key":"2_CR39","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":"2_CR40","unstructured":"Perlner, R., Smith-Tone, D.: Rainbow band separation is better than we thought. Cryptology ePrint Archive, Paper 2020\/702 (2020)"},{"issue":"5","key":"2_CR41","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1109\/TIT.1962.1057777","volume":"8","author":"E Prange","year":"1962","unstructured":"Prange, E.: The use of information sets in decoding cyclic codes. IRE Trans. Inf. Theory 8(5), 5\u20139 (1962)","journal-title":"IRE Trans. Inf. Theory"},{"key":"2_CR42","unstructured":"Prest, T., et al.: FALCON. NIST PQC Submission (2020)"},{"key":"2_CR43","unstructured":"Randall, D.: Efficient Generation of Random Nonsingular Matrices. Technical Report UCB\/CSD-91-658, EECS Department, UC Berkeley (1991)"},{"key":"2_CR44","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Gabow, H.N., Fagin, R. (eds.) Theory of Computing, pp. 84\u201393. ACM (2005)","DOI":"10.1145\/1060590.1060603"},{"key":"2_CR45","unstructured":"Reijnders, K., Samardjiska, S., Trimoska, M.: Hardness estimates of the code equivalence problem in the rank metric. Cryptology ePrint Archive, Paper 2022\/276 (2022)"},{"key":"2_CR46","unstructured":"Rostovtsev, A., Stolbunov, A.: Public-key cryptosystem based on isogenies. Cryptology ePrint Archive, Paper 2006\/145 (2006)"},{"key":"2_CR47","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","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"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology - AFRICACRYPT 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-37679-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,12]],"date-time":"2023-07-12T20:31:55Z","timestamp":1689193915000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-37679-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031376788","9783031376795"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-37679-5_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"13 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AFRICACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in Africa","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sousse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tunisia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"africacrypt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"59","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.9","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}