{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,3]],"date-time":"2025-10-03T08:58:01Z","timestamp":1759481881795,"version":"3.40.3"},"publisher-location":"Cham","reference-count":48,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031400025"},{"type":"electronic","value":"9783031400032"}],"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-40003-2_1","type":"book-chapter","created":{"date-parts":[[2023,8,9]],"date-time":"2023-08-09T13:03:04Z","timestamp":1691586184000},"page":"3-37","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Extension of\u00a0Overbeck\u2019s Attack with\u00a0an\u00a0Application to\u00a0Cryptanalysis of\u00a0Twisted Gabidulin-Based Schemes"],"prefix":"10.1007","author":[{"given":"Alain","family":"Couvreur","sequence":"first","affiliation":[]},{"given":"Ilaria","family":"Zappatore","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,10]]},"reference":[{"key":"1_CR1","unstructured":"Aguilar Melchor, C., et al.: Rank quasi cyclic (RQC). Second Round submission to NIST Post-Quantum Cryptography call (2020). https:\/\/pqc-rqc.org"},{"key":"1_CR2","unstructured":"Aragon, N., et al.: ROLLO (merger of Rank-Ouroboros, LAKE and LOCKER). Second round submission to the NIST post-quantum cryptography call (2019). https:\/\/pqc-rollo.org"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1007\/978-3-030-17659-4_25","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"N Aragon","year":"2019","unstructured":"Aragon, N., Blazy, O., Gaborit, P., Hauteville, A., Z\u00e9mor, G.: Durandal: a rank metric based signature scheme. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11478, pp. 728\u2013758. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_25"},{"key":"1_CR4","doi-asserted-by":"publisher","unstructured":"Aragon, N., Gaborit, P., Hauteville, A., Tillich, J.P.: A new algorithm for solving the rank syndrome decoding problem. In: 2018 IEEE International Symposium on Information Theory, ISIT 2018, Vail, CO, USA, 17\u201322 June 2018, pp. 2421\u20132425. IEEE (2018). https:\/\/doi.org\/10.1109\/ISIT.2018.8437464","DOI":"10.1109\/ISIT.2018.8437464"},{"key":"1_CR5","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":"1_CR6","doi-asserted-by":"publisher","unstructured":"Beelen, P., Bossert, M., Puchinger, S., Rosenkilde, J.: Structural properties of twisted Reed-Solomon codes with applications to cryptography. In: 2018 IEEE International Symposium on Information Theory (ISIT), pp. 946\u2013950 (2018). https:\/\/doi.org\/10.1109\/ISIT.2018.8437923","DOI":"10.1109\/ISIT.2018.8437923"},{"key":"1_CR7","doi-asserted-by":"publisher","unstructured":"Beelen, P., Puchinger, S., Rosenkilde n\u00e9 Nielsen, J.: Twisted Reed-Solomon codes. In: 2017 IEEE International Symposium on Information Theory (ISIT), pp. 336\u2013340 (2017). https:\/\/doi.org\/10.1109\/ISIT.2017.8006545","DOI":"10.1109\/ISIT.2017.8006545"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-81293-5_1","volume-title":"Post-Quantum Cryptography","author":"M Bombar","year":"2021","unstructured":"Bombar, M., Couvreur, A.: Decoding supercodes of Gabidulin codes and applications to cryptanalysis. In: Cheon, J.H., Tillich, J.-P. (eds.) PQCrypto 2021 2021. LNCS, vol. 12841, pp. 3\u201322. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81293-5_1"},{"key":"1_CR9","unstructured":"Bostan, A., et al.: Algorithmes Efficaces en Calcul Formel. Fr\u00e9d\u00e9ric Chyzak (auto-\u00e9dit.), Palaiseau (2017). https:\/\/hal.archives-ouvertes.fr\/AECF\/"},{"key":"1_CR10","unstructured":"Coggia, D., Couvreur, A.: On the security of a Loidreau\u2019s rank metric code based encryption scheme. In: Workshop on Coding Theory and Cryptography, WCC 2019, Saint-Jacut-de-la-Mer, France (2019)"},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"1941","DOI":"10.1007\/s10623-020-00781-4","volume":"88","author":"D Coggia","year":"2020","unstructured":"Coggia, D., Couvreur, A.: On the security of a Loidreau\u2019s rank metric code based encryption scheme. Des. Codes Cryptogr. 88, 1941\u20131957 (2020)","journal-title":"Des. Codes Cryptogr."},{"key":"1_CR12","unstructured":"Couvreur, A., Debris-Alazard, T., Gaborit, P.: On the hardness of code equivalence problems in rank metric (2020). https:\/\/hal.archives-ouvertes.fr\/hal-02997801. Working paper or preprint"},{"issue":"8","key":"1_CR13","doi-asserted-by":"publisher","first-page":"5404","DOI":"10.1109\/TIT.2017.2712636","volume":"63","author":"A Couvreur","year":"2017","unstructured":"Couvreur, A., M\u00e1rquez-Corbella, I., Pellikaan, R.: Cryptanalysis of McEliece cryptosystem based on algebraic geometry codes and their subcodes. IEEE Trans. Inform. Theory 63(8), 5404\u20135418 (2017)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"1_CR14","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1109\/TIT.2016.2574841","volume":"63","author":"A Couvreur","year":"2017","unstructured":"Couvreur, A., Otmani, A., Tillich, J.P.: Polynomial time attack on wild McEliece over quadratic extensions. IEEE Trans. Inform. Theory 63(1), 404\u2013427 (2017)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1_CR15","unstructured":"Drodz, Y.A., Kirichenko, V.V.: Finite Dimensional Algebras. Springer, Heidelberg (1994). Original Russian edition published by: Publisher of Kiev State University, Kiev 1980, Translated by V. Dlab"},{"key":"1_CR16","doi-asserted-by":"publisher","unstructured":"Friedl, K., R\u00f3nyai, L.: Polynomial time solutions of some problems of computational algebra. In: Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, STOC 1985, pp. 153\u2013162. Association for Computing Machinery, New York (1985). https:\/\/doi.org\/10.1145\/22145.22162","DOI":"10.1145\/22145.22162"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Gabidulin, E., Rashwan, H., Honary, B.: On improving security of GPT cryptosystems. In: Proceedings of the IEEE International Symposium Information Theory - ISIT, pp. 1110\u20131114. IEEE (2009)","DOI":"10.1109\/ISIT.2009.5206029"},{"issue":"1","key":"1_CR18","first-page":"3","volume":"21","author":"EM Gabidulin","year":"1985","unstructured":"Gabidulin, E.M.: Theory of codes with maximum rank distance. Problemy Peredachi Informatsii 21(1), 3\u201316 (1985)","journal-title":"Problemy Peredachi Informatsii"},{"key":"1_CR19","unstructured":"Gabidulin, E.M.: Public-key cryptosystems based on linear codes over large alphabets: efficiency and weakness. In: Farrell, P.G. (ed.) 4th IMA Conference on Cryptography and Coding, the Institute of Mathematics and its Applications, pp. 17\u201331 (1993)"},{"issue":"2","key":"1_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. Des. Codes Cryptogr. 48(2), 171\u2013177 (2008)","journal-title":"Des. Codes Cryptogr."},{"key":"1_CR21","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/S1571-0653(04)00168-4","volume":"6","author":"EM Gabidulin","year":"2001","unstructured":"Gabidulin, E.M., Ourivski, A.V.: Modified GPT PKC with right scrambler. Electron. Notes Discret. Math. 6, 168\u2013177 (2001). https:\/\/doi.org\/10.1016\/S1571-0653(04)00168-4","journal-title":"Electron. Notes Discret. Math."},{"key":"1_CR22","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"},{"key":"1_CR23","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 2013, Bergen, Norway (2013). www.selmer.uib.no\/WCC2013\/pdfs\/Gaborit.pdf"},{"issue":"2","key":"1_CR24","doi-asserted-by":"publisher","first-page":"1006","DOI":"10.1109\/TIT.2015.2511786","volume":"62","author":"P Gaborit","year":"2016","unstructured":"Gaborit, P., Ruatta, O., Schrek, J.: On the complexity of the rank syndrome decoding problem. IEEE Trans. Inform. Theory 62(2), 1006\u20131019 (2016)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1_CR25","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s10623-021-00972-7","volume":"90","author":"A Ghatak","year":"2022","unstructured":"Ghatak, A.: Extending Coggia-Couvreur attack on Loidreau\u2019s rank-metric cryptosystem. Des. Codes Cryptogr. 90, 215\u2013238 (2022)","journal-title":"Des. Codes Cryptogr."},{"issue":"1","key":"1_CR26","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/BF01390769","volume":"6","author":"K Gibson","year":"1995","unstructured":"Gibson, K.: Severely denting the Gabidulin version of the McEliece public key cryptosystem. Des. Codes Cryptogr. 6(1), 37\u201345 (1995)","journal-title":"Des. Codes Cryptogr."},{"key":"1_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/3-540-68339-9_19","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201996","author":"K Gibson","year":"1996","unstructured":"Gibson, K.: The security of the Gabidulin public key cryptosystem. In: Maurer, U. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 212\u2013223. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68339-9_19"},{"key":"1_CR28","volume-title":"Basic Structures of Function Field Arithmetic, Ergebnisse der Mathematik und ihrer Grenzgebiete (3) [Results in Mathematics and Related Areas (3)]","author":"D Goss","year":"1996","unstructured":"Goss, D.: Basic Structures of Function Field Arithmetic, Ergebnisse der Mathematik und ihrer Grenzgebiete (3) [Results in Mathematics and Related Areas (3)], vol. 35. Springer, Berlin (1996)"},{"issue":"5","key":"1_CR29","doi-asserted-by":"publisher","first-page":"987","DOI":"10.1007\/s12095-020-00449-9","volume":"12","author":"WK Kadir","year":"2020","unstructured":"Kadir, W.K., Li, C.: On decoding additive generalized twisted Gabidulin codes. Cryptogr. Commun. 12(5), 987\u20131009 (2020). https:\/\/doi.org\/10.1007\/s12095-020-00449-9","journal-title":"Cryptogr. Commun."},{"key":"1_CR30","doi-asserted-by":"crossref","unstructured":"Kadir, W.K., Li, C., Zullo, F.: On interpolation-based decoding of a class of maximum rank distance codes (2021). https:\/\/arxiv.org\/abs\/2105.03115","DOI":"10.1109\/ISIT45174.2021.9517980"},{"key":"1_CR31","doi-asserted-by":"publisher","unstructured":"Li, C.: Interpolation-based decoding of nonlinear maximum rank distance codes. In: 2019 IEEE International Symposium on Information Theory (ISIT), pp. 2054\u20132058 (2019). https:\/\/doi.org\/10.1109\/ISIT.2019.8849472","DOI":"10.1109\/ISIT.2019.8849472"},{"key":"1_CR32","unstructured":"Li, C., Kadir, W.K.: On decoding additive generalized twisted Gabidulin codes. In: Proceedings of the International Workshop on Coding and Cryptography, WCC 2019 (2019)"},{"key":"1_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/11779360_4","volume-title":"Coding and Cryptography","author":"P Loidreau","year":"2006","unstructured":"Loidreau, P.: A Welch\u2013Berlekamp like algorithm for decoding Gabidulin codes. In: Ytrehus, \u00d8. (ed.) WCC 2005. LNCS, vol. 3969, pp. 36\u201345. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11779360_4"},{"key":"1_CR34","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"},{"key":"1_CR35","unstructured":"McEliece, R.J.: A Public-Key System Based on Algebraic Coding Theory, pp. 114\u2013116. Jet Propulsion Lab (1978). dSN Progress Report 44"},{"issue":"3","key":"1_CR36","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1090\/S0002-9947-1933-1501703-0","volume":"35","author":"\u00d8 Ore","year":"1933","unstructured":"Ore, \u00d8.: On a special class of polynomials. Trans. Am. Math. Soc. 35(3), 559\u2013584 (1933)","journal-title":"Trans. Am. Math. Soc."},{"key":"1_CR37","unstructured":"Otmani, A., Tal\u00e9-Kalachi, H., Ndjeya, S.: Improved cryptanalysis of rank metric schemes based on Gabidulin codes. CoRR abs\/1602.08549 (2016). http:\/\/arxiv.org\/abs\/1602.08549"},{"key":"1_CR38","doi-asserted-by":"crossref","unstructured":"Ourivski, A.V., Gabidulin, E.M.: Column scrambler for the GPT cryptosystem. Discret. Appl. Math. 128(1), 207\u2013221 (2003). International Workshop on Coding and Cryptography (WCC 2001)","DOI":"10.1016\/S0166-218X(02)00446-8"},{"key":"1_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/11554868_5","volume-title":"Progress in Cryptology \u2013 Mycrypt 2005","author":"R Overbeck","year":"2005","unstructured":"Overbeck, R.: A new structural attack for GPT and variants. In: Dawson, E., Vaudenay, S. (eds.) Mycrypt 2005. LNCS, vol. 3715, pp. 50\u201363. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11554868_5"},{"issue":"2","key":"1_CR40","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)","journal-title":"J. Cryptol."},{"key":"1_CR41","unstructured":"Pham, B., Loidreau, P.: An analysis of Coggia-Couvreur attack on Loidreau\u2019s rank-metric public-key encryption scheme in the general case. In: Twelfth International Workshop on Coding and Cryptography, WCC 2022 (2022). https:\/\/www.wcc2022.uni-rostock.de\/storages\/uni-rostock\/Tagungen\/WCC2022\/Papers\/WCC_2022_paper_38.pdf"},{"key":"1_CR42","unstructured":"Puchinger, S., Rosenkilde n\u00e9 Nielsen, J., Sheekey, J.: Further generalisations of twisted Gabidulin codes. In: Workshop on Coding Theory and Cryptography, WCC 2017 (2017). https:\/\/arxiv.org\/abs\/1703.08093"},{"key":"1_CR43","unstructured":"Puchinger, S., Renner, J., Wachter-Zeh, A.: Twisted Gabidulin codes in the GPT cryptosystem (2018). http:\/\/arxiv.org\/abs\/1806.10055"},{"key":"1_CR44","unstructured":"Randrianarisoa, T.: A decoding algorithm for rank metric codes. Preprint (2017). https:\/\/arxiv.org\/abs\/1712.07060"},{"key":"1_CR45","doi-asserted-by":"publisher","unstructured":"Randrianarisoa, T., Rosenthal, J.: A decoding algorithm for twisted Gabidulin codes. In: 2017 IEEE International Symposium on Information Theory, pp. 2771\u20132774 (2017). https:\/\/doi.org\/10.1109\/ISIT.2017.8007034","DOI":"10.1109\/ISIT.2017.8007034"},{"issue":"8","key":"1_CR46","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1002\/sec.228","volume":"4","author":"H Rashwan","year":"2011","unstructured":"Rashwan, H., Gabidulin, E., Honary, B.: Security of the GPT cryptosystem and its applications to cryptography. Secur. Commun. Netw. 4(8), 937\u2013946 (2011)","journal-title":"Secur. Commun. Netw."},{"issue":"3","key":"1_CR47","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/S0747-7171(08)80017-X","volume":"9","author":"L R\u00f3nyai","year":"1990","unstructured":"R\u00f3nyai, L.: Computing the structure of finite algebras. J. Symb. Comput. 9(3), 355\u2013373 (1990)","journal-title":"J. Symb. Comput."},{"issue":"3","key":"1_CR48","doi-asserted-by":"publisher","first-page":"475","DOI":"10.3934\/amc.2016019","volume":"10","author":"J Sheekey","year":"2016","unstructured":"Sheekey, J.: A new family of linear maximum rank distance codes. Adv. Math. Commun. 10(3), 475\u2013488 (2016)","journal-title":"Adv. Math. Commun."}],"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-40003-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,9]],"date-time":"2023-08-09T13:04:05Z","timestamp":1691586245000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-40003-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031400025","9783031400032"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-40003-2_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"10 August 2023","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":"College Park, MD","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pqcrypto2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pqcrypto2023.umiacs.io\/","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":"51","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":"25","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":"49% - 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.16","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.30","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)"}}]}}