{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:23:36Z","timestamp":1743103416913,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":35,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819975624"},{"type":"electronic","value":"9789819975631"}],"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-981-99-7563-1_5","type":"book-chapter","created":{"date-parts":[[2023,10,30]],"date-time":"2023-10-30T20:01:50Z","timestamp":1698696110000},"page":"101-125","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Towards Minimizing Non-linearity in Type-II Generalized Feistel Networks"],"prefix":"10.1007","author":[{"given":"Yuqing","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chun","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weijia","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,31]]},"reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-030-29962-0_8","volume-title":"Computer Security \u2013 ESORICS 2019","author":"MR Albrecht","year":"2019","unstructured":"Albrecht, M.R., et al.: Feistel structures for MPC, and more. In: Sako, K., Schneider, S., Ryan, P.Y.A. (eds.) ESORICS 2019. LNCS, vol. 11736, pp. 151\u2013171. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-29962-0_8"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1007\/978-3-662-46800-5_17","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"MR Albrecht","year":"2015","unstructured":"Albrecht, M.R., Rechberger, C., Schneider, T., Tiessen, T., Zohner, M.: Ciphers for MPC and FHE. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 430\u2013454. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_17"},{"key":"5_CR3","doi-asserted-by":"publisher","unstructured":"Aly, A., Ashur, T., Ben-Sasson, E., Dhooghe, S., Szepieniec, A.: Design of symmetric-key primitives for advanced cryptographic protocols. IACR Trans. Symm. Cryptol. 2020(3), 1\u201345 (2020). https:\/\/doi.org\/10.13154\/tosc.v2020.i3.1-45","DOI":"10.13154\/tosc.v2020.i3.1-45"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-662-46800-5_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"A Bar-On","year":"2015","unstructured":"Bar-On, A., Dinur, I., Dunkelman, O., Lallemand, V., Keller, N., Tsaban, B.: Cryptanalysis of SP networks with partial non-linear layers. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 315\u2013342. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_13"},{"issue":"7","key":"5_CR5","doi-asserted-by":"publisher","first-page":"2074","DOI":"10.1109\/TC.2015.2468218","volume":"65","author":"TP Berger","year":"2016","unstructured":"Berger, T.P., Francq, J., Minier, M., Thomas, G.: Extended generalized Feistel networks using matrix representation to propose a new lightweight block cipher: Lilliput. IEEE Trans. Comput. 65(7), 2074\u20132089 (2016). https:\/\/doi.org\/10.1109\/TC.2015.2468218","journal-title":"IEEE Trans. Comput."},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-030-03326-2_12","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"R Bhaumik","year":"2018","unstructured":"Bhaumik, R., List, E., Nandi, M.: ZCZ\u00a0\u2013\u00a0achieving n-bit SPRP security with a minimal number of tweakable-block-cipher calls. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11272, pp. 336\u2013366. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03326-2_12"},{"key":"5_CR7","doi-asserted-by":"publisher","unstructured":"Cauchois, V., Gomez, C., Thomas, G.: General diffusion analysis: how to find optimal permutations for generalized type-II Feistel schemes. IACR Trans. Symm. Cryptol. 2019(1), 264\u2013301 (2019). https:\/\/doi.org\/10.13154\/tosc.v2019.i1.264-301","DOI":"10.13154\/tosc.v2019.i1.264-301"},{"key":"5_CR8","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":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1007\/978-3-319-96884-1_24","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"B Cogliati","year":"2018","unstructured":"Cogliati, B., et al.: Provable security of (tweakable) block ciphers based on substitution-permutation networks. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10991, pp. 722\u2013753. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_24"},{"key":"5_CR10","doi-asserted-by":"publisher","unstructured":"Derbez, P., Fouque, P., Lambin, B., Mollimard, V.: Efficient search for optimal diffusion layers of generalized Feistel networks. IACR Trans. Symmetric Cryptol. 2019(2), 218\u2013240 (2019). https:\/\/doi.org\/10.13154\/tosc.v2019.i2.218-240","DOI":"10.13154\/tosc.v2019.i2.218-240"},{"key":"5_CR11","unstructured":"Dodis, Y., Katz, J., Steinberger, J., Thiruvengadam, A., Zhang, Z.: Provable security of substitution-permutation networks. Cryptology ePrint Archive, Report 2017\/016 (2017). https:\/\/eprint.iacr.org\/2017\/016"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/978-3-662-49896-5_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"Y Dodis","year":"2016","unstructured":"Dodis, Y., Stam, M., Steinberger, J., Liu, T.: Indifferentiability of confusion-diffusion networks. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 679\u2013704. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_24"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-031-20974-1_13","volume-title":"Cryptology and Network Security","author":"Y Gao","year":"2022","unstructured":"Gao, Y., Guo, C.: Provable security Of HADES structure. In: Beresford, A.R., Patra, A., Bellini, E. (eds.) CANS 2022. LNCS, vol. 13641, pp. 258\u2013276. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-20974-1_13"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/978-3-642-40349-1_22","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2013","author":"B G\u00e9rard","year":"2013","unstructured":"G\u00e9rard, B., Grosso, V., Naya-Plasencia, M., Standaert, F.-X.: Block ciphers that are easier to mask: how far can we go? In: Bertoni, G., Coron, J.-S. (eds.) CHES 2013. LNCS, vol. 8086, pp. 383\u2013399. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40349-1_22"},{"key":"5_CR15","unstructured":"Grassi, L., Hao, Y., Rechberger, C., Schofnegger, M., Walch, R., Wang, Q.: Horst meets fluid-SPN: griffin for zero-knowledge applications. Cryptology ePrint Archive, Paper 2022\/403 (2022). https:\/\/eprint.iacr.org\/2022\/403. To appear at CRYPTO 2023"},{"key":"5_CR16","unstructured":"Grassi, L., Kales, D., Khovratovich, D., Roy, A., Rechberger, C., Schofnegger, M.: Starkad and Poseidon: new hash functions for zero knowledge proof systems. Cryptology ePrint Archive, Report 2019\/458 (2019). https:\/\/eprint.iacr.org\/2019\/458"},{"key":"5_CR17","unstructured":"Grassi, L., Khovratovich, D., Rechberger, C., Roy, A., Schofnegger, M.: Poseidon: A new hash function for zero-knowledge proof systems. In: USENIX Security Symposium (2021)"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1007\/978-3-030-45724-2_23","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"L Grassi","year":"2020","unstructured":"Grassi, L., L\u00fcftenegger, R., Rechberger, C., Rotaru, D., Schofnegger, M.: On a generalization of substitution-permutation networks: the HADES design strategy. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12106, pp. 674\u2013704. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_23"},{"key":"5_CR19","doi-asserted-by":"publisher","unstructured":"Guo, C., Standaert, F.X., Wang, W., Wang, X., Yu, Y.: Provable security of SP networks with partial non-linear layers. In: FSE 2021, pp. 353\u2013388 (2021). https:\/\/doi.org\/10.46586\/tosc.v2021.i2.353-388","DOI":"10.46586\/tosc.v2021.i2.353-388"},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-540-30556-9_25","volume-title":"Progress in Cryptology - INDOCRYPT 2004","author":"S Halevi","year":"2004","unstructured":"Halevi, S.: EME*: extending EME to handle arbitrary-length messages with associated data. In: Canteaut, A., Viswanathan, K. (eds.) INDOCRYPT 2004. LNCS, vol. 3348, pp. 315\u2013327. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30556-9_25"},{"key":"5_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/978-3-540-45146-4_28","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"S Halevi","year":"2003","unstructured":"Halevi, S., Rogaway, P.: A tweakable enciphering mode. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 482\u2013499. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_28"},{"key":"5_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-540-24660-2_23","volume-title":"Topics in Cryptology \u2013 CT-RSA 2004","author":"S Halevi","year":"2004","unstructured":"Halevi, S., Rogaway, P.: A parallelizable enciphering mode. In: Okamoto, T. (ed.) CT-RSA 2004. LNCS, vol. 2964, pp. 292\u2013304. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24660-2_23"},{"key":"5_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/978-3-642-14623-7_33","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"VT Hoang","year":"2010","unstructured":"Hoang, V.T., Rogaway, P.: On generalized Feistel networks. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 613\u2013630. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_33"},{"key":"5_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/3-540-44706-7_16","volume-title":"Fast Software Encryption","author":"T Iwata","year":"2001","unstructured":"Iwata, T., Kurosawa, K.: On the pseudorandomness of the AES finalists - RC6 and serpent. In: Goos, G., Hartmanis, J., van Leeuwen, J., Schneier, B. (eds.) FSE 2000. LNCS, vol. 1978, pp. 231\u2013243. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44706-7_16"},{"key":"5_CR25","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1109\/LCOMM.2004.833807","volume":"8","author":"J Lacan","year":"2004","unstructured":"Lacan, J., Fimes, J.: Systematic MDS erasure codes based on Vandermonde matrices. IEEE Commun. Lett. 8, 570\u2013572 (2004)","journal-title":"IEEE Commun. Lett."},{"issue":"4","key":"5_CR26","doi-asserted-by":"publisher","first-page":"54","DOI":"10.13154\/tosc.v2019.i4.54-80","volume":"2019","author":"R Nakamichi","year":"2019","unstructured":"Nakamichi, R., Iwata, T.: Iterative block ciphers from tweakable block ciphers with long tweaks. IACR Trans. Symm. Cryptol. 2019(4), 54\u201380 (2019). https:\/\/doi.org\/10.13154\/tosc.v2019.i4.54-80","journal-title":"IACR Trans. Symm. Cryptol."},{"issue":"4","key":"5_CR27","doi-asserted-by":"publisher","first-page":"24","DOI":"10.46586\/tosc.v2022.i4.24-91","volume":"2022","author":"K Nakaya","year":"2022","unstructured":"Nakaya, K., Iwata, T.: Generalized Feistel structures based on tweakable block ciphers. IACR Trans. Symmetric Cryptol. 2022(4), 24\u201391 (2022). https:\/\/doi.org\/10.46586\/tosc.v2022.i4.24-91","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"5_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/978-3-662-45611-8_25","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"M Nandi","year":"2014","unstructured":"Nandi, M.: XLS is not a strong pseudorandom permutation. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8873, pp. 478\u2013490. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45611-8_25"},{"key":"5_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-662-48800-3_5","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"M Nandi","year":"2015","unstructured":"Nandi, M.: On the optimality of non-linear computations of length-preserving encryption schemes. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9453, pp. 113\u2013133. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48800-3_5"},{"key":"5_CR30","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":"5_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-540-74619-5_7","volume-title":"Fast Software Encryption","author":"T Ristenpart","year":"2007","unstructured":"Ristenpart, T., Rogaway, P.: How to enrich the message space of a cipher. In: Biryukov, A. (ed.) FSE 2007. LNCS, vol. 4593, pp. 101\u2013118. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74619-5_7"},{"key":"5_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-642-13858-4_2","volume-title":"Fast Software Encryption","author":"T Suzaki","year":"2010","unstructured":"Suzaki, T., Minematsu, K.: Improving the generalized Feistel. In: Hong, S., Iwata, T. (eds.) FSE 2010. LNCS, vol. 6147, pp. 19\u201339. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13858-4_2"},{"key":"5_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/978-3-642-34931-7_17","volume-title":"Progress in Cryptology - INDOCRYPT 2012","author":"S Wu","year":"2012","unstructured":"Wu, S., Wang, M.: Automatic search of truncated impossible differentials for word-oriented block ciphers. In: Galbraith, S., Nandi, M. (eds.) INDOCRYPT 2012. LNCS, vol. 7668, pp. 283\u2013302. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34931-7_17"},{"key":"5_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-642-21554-4_19","volume-title":"Applied Cryptography and Network Security","author":"W Wu","year":"2011","unstructured":"Wu, W., Zhang, L.: LBlock: a lightweight block cipher. In: Lopez, J., Tsudik, G. (eds.) ACNS 2011. LNCS, vol. 6715, pp. 327\u2013344. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21554-4_19"},{"key":"5_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10.1007\/0-387-3","DOI":"10.1007\/0-387-34805-0_42","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 89 Proceedings","author":"Y Zheng","year":"1990","unstructured":"Zheng, Y., Matsumoto, T., Imai, H.: On the construction of block ciphers provably secure and not relying on any unproved hypotheses. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, p. 10.1007\/0-387-34805-0_42-480. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_42"}],"container-title":["Lecture Notes in Computer Science","Cryptology and Network Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-7563-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,7]],"date-time":"2024-01-07T18:01:46Z","timestamp":1704650506000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-7563-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9789819975624","9789819975631"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-7563-1_5","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":"31 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CANS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology and Network Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Augusta, GA","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":"30 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cans2023","order":10,"name":"conference_id","label":"Conference ID","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"129","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":"35","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":"4.5","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)"}}]}}