{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T21:27:08Z","timestamp":1769722028317,"version":"3.49.0"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031229657","type":"print"},{"value":"9783031229664","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.springernature.com\/gp\/researchers\/text-and-data-mining"},{"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.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-22966-4_21","type":"book-chapter","created":{"date-parts":[[2023,1,29]],"date-time":"2023-01-29T16:02:41Z","timestamp":1675008161000},"page":"620-650","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Security of\u00a0Truncated Permutation Without Initial Value"],"prefix":"10.1007","author":[{"given":"Lorenzo","family":"Grassi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bart","family":"Mennink","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,30]]},"reference":[{"key":"21_CR1","unstructured":"ANSI: ANSI X9.44: Public-Key Cryptography for the Financial Services Industry Key Establishment Using Integer Factorization Cryptography (2002)"},{"key":"21_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-642-38980-1_8","volume-title":"Applied Cryptography and Network Security","author":"J-P Aumasson","year":"2013","unstructured":"Aumasson, J.-P., Neves, S., Wilcox-O\u2019Hearn, Z., Winnerlein, C.: BLAKE2: simpler, smaller, fast as MD5. In: Jacobson, M., Locasto, M., Mohassel, P., Safavi-Naini, R. (eds.) ACNS 2013. LNCS, vol. 7954, pp. 119\u2013135. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38980-1_8"},{"key":"21_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-319-66787-4_15","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2017","author":"DJ Bernstein","year":"2017","unstructured":"Bernstein, D.J., K\u00f6lbl, S., Lucks, S., Massolino, P.M.C., Mendel, F., Nawaz, K., Schneider, T., Schwabe, P., Standaert, F.-X., Todo, Y., Viguier, B.: Gimli: a cross-platform permutation. In: Fischer, W., Homma, N. (eds.) CHES 2017. LNCS, vol. 10529, pp. 299\u2013320. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66787-4_15"},{"key":"21_CR4","unstructured":"Bertoni, G., Daemen, J., Peeters, M., Van Assche, G.: Sponge functions. In: Ecrypt Hash Workshop 2007 (2007)"},{"issue":"4","key":"21_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.46586\/tosc.v2017.i4.1-38","volume":"2017","author":"G Bertoni","year":"2017","unstructured":"Bertoni, G., Daemen, J., Hoffert, S., Peeters, M., Van Assche, G., Van Keer, R.: Farfalle: parallel permutation-based cryptography. IACR Trans. Symmetric Cryptol. 2017(4), 1\u201338 (2017)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"21_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-540-78967-3_11","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"G Bertoni","year":"2008","unstructured":"Bertoni, G., Daemen, J., Peeters, M., Van Assche, G.: On the indifferentiability of the sponge construction. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 181\u2013197. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78967-3_11"},{"issue":"4","key":"21_CR7","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/s10207-013-0220-y","volume":"13","author":"G Bertoni","year":"2014","unstructured":"Bertoni, G., Daemen, J., Peeters, M., Van Assche, G.: Sufficient conditions for sound tree and sequential hashing modes. Int. J. Inf. Sec. 13(4), 335\u2013353 (2014)","journal-title":"Int. J. Inf. Sec."},{"key":"21_CR8","unstructured":"Bertoni, G., Daemen, J., Peeters, M., Van Assche, G.: The KECCAK reference (2011)"},{"key":"21_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-319-78381-9_15","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"S Bhattacharya","year":"2018","unstructured":"Bhattacharya, S., Nandi, M.: Full indifferentiable security of the Xor of two or more random permutations using the $$\\chi ^2$$ method. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10820, pp. 387\u2013412. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_15"},{"issue":"4","key":"21_CR10","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/s00145-010-9071-0","volume":"23","author":"J Black","year":"2010","unstructured":"Black, J., Rogaway, P., Shrimpton, T., Stam, M.: An Analysis of the Blockcipher-Based Hash Functions from PGV. J. Cryptol. 23(4), 519\u2013545 (2010)","journal-title":"J. Cryptol."},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/11935230_19","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2006","author":"D Chang","year":"2006","unstructured":"Chang, D., Lee, S., Nandi, M., Yung, M.: Indifferentiable security analysis of popular hash functions with prefix-free padding. In: Lai, X., Chen, K. (eds.) ASIACRYPT 2006. LNCS, vol. 4284, pp. 283\u2013298. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11935230_19"},{"key":"21_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-030-34578-5_7","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"W Choi","year":"2019","unstructured":"Choi, W., Lee, B., Lee, J.: Indifferentiability of truncated random permutations. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11921, pp. 175\u2013195. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34578-5_7"},{"key":"21_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1007\/11535218_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"J-S Coron","year":"2005","unstructured":"Coron, J.-S., Dodis, Y., Malinaud, C., Puniya, P.: Merkle-Damg\u00e5rd revisited: how to construct a hash function. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 430\u2013448. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11535218_26"},{"issue":"4","key":"21_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.46586\/tosc.v2018.i4.1-38","volume":"2018","author":"J Daemen","year":"2018","unstructured":"Daemen, J., Hoffert, S., Van Assche, G., Van Keer, R.: The design of Xoodoo and Xoofff. IACR Trans. Symmetric Cryptol. 2018(4), 1\u201338 (2018)","journal-title":"IACR Trans. Symmetric Cryptol."},{"issue":"4","key":"21_CR15","doi-asserted-by":"publisher","first-page":"197","DOI":"10.46586\/tosc.v2018.i4.197-228","volume":"2018","author":"J Daemen","year":"2018","unstructured":"Daemen, J., Mennink, B., Van Assche, G.: Sound hashing modes of arbitrary functions, permutations, and block ciphers. IACR Trans. Symmetric Cryptol. 2018(4), 197\u2013228 (2018)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"21_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/978-3-319-63697-9_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"W Dai","year":"2017","unstructured":"Dai, W., Hoang, V.T., Tessaro, S.: Information-theoretic indistinguishability via the chi-squared method. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10403, pp. 497\u2013523. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63697-9_17"},{"key":"21_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/0-387-34805-0_39","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 89 Proceedings","author":"IB Damg\u00e5rd","year":"1990","unstructured":"Damg\u00e5rd, I.B.: A design principle for hash functions. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 416\u2013427. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_39"},{"key":"21_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-642-03317-9_7","volume-title":"Fast Software Encryption","author":"Y Dodis","year":"2009","unstructured":"Dodis, Y., Reyzin, L., Rivest, R.L., Shen, E.: Indifferentiability of permutation-based compression functions and tree-based modes of operation, with applications to MD6. In: Dunkelman, O. (ed.) FSE 2009. LNCS, vol. 5665, pp. 104\u2013121. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03317-9_7"},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"Grassi, L., Mennink, B.: Security of Truncated Permutation Without Initial Value. Cryptology ePrint Archive, Paper 2022\/508 (2022)","DOI":"10.1007\/978-3-031-22966-4_21"},{"key":"21_CR20","doi-asserted-by":"publisher","unstructured":"Gunsing, A.: Block-cipher-based tree hashing. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022. LNCS, vol. 13510, pp. 205\u2013233. Springer, Cham. (2022). https:\/\/doi.org\/10.1007\/978-3-031-15985-5_8","DOI":"10.1007\/978-3-031-15985-5_8"},{"issue":"3","key":"21_CR21","doi-asserted-by":"publisher","first-page":"362","DOI":"10.46586\/tosc.v2020.i3.362-366","volume":"2020","author":"A Gunsing","year":"2020","unstructured":"Gunsing, A., Daemen, J., Mennink, B.: Errata to sound hashing modes of arbitrary functions, permutations, and block ciphers. IACR Trans. Symmetric Cryptol. 2020(3), 362\u2013366 (2020)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"21_CR22","unstructured":"IEEE Computer Society: IEEE 1363.1 Standard Specifications For Public-Key Cryptography (2000)"},{"key":"21_CR23","unstructured":"ISO\/IEC: ISO\/IEC 18033\u20132 Information technology - Security techniques - Encryption algorithms - Part 2: Asymmetric ciphers (2006)"},{"key":"21_CR24","doi-asserted-by":"crossref","unstructured":"Kaliski, B., Staddon, J.: PKCS #1: RSA cryptography specifications version 2.0. RFC 2437, pp. 1\u201339 (1998)","DOI":"10.17487\/rfc2437"},{"key":"21_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-540-74619-5_3","volume-title":"Fast Software Encryption","author":"LR Knudsen","year":"2007","unstructured":"Knudsen, L.R., Rechberger, C., Thomsen, S.S.: The grindahl hash functions. In: Biryukov, A. (ed.) FSE 2007. LNCS, vol. 4593, pp. 39\u201357. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74619-5_3"},{"issue":"6","key":"21_CR26","doi-asserted-by":"publisher","first-page":"4050","DOI":"10.1109\/TIT.2017.2679757","volume":"63","author":"J Lee","year":"2017","unstructured":"Lee, J.: Indifferentiability of the sum of random permutations toward optimal security. IEEE Trans. Inf. Theory 63(6), 4050\u20134054 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"21_CR27","doi-asserted-by":"publisher","first-page":"158","DOI":"10.46586\/tosc.v2016.i1.158-176","volume":"2016","author":"A Luykx","year":"2016","unstructured":"Luykx, A., Mennink, B., Neves, S.: Security analysis of BLAKE2\u2019s modes of operation. IACR Trans. Symmetric Cryptol. 2016(1), 158\u2013176 (2016)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"21_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-642-17401-8_6","volume-title":"Progress in Cryptology - INDOCRYPT 2010","author":"A Mandal","year":"2010","unstructured":"Mandal, A., Patarin, J., Nachef, V.: Indifferentiability beyond the Birthday Bound for the Xor of Two Public Random Permutations. In: Gong, G., Gupta, K.C. (eds.) INDOCRYPT 2010. LNCS, vol. 6498, pp. 69\u201381. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17401-8_6"},{"key":"21_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-540-24638-1_2","volume-title":"Theory of Cryptography","author":"U Maurer","year":"2004","unstructured":"Maurer, U., Renner, R., Holenstein, C.: Indifferentiability, impossibility results on reductions, and applications to the random oracle methodology. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 21\u201339. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24638-1_2"},{"key":"21_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1007\/978-3-642-34961-4_32","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"B Mennink","year":"2012","unstructured":"Mennink, B.: Optimal collision security in double block length hashing with single length key. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol. 7658, pp. 526\u2013543. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34961-4_32"},{"key":"21_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/978-3-642-45239-0_14","volume-title":"Cryptography and Coding","author":"B Mennink","year":"2013","unstructured":"Mennink, B.: Indifferentiability of double length compression functions. In: Stam, M. (ed.) IMACC 2013. LNCS, vol. 8308, pp. 232\u2013251. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-45239-0_14"},{"key":"21_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1007\/978-3-319-28166-7_30","volume-title":"Applied Cryptography and Network Security","author":"B Mennink","year":"2015","unstructured":"Mennink, B., Preneel, B.: On the XOR of multiple random permutations. In: Malkin, T., Kolesnikov, V., Lewko, A.B., Polychronakis, M. (eds.) ACNS 2015. LNCS, vol. 9092, pp. 619\u2013634. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-28166-7_30"},{"key":"21_CR33","doi-asserted-by":"crossref","unstructured":"Merkle, R.C.: Protocols for public key cryptosystems. In: Proceedings of the 1980 IEEE Symposium on Security and Privacy, pp. 122\u2013134. IEEE Computer Society (1980)","DOI":"10.1109\/SP.1980.10006"},{"key":"21_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/3-540-48184-2_32","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201987","author":"RC Merkle","year":"1988","unstructured":"Merkle, R.C.: A Digital Signature Based on a Conventional Encryption Function. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 369\u2013378. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/3-540-48184-2_32"},{"key":"21_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/0-387-34805-0_21","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 89 Proceedings","author":"RC Merkle","year":"1990","unstructured":"Merkle, R.C.: A certified digital signature. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 218\u2013238. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_21"},{"key":"21_CR36","unstructured":"Merkle, R.C.: Secrecy, authentication and public key systems (1979), Ph.D. thesis, UMI Research Press"},{"key":"21_CR37","unstructured":"NIST: NIST SP800-108: Recommendation for Key Derivation Using Pseudorandom Functions (2009)"},{"key":"21_CR38","unstructured":"NIST: NIST FIPS 202: SHA-3 Standard: Permutation-Based Hash and Extendable-Output Functions (2015)"},{"key":"21_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/3-540-48329-2_31","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 93","author":"B Preneel","year":"1994","unstructured":"Preneel, B., Govaerts, R., Vandewalle, J.: Hash functions based on block ciphers: a synthetic approach. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 368\u2013378. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48329-2_31"},{"key":"21_CR40","unstructured":"Rabin, M.O.: Digitalized signatures. Foundations of Secure Computation, pp. 155\u2013166 (1978)"},{"key":"21_CR41","unstructured":"Rivest, R., et al.: The MD6 hash function - A proposal to NIST for SHA-3 (2008), submission to NIST\u2019s SHA-3 competition"},{"key":"21_CR42","unstructured":"RSA Security: PKCS#1 v2.1: RSA Cryptography Standard (2002)"},{"key":"21_CR43","doi-asserted-by":"crossref","unstructured":"Suzuki, K., Yasuda, K.: On the security of the cryptographic mask generation functions standardized by ANSI, IEEE, ISO\/IEC, and NIST (2012). NTT Technical Review","DOI":"10.53829\/ntr201211ra2"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22966-4_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T01:02:43Z","timestamp":1769648563000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22966-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031229657","9783031229664"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22966-4_21","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":"30 January 2023","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":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2022\/","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":"364","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":"98","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":"27% - 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":"10","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":"This content has been made available to all.","name":"free","label":"Free to read"}]}}