{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T23:59:59Z","timestamp":1769299199052,"version":"3.49.0"},"publisher-location":"Cham","reference-count":42,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030920777","type":"print"},{"value":"9783030920784","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-92078-4_17","type":"book-chapter","created":{"date-parts":[[2021,11,30]],"date-time":"2021-11-30T20:02:08Z","timestamp":1638302528000},"page":"490-519","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Fine-Tuning the\u00a0ISO\/IEC Standard LightMAC"],"prefix":"10.1007","author":[{"given":"Soumya","family":"Chattopadhyay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ashwin","family":"Jha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mridul","family":"Nandi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,1]]},"reference":[{"key":"17_CR1","unstructured":"CAESAR: Competition for authenticated encryption: security, applicability and robustness. Online Webpage (2014)"},{"key":"17_CR2","unstructured":"NIST: Lightweight cryptography standardization project. Online Webpage (2018)"},{"key":"17_CR3","unstructured":"27, I.J.S.: Information technology \u2013 lightweight cryptography \u2013 part 6: Message authentication codes (MACs). ISO\/IEC 29192-6, International Organization for Standardization (2019)"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-662-52993-5_3","volume-title":"Fast Software Encryption","author":"A Luykx","year":"2016","unstructured":"Luykx, A., Preneel, B., Tischhauser, E., Yasuda, K.: A MAC mode for lightweight block ciphers. In: Peyrin, T. (ed.) FSE 2016. LNCS, vol. 9783, pp. 43\u201359. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-52993-5_3"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Tsudik, G.: Message authentication with one-way hash functions. In: Proceedings of the IEEE - INFOCOM 1992, pp. 2055\u20132059 (1992)","DOI":"10.1109\/INFCOM.1992.263477"},{"key":"17_CR6","first-page":"1182","volume":"2015","author":"N Mouha","year":"2015","unstructured":"Mouha, N.: Chaskey: a MAC algorithm for microcontrollers - status update and proposal of Chaskey-12. IACR Cryptol. ePrint Arch. 2015, 1182 (2015)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/3-540-44750-4_2","volume-title":"Advances in Cryptology \u2014 CRYPT0\u2019 95","author":"M Bellare","year":"1995","unstructured":"Bellare, M., Gu\u00e9rin, R., Rogaway, P.: XOR MACs: new methods for message authentication using finite pseudorandom functions. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 15\u201328. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-44750-4_2"},{"issue":"3","key":"17_CR8","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s001459900051","volume":"12","author":"DJ Bernstein","year":"1999","unstructured":"Bernstein, D.J.: How to stretch random functions: the security of protected counter sums. J. Cryptol. 12(3), 185\u2013192 (1999)","journal-title":"J. Cryptol."},{"issue":"11","key":"17_CR9","doi-asserted-by":"publisher","first-page":"1851","DOI":"10.1109\/TC.2017.2710125","volume":"66","author":"A Dutta","year":"2017","unstructured":"Dutta, A., Jha, A., Nandi, M.: A new look at counters: don\u2019t run like marathon in a hundred meter race. IEEE Trans. Comput. 66(11), 1851\u20131864 (2017)","journal-title":"IEEE Trans. Comput."},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-540-39887-5_11","volume-title":"Fast Software Encryption","author":"T Iwata","year":"2003","unstructured":"Iwata, T., Kurosawa, K.: OMAC: one-key CBC MAC. In: Johansson, T. (ed.) FSE 2003. LNCS, vol. 2887, pp. 129\u2013153. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39887-5_11"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1007\/3-540-46035-7_25","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2002","author":"J Black","year":"2002","unstructured":"Black, J., Rogaway, P.: A block-cipher mode of operation for parallelizable message authentication. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 384\u2013397. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46035-7_25"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions (extended abstract). In: Proceedings of the Symposium on Foundations of Computer Science - FOCS 1984, pp. 464\u2013479 (1984)","DOI":"10.1109\/SFCS.1984.715949"},{"key":"17_CR13","first-page":"309","volume":"2004","author":"M Bellare","year":"2004","unstructured":"Bellare, M., Goldreich, O., Mityagin, A.: The power of verification queries in message authentication and authenticated encryption. IACR Cryptol. ePrint Arch. 2004, 309 (2004)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-642-27954-6_13","volume-title":"Topics in Cryptology \u2013 CT-RSA 2012","author":"K Yasuda","year":"2012","unstructured":"Yasuda, K.: PMAC with parity: minimizing the query-length influence. In: Dunkelman, O. (ed.) CT-RSA 2012. LNCS, vol. 7178, pp. 203\u2013214. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-27954-6_13"},{"issue":"2","key":"17_CR15","doi-asserted-by":"publisher","first-page":"125","DOI":"10.46586\/tosc.v2019.i2.125-145","volume":"2019","author":"Y Naito","year":"2019","unstructured":"Naito, Y.: The exact security of PMAC with two powering-up masks. IACR Trans. Symmetric Cryptol. 2019(2), 125\u2013145 (2019)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"17_CR16","unstructured":"Ehrsam, W.F., Meyer, C.H.W., Smith, J.L., Tuchman, W.L.: Message verification and transmission error detection by block chaining. Patent 4074066, USPTO (1976)"},{"key":"17_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/3-540-44598-6_12","volume-title":"Advances in Cryptology \u2014 CRYPTO 2000","author":"J Black","year":"2000","unstructured":"Black, J., Rogaway, P.: CBC MACs for arbitrary-length messages: the three-key constructions. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 197\u2013215. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44598-6_12"},{"key":"17_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/3-540-48658-5_32","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201994","author":"M Bellare","year":"1994","unstructured":"Bellare, M., Kilian, J., Rogaway, P.: The security of cipher block chaining. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 341\u2013358. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48658-5_32"},{"key":"17_CR19","series-title":"Lecture Notes in Computer Science","volume-title":"Final Report of RACE Integrity Primitives","author":"A Berendschot","year":"1995","unstructured":"Berendschot, A., et al.: Final Report of RACE Integrity Primitives. Lecture Notes in Computer Science, vol. 1007. Springer, Heidelberg (1995)"},{"key":"17_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/978-3-642-11925-5_25","volume-title":"Topics in Cryptology - CT-RSA 2010","author":"K Yasuda","year":"2010","unstructured":"Yasuda, K.: The sum of CBC\u00a0MACs is a secure PRF. In: Pieprzyk, J. (ed.) CT-RSA 2010. LNCS, vol. 5985, pp. 366\u2013381. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11925-5_25"},{"key":"17_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1007\/978-3-642-22792-9_34","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"K Yasuda","year":"2011","unstructured":"Yasuda, K.: A new variant of PMAC: beyond the birthday bound. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 596\u2013609. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_34"},{"key":"17_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-642-34961-4_19","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"L Zhang","year":"2012","unstructured":"Zhang, L., Wu, W., Sui, H., Wang, P.: 3kf9: enhancing 3GPP-MAC beyond the birthday bound. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol. 7658, pp. 296\u2013312. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34961-4_19"},{"key":"17_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-319-16715-2_16","volume-title":"Topics in Cryptology \u2014 CT-RSA 2015","author":"Y Zhang","year":"2015","unstructured":"Zhang, Y.: Using an error-correction code for fast, beyond-birthday-bound authentication. In: Nyberg, K. (ed.) CT-RSA 2015. LNCS, vol. 9048, pp. 291\u2013307. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-16715-2_16"},{"issue":"4","key":"17_CR24","doi-asserted-by":"publisher","first-page":"268","DOI":"10.46586\/tosc.v2017.i4.268-305","volume":"2017","author":"N Datta","year":"2017","unstructured":"Datta, N., Dutta, A., Nandi, M., Paul, G., Zhang, L.: Single key variant of PMAC_Plus. IACR Trans. Symmetric Cryptol. 2017(4), 268\u2013305 (2017)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"17_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/978-3-319-70700-6_16","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"Y Naito","year":"2017","unstructured":"Naito, Y.: Blockcipher-based MACs: beyond the birthday bound without message length. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10626, pp. 446\u2013470. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70700-6_16"},{"key":"17_CR26","doi-asserted-by":"crossref","unstructured":"Wegman, M.N., Carter, L.: New classes and applications of hash functions. In: Proceedings of the Symposium on Foundations of Computer Science - FOCS 1979, pp. 175\u2013182 (1979)","DOI":"10.1109\/SFCS.1979.26"},{"key":"17_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/11535218_32","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"M Bellare","year":"2005","unstructured":"Bellare, M., Pietrzak, K., Rogaway, P.: Improved security analyses for CBC\u00a0MACs. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 527\u2013545. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11535218_32"},{"key":"17_CR28","unstructured":"NIST: Announcing the Advanced Encryption Standard (AES). FIPS 197, National Institute of Standards and Technology, U.S. Department of Commerce (2001)"},{"key":"17_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-642-17373-8_18","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"M Fischlin","year":"2010","unstructured":"Fischlin, M., Lehmann, A., Ristenpart, T., Shrimpton, T., Stam, M., Tessaro, S.: Random oracles with(out) programmability. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 303\u2013320. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17373-8_18"},{"key":"17_CR30","unstructured":"Patarin, J.: Etude des G\u00e9n\u00e9rateurs de Permutations Pseudo-al\u00e9atoires Bas\u00e9s sur le Sch\u00e9ma du DES. Ph.D. thesis, Universit\u00e9 de Paris (1991)"},{"key":"17_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/978-3-642-04159-4_21","volume-title":"Selected Areas in Cryptography","author":"J Patarin","year":"2009","unstructured":"Patarin, J.: The \u201ccoefficients H\u2019\u2019 technique. In: Avanzi, R.M., Keliher, L., Sica, F. (eds.) SAC 2008. LNCS, vol. 5381, pp. 328\u2013345. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04159-4_21"},{"key":"17_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-662-53018-4_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"VT Hoang","year":"2016","unstructured":"Hoang, V.T., Tessaro, S.: Key-alternating ciphers and key-length extension: exact bounds and multi-user security. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9814, pp. 3\u201332. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4_1"},{"issue":"3\u20134","key":"17_CR33","first-page":"157","volume":"10","author":"A Jha","year":"2016","unstructured":"Jha, A., Nandi, M.: Revisiting structure graphs: applications to CBC-MAC and EMAC. J. Math. Cryptol. 10(3\u20134), 157\u2013180 (2016)","journal-title":"J. Math. Cryptol."},{"key":"17_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1007\/978-3-540-74619-5_27","volume-title":"Fast Software Encryption","author":"K Minematsu","year":"2007","unstructured":"Minematsu, K., Matsushima, T.: New bounds for PMAC, TMAC, and XCBC. In: Biryukov, A. (ed.) FSE 2007. LNCS, vol. 4593, pp. 434\u2013451. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74619-5_27"},{"issue":"2","key":"17_CR35","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1515\/JMC.2009.006","volume":"3","author":"M Nandi","year":"2009","unstructured":"Nandi, M.: Improved security analysis for OMAC as a pseudorandom function. J. Math. Cryptol. 3(2), 133\u2013148 (2009)","journal-title":"J. Math. Cryptol."},{"issue":"2","key":"17_CR36","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1515\/JMC.2008.007","volume":"2","author":"M Nandi","year":"2008","unstructured":"Nandi, M., Mandal, A.: Improved security analysis of PMAC. J. Math. Cryptol. 2(2), 149\u2013162 (2008)","journal-title":"J. Math. Cryptol."},{"issue":"2","key":"17_CR37","first-page":"145","volume":"2016","author":"P Gazi","year":"2016","unstructured":"Gazi, P., Pietrzak, K., Ryb\u00e1r, M.: The exact security of PMAC. IACR Trans. Symmetric Cryptol. 2016(2), 145\u2013161 (2016)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"17_CR38","first-page":"656","volume":"2020","author":"B Chakraborty","year":"2020","unstructured":"Chakraborty, B., Chattopadhyay, S., Jha, A., Nandi, M.: On length independent security bounds for the PMAC family. IACR Cryptol. ePrint Arch. 2020, 656 (2020)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"17_CR39","doi-asserted-by":"crossref","unstructured":"Baugher, M., McGrew, D., Naslund, M., Carrara, E., Norrman, K.: The secure real-time transport protocol (SRTP). RFC 3711, IETF (2004)","DOI":"10.17487\/rfc3711"},{"key":"17_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-642-55220-5_19","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"S Chen","year":"2014","unstructured":"Chen, S., Steinberger, J.: Tight security bounds for key-alternating ciphers. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 327\u2013350. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_19"},{"key":"17_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1007\/978-3-319-63697-9_19","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"B Mennink","year":"2017","unstructured":"Mennink, B., Neves, S.: Encrypted Davies-Meyer and its dual: towards optimal security using mirror theory. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10403, pp. 556\u2013583. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63697-9_19"},{"key":"17_CR42","first-page":"1130","volume":"2018","author":"A Jha","year":"2018","unstructured":"Jha, A., Nandi, M.: A survey on applications of h-technique: Revisiting security analysis of PRP and PRF. IACR Cryptol. ePrint Arch. 2018, 1130 (2018)","journal-title":"IACR Cryptol. ePrint Arch."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-92078-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,30]],"date-time":"2024-11-30T00:05:03Z","timestamp":1732925103000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92078-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030920777","9783030920784"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92078-4_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"1 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","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":"6 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2021\/","order":11,"name":"conference_url","label":"Conference URL","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":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"341","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":"95","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":"28% - 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.21","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":"4.61","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 conference 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)"}}]}}