{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T18:10:37Z","timestamp":1771611037016,"version":"3.50.1"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030983642","type":"print"},{"value":"9783030983659","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-030-98365-9_4","type":"book-chapter","created":{"date-parts":[[2022,3,12]],"date-time":"2022-03-12T07:03:04Z","timestamp":1647068584000},"page":"60-83","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Information-Set Decoding with\u00a0Hints"],"prefix":"10.1007","author":[{"given":"Anna-Lena","family":"Horlemann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sven","family":"Puchinger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julian","family":"Renner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Schamberger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonia","family":"Wachter-Zeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,13]]},"reference":[{"key":"4_CR1","unstructured":"Aguilar-Melchor, C., et al.: Hamming Quasi-Cyclic (HQC), Third round submission to the NIST post-quantum cryptography call (2019). https:\/\/pqc-hqc.org"},{"key":"4_CR2","unstructured":"Albrecht, M.R., et al.: Classic McEliece, Third round submission to the NIST post-quantum cryptography call (2019). https:\/\/classic.mceliece.org"},{"key":"4_CR3","unstructured":"Aragon, N., et al.: BIKE: Bit Flipping Key Encapsulation, Third round submission to the NIST post-quantum cryptography call (2019). https:\/\/bikesuite.org\/"},{"key":"4_CR4","unstructured":"Augot, D., Finiasz, M., Sendrier, N.: A fast provably secure cryptographic hash function, Cryptology ePrint Archive, Report 2003\/230 (2003). https:\/\/eprint.iacr.org\/2003\/230"},{"key":"4_CR5","unstructured":"Baldi, M., et al.: A new path to code-based signatures via identification schemes with restricted errors (2020)"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1007\/978-3-642-29011-4_31","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"A Becker","year":"2012","unstructured":"Becker, A., Joux, A., May, A., Meurer, A.: Decoding random binary linear codes in $$2^{n\/20}$$: How 1 + 1 = 0 improves information set decoding. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 520\u2013536. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_31"},{"issue":"3","key":"4_CR7","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"24","author":"E Berlekamp","year":"1978","unstructured":"Berlekamp, E., McEliece, R., van Tilborg, H.: On the inherent intractability of certain coding problems (corresp.). IEEE Trans. Inf. Theor. 24(3), 384\u2013386 (1978)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1007\/978-3-642-22792-9_42","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"DJ Bernstein","year":"2011","unstructured":"Bernstein, D.J., Lange, T., Peters, C.: Smaller decoding exponents: ball-collision decoding. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 743\u2013760. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_42"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-642-20901-7_5","volume-title":"Coding and Cryptology","author":"DJ Bernstein","year":"2011","unstructured":"Bernstein, D.J., Lange, T., Peters, C., Schwabe, P.: Faster 2-regular information-set decoding. In: Chee, Y.M., Guo, Z., Ling, S., Shao, F., Tang, Y., Wang, H., Xing, C. (eds.) IWCC 2011. LNCS, vol. 6639, pp. 81\u201398. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20901-7_5"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1109\/18.651067","volume":"44","author":"A Canteaut","year":"1998","unstructured":"Canteaut, A.: A new algorithm for finding minimum-weight words in a linear code: Application to McEliece\u2019s cryptosystem and to narrow-sense bch codes of length 511. IEEE Trans. Inf. Theor. 44, 367\u2013378 (1998)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-662-53140-2_14","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2016","author":"T Chou","year":"2016","unstructured":"Chou, T.: QcBits: constant-time small-key code-based cryptography. In: Gierlichs, B., Poschmann, A.Y. (eds.) CHES 2016. LNCS, vol. 9813, pp. 280\u2013300. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53140-2_14"},{"issue":"2","key":"4_CR12","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1109\/TIFS.2017.2757440","volume":"13","author":"MO Choudary","year":"2018","unstructured":"Choudary, M.O., Kuhn, M.G.: Efficient, portable template attacks. IEEE Trans. Inf. Forensics Secur. 13(2), 490\u2013501 (2018)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/978-3-030-56880-1_12","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"D Dachman-Soled","year":"2020","unstructured":"Dachman-Soled, D., Ducas, L., Gong, H., Rossi, M.: LWE with side information: attacks and concrete security estimation. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12171, pp. 329\u2013358. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_12"},{"issue":"6","key":"4_CR14","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.: New directions in cryptography. IEEE Trans. Inf. Theor. 22(6), 644\u2013654 (1976)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"4_CR15","unstructured":"Gligoroski, D., Samardjiska, S., Jacobsen, H., Bezzateev, S.: McEliece in the world of Escher, Cryptology ePrint Archive, Report 2014\/360 (2014)"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-642-12929-2_9","volume-title":"Post-Quantum Cryptography","author":"S Heyse","year":"2010","unstructured":"Heyse, S., Moradi, A., Paar, C.: Practical power analysis attacks on software implementations of McEliece. In: Sendrier, N. (ed.) PQCrypto 2010. LNCS, vol. 6061, pp. 108\u2013125. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12929-2_9"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Horlemann-Trautmann, A.-L., Weger, V.: Information set decoding in the Lee metric with applications to cryptography. Adv. Math. Commun. (2020)","DOI":"10.3934\/amc.2020089"},{"key":"4_CR18","doi-asserted-by":"crossref","first-page":"195","DOI":"10.13069\/jacodesmath.729477","volume":"7","author":"C Interlando","year":"2020","unstructured":"Interlando, C., Khathuria, K., Rohrer, N., Rosenthal, J., Weger, V.: Generalization of the ball-collision algorithm. J. Algebra Comb. Discrete Struct. Appl. 7, 195\u2013207 (2020)","journal-title":"J. Algebra Comb. Discrete Struct. Appl."},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1007\/978-3-030-64837-4_29","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"N Lahr","year":"2020","unstructured":"Lahr, N., Niederhagen, R., Petri, R., Samardjiska, S.: Side channel information set decoding using iterative chunking. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12491, pp. 881\u2013910. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64837-4_29"},{"key":"4_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/3-540-45961-8_25","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201988","author":"PJ Lee","year":"1988","unstructured":"Lee, P.J., Brickell, E.F.: An observation on the security of McEliece\u2019s public-key cryptosystem. In: Barstow, D., et al. (eds.) EUROCRYPT 1988. LNCS, vol. 330, pp. 275\u2013280. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/3-540-45961-8_25"},{"key":"4_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-642-25385-0_6","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"A May","year":"2011","unstructured":"May, A., Meurer, A., Thomae, E.: Decoding random linear codes in $$\\tilde{\\cal{O}}(2^{0.054n})$$. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 107\u2013124. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_6"},{"key":"4_CR22","first-page":"114","volume":"44","author":"RJ McEliece","year":"1978","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. DSN Prog. Rep. 44, 114\u2013116 (1978)","journal-title":"DSN Prog. Rep."},{"issue":"1","key":"4_CR23","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s13389-011-0001-3","volume":"1","author":"HG Molter","year":"2011","unstructured":"Molter, H.G., St\u00f6ttinger, M., Shoufan, A., Strenzke, F.: A simple power analysis attack on a McEliece cryptoprocessor. J. Cryptogr. Eng. 1(1), 29\u201336 (2011). https:\/\/doi.org\/10.1007\/s13389-011-0001-3","journal-title":"J. Cryptogr. Eng."},{"key":"4_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-319-29360-8_8","volume-title":"Post-Quantum Cryptography","author":"D Moody","year":"2016","unstructured":"Moody, D., Perlner, R.: Vulnerabilities of \u201cMcEliece in the world of Escher\u2019\u2019. In: Takagi, T. (ed.) PQCrypto 2016. LNCS, vol. 9606, pp. 104\u2013117. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-29360-8_8"},{"key":"4_CR25","unstructured":"National Institute of Standards and Technology (NIST), U.S. Department of Commerce, Post-quantum cryptography standardization (2017). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/Post-Quantum-Cryptography-Standardization"},{"issue":"1","key":"4_CR26","first-page":"47","volume":"4","author":"R Niebuhr","year":"2017","unstructured":"Niebuhr, R., Persichetti, E., Cayrel, P.-L., Bulygin, S., Buchmann, J.: On lower bounds for information set decoding over $$\\text{ F}_\\text{ q }$$ and on the effect of partial knowledge. Int. J. Inf. Coding Theor. 4(1), 47\u201378 (2017)","journal-title":"Int. J. Inf. Coding Theor."},{"key":"4_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/978-3-030-38471-5_22","volume-title":"Selected Areas in Cryptography \u2013 SAC 2019","author":"TB Paiva","year":"2020","unstructured":"Paiva, T.B., Terada, R.: A timing attack on the HQC encryption\u00a0scheme. In: Paterson, K.G., Stebila, D. (eds.) SAC 2019. LNCS, vol. 11959, pp. 551\u2013573. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-38471-5_22"},{"key":"4_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-642-12929-2_7","volume-title":"Post-Quantum Cryptography","author":"C Peters","year":"2010","unstructured":"Peters, C.: Information-set decoding for linear codes over $$\\mathbf{F}_q$$. In: Sendrier, N. (ed.) PQCrypto 2010. LNCS, vol. 6061, pp. 81\u201394. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12929-2_7"},{"issue":"5","key":"4_CR29","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. Theor. 8(5), 5\u20139 (1962)","journal-title":"IRE Trans. Inf. Theor."},{"key":"4_CR30","doi-asserted-by":"crossref","unstructured":"Puchinger, S., Renner, J., Rosenkilde, J.: Generic decoding in the sum-rank metric. In: IEEE International Symposium on Information Theory (ISIT), Extended Version, pp. 54\u201359 (2020) arxiv: https:\/\/arxiv.org\/abs\/2001.04812","DOI":"10.1109\/ISIT44484.2020.9174497"},{"key":"4_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-66787-4_1","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2017","author":"M Rossi","year":"2017","unstructured":"Rossi, M., Hamburg, M., Hutter, M., Marson, M.E.: A side-channel assisted cryptanalytic attack against QcBits. In: Fischer, W., Homma, N. (eds.) CHES 2017. LNCS, vol. 10529, pp. 3\u201323. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66787-4_1"},{"key":"4_CR32","doi-asserted-by":"crossref","unstructured":"Schamberger, T., Renner, J., Sigl, G., Wachter-Zeh, A.: A power side-channel attack on the CCA2-secure HQC KEM, Cryptology ePrint Archive, Report 2020\/910 (2020). https:\/\/eprint.iacr.org\/2020\/910","DOI":"10.1007\/978-3-030-68487-7_8"},{"key":"4_CR33","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 (1994)"},{"key":"4_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-642-14423-3_12","volume-title":"Information, Security and Cryptology \u2013 ICISC 2009","author":"A Shoufan","year":"2010","unstructured":"Shoufan, A., Strenzke, F., Molter, H.G., St\u00f6ttinger, M.: A timing attack against Patterson algorithm in the McEliece PKC. In: Lee, D., Hong, S. (eds.) ICISC 2009. LNCS, vol. 5984, pp. 161\u2013175. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14423-3_12"},{"key":"4_CR35","doi-asserted-by":"crossref","unstructured":"Sim, B.-Y., Kwon, J., Choi, K.Y., Cho, J., Park, A., Han, D.-G.: Novel side-channel attacks on quasi-cyclic code-based cryptography. IACR Trans. Cryptographic Hardware Embed. Syst. 2019(4) (2019)","DOI":"10.46586\/tches.v2019.i4.180-212"},{"key":"4_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/BFb0019850","volume-title":"Coding Theory and Applications","author":"J Stern","year":"1989","unstructured":"Stern, J.: A method for finding codewords of small weight. In: Cohen, G., Wolfmann, J. (eds.) Coding Theory 1988. LNCS, vol. 388, pp. 106\u2013113. Springer, Heidelberg (1989). https:\/\/doi.org\/10.1007\/BFb0019850"},{"key":"4_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-3-642-38616-9_15","volume-title":"Post-Quantum Cryptography","author":"F Strenzke","year":"2013","unstructured":"Strenzke, F.: Timing attacks against the syndrome inversion in code-based cryptosystems. In: Gaborit, P. (ed.) PQCrypto 2013. LNCS, vol. 7932, pp. 217\u2013230. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38616-9_15"},{"key":"4_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-540-88403-3_15","volume-title":"Post-Quantum Cryptography","author":"F Strenzke","year":"2008","unstructured":"Strenzke, F., Tews, E., Molter, H.G., Overbeck, R., Shoufan, A.: Side channels in the McEliece PKC. In: Buchmann, J., Ding, J. (eds.) PQCrypto 2008. LNCS, vol. 5299, pp. 216\u2013229. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-88403-3_15"},{"key":"4_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-319-11659-4_16","volume-title":"Post-Quantum Cryptography","author":"I von Maurich","year":"2014","unstructured":"von Maurich, I., G\u00fcneysu, T.: Towards side-channel resistant implementations of QC-MDPC McEliece encryption on constrained devices. In: Mosca, M. (ed.) PQCrypto 2014. LNCS, vol. 8772, pp. 266\u2013282. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11659-4_16"},{"key":"4_CR40","unstructured":"Wafo-Tapa, G., Bettaieb, S., Bidoux, L., Gaborit, P., Marcatel, E.: A practicable timing attack against HQC and its countermeasure, Cryptology ePrint Archive, Report 2019\/909 (2019). https:\/\/eprint.iacr.org\/2019\/909"},{"key":"4_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/3-540-45708-9_19","volume-title":"Advances in Cryptology \u2014 CRYPTO 2002","author":"D Wagner","year":"2002","unstructured":"Wagner, D.: A generalized birthday problem. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 288\u2013304. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_19"}],"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_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,20]],"date-time":"2024-09-20T04:21:24Z","timestamp":1726806084000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-98365-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030983642","9783030983659"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-98365-9_4","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":"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)"}}]}}