{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:17:40Z","timestamp":1742912260910,"version":"3.40.3"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030983642"},{"type":"electronic","value":"9783030983659"}],"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-030-98365-9_3","type":"book-chapter","created":{"date-parts":[[2022,3,12]],"date-time":"2022-03-12T07:03:04Z","timestamp":1647068584000},"page":"42-59","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Security Analysis of\u00a0a\u00a0Cryptosystem Based on\u00a0Subspace Subcodes"],"prefix":"10.1007","author":[{"given":"Thierry P.","family":"Berger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anta Niane","family":"Gueye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cheikh Thiecoumba","family":"Gueye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. Anwarul","family":"Hasan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean Belo","family":"Klamti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edoardo","family":"Persichetti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tovohery H.","family":"Randrianarisoa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olivier","family":"Ruatta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,13]]},"reference":[{"key":"3_CR1","unstructured":"Aragon, N., et al.: BIKE: bit flipping key encapsulation (2017). http:\/\/bikesuite.org\/"},{"issue":"4","key":"3_CR2","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1515\/jmc-2018-0027","volume":"12","author":"G Banegas","year":"2018","unstructured":"Banegas, G., et al.: DAGS: key encapsulation using dyadic GS codes. J. Math. Cryptol. 12(4), 221\u2013239 (2018)","journal-title":"J. Math. Cryptol."},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.jsc.2014.09.025","volume":"70","author":"M Bardet","year":"2015","unstructured":"Bardet, M., Faug\u00e8re, J., Salvy, B.: On the complexity of the F5 Gr\u00f6bner basis algorithm. J. Symb. Comput. 70, 49\u201370 (2015)","journal-title":"J. Symb. Comput."},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-030-03326-2_4","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"\u00c9 Barelli","year":"2018","unstructured":"Barelli, \u00c9., Couvreur, A.: An efficient structural attack on NIST submission DAGS. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11272, pp. 93\u2013118. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03326-2_4"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-319-71045-7_11","volume-title":"Cryptography and Coding","author":"PS Barreto","year":"2017","unstructured":"Barreto, P.S., et al.: Cake: code-based algorithm for key encapsulation. In: O\u2019Neill, M. (ed.) Cryptography and Coding. LNCS, vol. 10655, pp. 207\u2013226. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-71045-7_11"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-642-25405-5_12","volume-title":"Post-Quantum Cryptography","author":"PSLM Barreto","year":"2011","unstructured":"Barreto, P.S.L.M., Lindner, R., Misoczki, R.: Monoidic codes in cryptography. In: Yang, B.-Y. (ed.) PQCrypto 2011. LNCS, vol. 7071, pp. 179\u2013199. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25405-5_12"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-642-02384-2_6","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2009","author":"TP Berger","year":"2009","unstructured":"Berger, T.P., Cayrel, P.-L., Gaborit, P., Otmani, A.: Reducing key length of the McEliece cryptosystem. In: Preneel, B. (ed.) AFRICACRYPT 2009. LNCS, vol. 5580, pp. 77\u201397. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02384-2_6"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-319-18681-8_16","volume-title":"Codes, Cryptology, and Information Security","author":"TP Berger","year":"2015","unstructured":"Berger, T.P., El Amrani, N.: Codes over $$\\cal{L}$$(GF(2)$$^m$$, GF(2)$$^m$$), MDS diffusion matrices and cryptographic applications. In: El Hajji, S., Nitaj, A., Carlet, C., Souidi, E. (eds.) Codes, Cryptology, and Information Security. LNCS, vol. 9084, pp. 197\u2013214. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-319-18681-8_16"},{"key":"3_CR9","unstructured":"Berger, T.P., Gueye, C.T., Klamti, J.B.: Generalized subspace subcodes with application in cryptology. CoRR abs\/1704.07882 (2017). http:\/\/arxiv.org\/abs\/1704.07882"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-319-55589-8_15","volume-title":"Codes, Cryptology and Information Security","author":"TP Berger","year":"2017","unstructured":"Berger, T.P., Gueye, C.T., Klamti, J.B.: A NP-complete problem in coding theory with application to code based cryptography. In: El Hajji, S., Nitaj, A., Souidi, E.M. (eds.) C2SI 2017. LNCS, vol. 10194, pp. 230\u2013237. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-55589-8_15"},{"issue":"8","key":"3_CR11","doi-asserted-by":"publisher","first-page":"4641","DOI":"10.1109\/TIT.2019.2909872","volume":"65","author":"TP Berger","year":"2019","unstructured":"Berger, T.P., Gueye, C.T., Klamti, J.B.: Generalized subspace subcodes with application in cryptology. IEEE Trans. Inf. Theory 65(8), 4641\u20134657 (2019)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3_CR12","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-030-36237-9_6","volume-title":"Algebra, Codes and Cryptology","author":"TP Berger","year":"2019","unstructured":"Berger, T.P., Gueye, C.T., Klamti, J.B., Ruatta, O.: Designing a public key cryptosystem based on quasi-cyclic subspace subcodes of Reed-Solomon codes. In: Gueye, C.T., Persichetti, E., Cayrel, P.-L., Buchmann, J. (eds.) A2C 2019. CCIS, vol. 1133, pp. 97\u2013113. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36237-9_6"},{"issue":"1","key":"3_CR13","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s10623-003-6151-2","volume":"35","author":"TP Berger","year":"2005","unstructured":"Berger, T.P., Loidreau, P.: How to mask the structure of codes for a cryptographic use. Designs Codes Crypt. 35(1), 63\u201379 (2005). https:\/\/doi.org\/10.1007\/s10623-003-6151-2","journal-title":"Designs Codes Crypt."},{"key":"3_CR14","unstructured":"Couvreur, A., Lequesne, M.: On the security of subspace subcodes of Reed-Solomon codes for public key encryption. arXiv preprint arXiv:2009.05826 (2020)"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Dr\u0103goi, V., Richmond, T., Bucerzan, D., Legay, A.: Survey on cryptanalysis of code-based cryptography: from theoretical to physical attacks. In: 2018 7th International Conference on Computers Communications and Control (ICCCC), pp. 215\u2013223. IEEE (2018)","DOI":"10.1109\/ICCCC.2018.8390461"},{"issue":"1","key":"3_CR16","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s10623-015-0036-z","volume":"79","author":"J-C Faug\u00e8re","year":"2015","unstructured":"Faug\u00e8re, J.-C., Otmani, A., Perret, L., de Portzamparc, F., Tillich, J.-P.: Structural cryptanalysis of McEliece schemes with compact keys. Designs Codes Crypt. 79(1), 87\u2013112 (2015). https:\/\/doi.org\/10.1007\/s10623-015-0036-z","journal-title":"Designs Codes Crypt."},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-642-13190-5_14","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"J-C Faug\u00e8re","year":"2010","unstructured":"Faug\u00e8re, J.-C., Otmani, A., Perret, L., Tillich, J.-P.: Algebraic cryptanalysis of McEliece variants with compact keys. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 279\u2013298. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_14"},{"key":"3_CR18","unstructured":"Faug\u00e8re, J.C., Otmani, A., Perret, L., Tillich, J.P.: Algebraic cryptanalysis of compact McEliece\u2019s variants-toward a complexity analysis. In: Conference on Symbolic Computation and Cryptography, p. 45 (2013)"},{"key":"3_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/3-540-46416-6_41","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201991","author":"EM Gabidulin","year":"1991","unstructured":"Gabidulin, E.M., Paramonov, A.V., Tretjakov, O.V.: Ideals over a non-commutative ring and their application in cryptology. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 482\u2013489. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-46416-6_41"},{"issue":"2","key":"3_CR20","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s10623-007-9160-8","volume":"48","author":"EM Gabidulin","year":"2008","unstructured":"Gabidulin, E.M.: Attacks and counter-attacks on the GPT public key cryptosystem. Designs Codes Crypt. 48(2), 171\u2013177 (2008). https:\/\/doi.org\/10.1007\/s10623-007-9160-8","journal-title":"Designs Codes Crypt."},{"key":"3_CR21","unstructured":"Gaborit, P., Murat, G., Ruatta, O., Z\u00e9mor, G.: Low rank parity check codes and their application to cryptography. In: Proceedings of the Workshop on Coding and Cryptography WCC, vol. 2013 (2013)"},{"issue":"2","key":"3_CR22","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF00193565","volume":"5","author":"J Georgiades","year":"1992","unstructured":"Georgiades, J.: Some remarks on the security of the identification scheme based on permuted kernels. J. Cryptol. 5(2), 133\u2013137 (1992). https:\/\/doi.org\/10.1007\/BF00193565","journal-title":"J. Cryptol."},{"issue":"2","key":"3_CR23","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s10623-017-0343-7","volume":"86","author":"AL Horlemann-Trautmann","year":"2018","unstructured":"Horlemann-Trautmann, A.L., Marshall, K., Rosenthal, J.: Extension of overbeck\u2019s attack for Gabidulin-based cryptosystems. Designs Codes Cryp. 86(2), 319\u2013340 (2018). https:\/\/doi.org\/10.1007\/s10623-017-0343-7","journal-title":"Designs Codes Cryp."},{"key":"3_CR24","volume-title":"Fundamentals of Error-correcting Codes","author":"WC Huffman","year":"2010","unstructured":"Huffman, W.C., Pless, V.: Fundamentals of Error-correcting Codes. Cambridge University Press, Cambridge (2010)"},{"issue":"2","key":"3_CR25","doi-asserted-by":"publisher","first-page":"207","DOI":"10.3934\/amc.2020053","volume":"15","author":"K Khathuria","year":"2021","unstructured":"Khathuria, K., Joachim Rosenthal, V.W.: Encryption scheme based on expanded Reed-Solomon codes. Adv. Math. Commun. 15(2), 207\u2013218 (2021)","journal-title":"Adv. Math. Commun."},{"key":"3_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-642-12929-2_11","volume-title":"Post-Quantum Cryptography","author":"P Loidreau","year":"2010","unstructured":"Loidreau, P.: Designing a rank metric based McEliece cryptosystem. In: Sendrier, N. (ed.) PQCrypto 2010. LNCS, vol. 6061, pp. 142\u2013152. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12929-2_11"},{"issue":"3","key":"3_CR27","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"24","author":"R McEliece","year":"1978","unstructured":"McEliece, R., Van Tilborg, H.: On the inherent intractability of certain coding problems. IEEE Trans. Inf. Theory 24(3), 384\u2013386 (1978)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3_CR28","first-page":"114","volume":"4244","author":"RJ McEliece","year":"1978","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. Coding Thv 4244, 114\u2013116 (1978)","journal-title":"Coding Thv"},{"key":"3_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/978-3-642-05445-7_24","volume-title":"Selected Areas in Cryptography","author":"R Misoczki","year":"2009","unstructured":"Misoczki, R., Barreto, P.S.L.M.: Compact McEliece keys from Goppa codes. In: Jacobson, M.J., Rijmen, V., Safavi-Naini, R. (eds.) SAC 2009. LNCS, vol. 5867, pp. 376\u2013392. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-05445-7_24"},{"key":"3_CR30","doi-asserted-by":"crossref","unstructured":"Misoczki, R., Tillich, J.P., Sendrier, N., Barreto, P.S.: MDPC-McEliece: new McEliece variants from moderate density parity-check codes. In: 2013 IEEE International Symposium on Information Theory, pp. 2069\u20132073. IEEE (2013)","DOI":"10.1109\/ISIT.2013.6620590"},{"issue":"2","key":"3_CR31","first-page":"159","volume":"15","author":"H Niederreiter","year":"1986","unstructured":"Niederreiter, H.: Knapsack-type cryptosystems and algebraic coding theory. Prob. Control Inf. Theory 15(2), 159\u2013166 (1986)","journal-title":"Prob. Control Inf. Theory"},{"key":"3_CR32","unstructured":"NIST. https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/round-3-submissions"},{"key":"3_CR33","unstructured":"NIST: https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/round-2-submissions"},{"issue":"2","key":"3_CR34","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/s00145-007-9003-9","volume":"21","author":"R Overbeck","year":"2008","unstructured":"Overbeck, R.: Structural attacks for public key cryptosystems based on Gabidulin codes. J. Cryptol. 21(2), 280\u2013301 (2008). https:\/\/doi.org\/10.1007\/s00145-007-9003-9","journal-title":"J. Cryptol."},{"issue":"2","key":"3_CR35","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1515\/jmc-2011-0099","volume":"6","author":"E Persichetti","year":"2012","unstructured":"Persichetti, E.: Compact McEliece keys based on quasi-dyadic Srivastava codes. J. Math. Cryptol. 6(2), 149\u2013169 (2012)","journal-title":"J. Math. Cryptol."},{"key":"3_CR36","doi-asserted-by":"crossref","unstructured":"Rashwan, H., Gabidulin, E.M., Honary, B.: A smart approach for GPT cryptosystem based on rank codes. In: 2010 IEEE International Symposium on Information Theory, pp. 2463\u20132467. IEEE (2010)","DOI":"10.1109\/ISIT.2010.5513549"},{"key":"3_CR37","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings 35th Annual Symposium on Foundations of Computer Science, pp. 124\u2013134. IEEE (1994)"},{"key":"3_CR38","doi-asserted-by":"crossref","unstructured":"Sidelnikov, V.M., Shestakov, S.O.: On insecurity of cryptosystems based on generalized Reed-Solomon codes (1992)","DOI":"10.1515\/dma.1992.2.4.439"},{"key":"3_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-642-12929-2_5","volume-title":"Post-Quantum Cryptography","author":"C Wieschebrink","year":"2010","unstructured":"Wieschebrink, C.: Cryptanalysis of the Niederreiter public key scheme based on GRS subcodes. In: Sendrier, N. (ed.) PQCrypto 2010. LNCS, vol. 6061, pp. 61\u201372. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12929-2_5"}],"container-title":["Lecture Notes in Computer Science","Code-Based Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-98365-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,12]],"date-time":"2022-03-12T07:04:02Z","timestamp":1647068642000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-98365-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030983642","9783030983659"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-98365-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"13 March 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CBCrypto","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Code-Based Cryptography Workshop","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Munich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cbc2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cbcrypto.dii.univpm.it\/home","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"14","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":"6","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":"43% - 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":"3","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":"1","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)"}},{"value":"The workshop was held online due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}