{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T17:34:58Z","timestamp":1790789698151,"version":"4.1.0"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031562310","type":"print"},{"value":"9783031562327","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-56232-7_7","type":"book-chapter","created":{"date-parts":[[2024,3,28]],"date-time":"2024-03-28T14:02:34Z","timestamp":1711634554000},"page":"134-156","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["The Patching Landscape of\u00a0Elisabeth-4 and\u00a0the\u00a0Mixed Filter Permutator Paradigm"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9744-1539","authenticated-orcid":false,"given":"Cl\u00e9ment","family":"Hoffmann","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5733-4341","authenticated-orcid":false,"given":"Pierrick","family":"M\u00e9aux","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7444-0285","authenticated-orcid":false,"given":"Fran\u00e7ois-Xavier","family":"Standaert","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,3,29]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Ashur, T., Mahzoun, M., Toprakhisar, D.: Chaghri - a fhe-friendly block cipher. In: Yin, H., Stavrou, A., Cremers, C., Shi, E. (eds.), Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, CCS 2022, Los Angeles, CA, USA, 7\u201311 November 2022, pp. 139\u2013150. ACM (2022)","DOI":"10.1145\/3548606.3559364"},{"key":"7_CR2","doi-asserted-by":"publisher","unstructured":"Albrecht, M.R., Rechberger, C., Schneider, T., Tiessen, T., Zohner, M.: Ciphers for MPC and FHE. In: Oswald, E., Fischlin, M. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2015. EUROCRYPT 2015. LNCS, vol. 9056, pp. 430\u2013454. Springer, Berlin, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_17","DOI":"10.1007\/978-3-662-46800-5_17"},{"key":"7_CR3","doi-asserted-by":"publisher","unstructured":"Boneh, D., Ishai, Y., Passelegue, A., Sahai, A., Wu, D.J.: Exploring crypto dark matter: - new simple PRF candidates and their applications. In: Beimel, A., Dziembowski, S. (eds.) Theory of Cryptography. TCC 2018. LNCS, vol. 11240, pp. 699\u2013729. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03810-6_25","DOI":"10.1007\/978-3-030-03810-6_25"},{"key":"7_CR4","doi-asserted-by":"publisher","unstructured":"Bellare, M., Yee, B.: Forward-security in private-key cryptography. In: Joye, M. (ed.) Topics in Cryptology \u2013 CT-RSA 2003. CT-RSA 2003. LNCS, vol. 2612, pp. 1\u201318. Springer, Berlin, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36563-X_1","DOI":"10.1007\/3-540-36563-X_1"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Carlet, C.: Boolean Functions for Cryptography and Coding Theory. Cambridge University Press, Cambridge (2021)","DOI":"10.1017\/9781108606806"},{"key":"7_CR6","doi-asserted-by":"publisher","unstructured":"Canteaut, A., et al.: Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression. In: Peyrin, T. (eds.) Fast Software Encryption. FSE 2016. LNCS, vol. 9783, pp. 313\u2013333. Springer, Berlin, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-52993-5_16","DOI":"10.1007\/978-3-662-52993-5_16"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Cong, K., Das, D., Park, J., Pereira, H.V.: Sortinghat: efficient private decision tree evaluation via homomorphic encryption and transciphering. In: Yin, H., Stavrou, A., Cremers, C., Shi, E. (eds.), Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, CCS 2022, Los Angeles, CA, USA, 7\u201311 November 2022, pp. 563\u2013577. ACM (2022)","DOI":"10.1145\/3548606.3560702"},{"key":"7_CR8","doi-asserted-by":"publisher","unstructured":"Chillotti, I., Gama, N., Georgieva, M., Izabachene, M.: Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds. In: Cheon, J., Takagi, T. (eds.) Advances in Cryptology \u2013 ASIACRYPT 2016. ASIACRYPT 2016. LNCS, vol. 10031, pp. 3\u201333. Springer, Berlin, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53887-6_1","DOI":"10.1007\/978-3-662-53887-6_1"},{"key":"7_CR9","doi-asserted-by":"publisher","unstructured":"Cho, J., et al.: Transciphering framework for approximate homomorphic encryption. In: Tibouchi, M., Wang, H. (eds.) Advances in Cryptology \u2013 ASIACRYPT 2021. ASIACRYPT 2021. LNCS, vol. 13092, pp. 640\u2013669. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92078-4_22","DOI":"10.1007\/978-3-030-92078-4_22"},{"key":"7_CR10","doi-asserted-by":"publisher","unstructured":"Cosseron, O., Hoffmann, C., Meaux, P., Standaert, F.X.: Towards case-optimized hybrid homomorphic encryption - featuring the elisabeth stream cipher. In: Agrawal, S., Lin, D. (eds.) Advances in Cryptology \u2013 ASIACRYPT 2022. ASIACRYPT 2022. LNCS, vol. 13793, pp. 32\u201367. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22969-5_2","DOI":"10.1007\/978-3-031-22969-5_2"},{"key":"7_CR11","doi-asserted-by":"publisher","unstructured":"Courtois, N.T., Meier, W.: Algebraic attacks on stream ciphers with linear feedback. In: Biham, E. (ed.) Advances in Cryptology \u2013 EUROCRYPT 2003. EUROCRYPT 2003. LNCS, vol. 2656, pp. 345\u2013359. Springer, Berlin, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_21","DOI":"10.1007\/3-540-39200-9_21"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"197","DOI":"10.3934\/amc.2013.7.197","volume":"7","author":"C Carlet","year":"2013","unstructured":"Carlet, C., Merabet, B.: Asymptotic lower bound on the algebraic immunity of random balanced multi-output Boolean functions. Adv. Math. Commun. 7, 197\u2013217 (2013)","journal-title":"Adv. Math. Commun."},{"key":"7_CR13","first-page":"2017","volume":"3","author":"C Carlet","year":"2017","unstructured":"Carlet, C., M\u00e9aux, P., Rotella, Y.: Boolean functions with restricted input and their robustness; application to the FLIP cipher. IACR Trans. Symmetric Cryptol. 3, 2017 (2017)","journal-title":"IACR Trans. Symmetric Cryptol."},{"issue":"205","key":"7_CR14","first-page":"333","volume":"62","author":"D Coppersmith","year":"1994","unstructured":"Coppersmith, D.: Solving homogeneous linear equations over gf(2) via block wiedemann algorithm. Math. Comput. 62(205), 333\u2013350 (1994)","journal-title":"Math. Comput."},{"key":"7_CR15","doi-asserted-by":"publisher","unstructured":"Courtois, N.T.: Fast Algebraic Attacks on Stream Ciphers with Linear Feedback. In: Boneh, D. (ed.) Advances in Cryptology \u2013 CRYPTO 2003. CRYPTO 2003. LNCS, vol. 2729, pp. 176\u2013194. Springer, Berlin, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_11","DOI":"10.1007\/978-3-540-45146-4_11"},{"key":"7_CR16","unstructured":"Clet, P.E., Zuber, M., Boudguiga, A., Sirdey, R., Gouy-Pailler, C.: Putting up the swiss army knife of homomorphic calculations by means of TFHE functional bootstrapping. IACR Cryptol. ePrint Arch., p. 149 (2022)"},{"key":"7_CR17","doi-asserted-by":"publisher","unstructured":"Dobraunig, C., et al.: Rasta: a cipher with low anddepth and few ANDs per bit. In: Shacham, H., Boldyreva, A. (ed.) Advances in Cryptology \u2013 CRYPTO 2018. CRYPTO 2018. LNCS, vol. 10991, pp. 662\u2013692 . Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_22","DOI":"10.1007\/978-3-319-96884-1_22"},{"key":"7_CR18","doi-asserted-by":"publisher","unstructured":"Dinur, I., et al.: MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications. In: Malkin, T., Peikert, C. (eds.) Advances in Cryptology \u2013 CRYPTO 2021. CRYPTO 2021. LNCS, vol. 12828, pp. 517\u2013547. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84259-8_18","DOI":"10.1007\/978-3-030-84259-8_18"},{"issue":"3","key":"7_CR19","doi-asserted-by":"publisher","first-page":"30","DOI":"10.46586\/tches.v2023.i3.30-73","volume":"2023","author":"C Dobraunig","year":"2023","unstructured":"Dobraunig, C., Grassi, L., Helminger, L., Rechberger, C., Schofnegger, M., Walch, R.: Pasta: a case for hybrid homomorphic encryption. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2023(3), 30\u201373 (2023)","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst."},{"issue":"10","key":"7_CR20","doi-asserted-by":"publisher","first-page":"4496","DOI":"10.1109\/TIT.2006.881719","volume":"52","author":"F Didier","year":"2006","unstructured":"Didier, F.: A new upper bound on the block error probability after decoding over the erasure channel. IEEE Trans. Inf. Theory 52(10), 4496\u20134503 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"7_CR21","doi-asserted-by":"publisher","unstructured":"Duval, S., Lallemand, V., Rotella, Y.: Cryptanalysis of the FLIP family of stream ciphers. In: Robshaw, M., Katz, J. (eds.) Advances in Cryptology \u2013 CRYPTO 2016. CRYPTO 2016. LNCS, vol. 9814, pp. 457\u2013475. Springer, Berlin, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4_17","DOI":"10.1007\/978-3-662-53018-4_17"},{"issue":"1","key":"7_CR22","first-page":"373","volume":"2021","author":"S Duval","year":"2021","unstructured":"Duval, S., M\u00e9aux, P., Momin, C., Standaert, F.-X.: Exploring crypto-physical dark matter and learning with physical rounding towards secure and efficient fresh re-keying. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2021(1), 373\u2013401 (2021)","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst."},{"issue":"9","key":"7_CR23","doi-asserted-by":"publisher","first-page":"3035","DOI":"10.1007\/s10623-023-01220-w","volume":"91","author":"A Dupin","year":"2023","unstructured":"Dupin, A., M\u00e9aux, P., Rossi, M.: On the algebraic immunity - resiliency trade-off, implications for goldreich\u2019s pseudorandom generator. Des. Codes Cryptogr. 91(9), 3035\u20133079 (2023)","journal-title":"Des. Codes Cryptogr."},{"key":"7_CR24","doi-asserted-by":"publisher","unstructured":"Daemen, J., Rijmen, V.: The Design of Rijndael - The Advanced Encryption Standard (AES), 2nd edn. Springer, Information Security and Cryptography. Springer, Berlin, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-662-04722-4","DOI":"10.1007\/978-3-662-04722-4"},{"key":"7_CR25","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S0022-4049(99)00005-5","volume":"139","author":"J-C Faug\u00e8re","year":"1999","unstructured":"Faug\u00e8re, J.-C.: A new efficient algorithm for computing groebner bases. J. Pure Appl. Algebra 139, 61\u201388 (1999)","journal-title":"J. Pure Appl. Algebra"},{"key":"7_CR26","unstructured":"Faug\u00e8re, J.-C.: A new efficient algorithm for computing Grobner bases without reduction to zero. In: Workshop on Application of Groebner Bases 2002, Catania, Spain (2002)"},{"key":"7_CR27","unstructured":"Fisher, R.A., Yates, F.: Statistical Tables for Biological, Agricultural and Medical Research. Hafner Publishing Company, London (1953)"},{"key":"7_CR28","doi-asserted-by":"publisher","unstructured":"Gilbert, H., Heim Boissier, R., Jean, J., Reinhard, J.R.: Cryptanalysis of Elisabeth-4. In: Guo, J., Steinfeld, R. (eds.) Advances in Cryptology \u2013 ASIACRYPT 2023. ASIACRYPT 2023. LNCS, vol. 14440, pp. 256\u2013284. Springer, Singapore (2023). https:\/\/doi.org\/10.1007\/978-981-99-8727-6_9","DOI":"10.1007\/978-981-99-8727-6_9"},{"key":"7_CR29","doi-asserted-by":"publisher","unstructured":"Geelen, R., Iliashenko, I., Kang, J., Vercauteren, F.: On polynomial functions modulo $${p}^{\\text{e}}$$ and faster bootstrapping for homomorphic encryption. In: Hazay, C., Stam, M. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2023. EUROCRYPT 2023. LNCS, vol. 14006, pp. 257\u2013286. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30620-4_9","DOI":"10.1007\/978-3-031-30620-4_9"},{"key":"7_CR30","doi-asserted-by":"publisher","unstructured":"Goldreich, O.: Candidate one-way functions based on expander graphs. In: Goldreich, O. (ed.) Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation. LNCS, vol. 6650, pp. 76\u201387. Springer, Berlin, Heidelberg (2000). https:\/\/doi.org\/10.1007\/978-3-642-22670-0_10","DOI":"10.1007\/978-3-642-22670-0_10"},{"key":"7_CR31","doi-asserted-by":"publisher","unstructured":"Ha, J., Kim, S., Lee, B., Lee, J., Son, M.: Rubato: noisy ciphers for approximate homomorphic encryption. In: Dunkelman, O., Dziembowski, S. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2022. EUROCRYPT 2022. LNCS, vol. 13275, pp. 581\u2013610. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-06944-4_20","DOI":"10.1007\/978-3-031-06944-4_20"},{"key":"7_CR32","doi-asserted-by":"publisher","unstructured":"Hoffmann, C., Meaux, P., Momin, C., Rotella, Y., Standaert, F.X., Udvarhelyi, B.: Learning with physical rounding for linear and quadratic leakage functions. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology \u2013 CRYPTO 2023. CRYPTO 2023. LNCS, vol. 14083, pp. 410\u2013439. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38548-3_14","DOI":"10.1007\/978-3-031-38548-3_14"},{"key":"7_CR33","unstructured":"Knuth, D.E.: Seminumerical Algorithms, volume 2 of The Art of Computer Programming, third edition. Addison-Wesley Professional, Boston, November 1997"},{"issue":"1","key":"7_CR34","first-page":"501","volume":"2023","author":"K Kluczniak","year":"2023","unstructured":"Kluczniak, K., Schild, L.: FDFB: full domain functional bootstrapping towards practical fully homomorphic encryption. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2023(1), 501\u2013537 (2023)","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst."},{"key":"7_CR35","doi-asserted-by":"publisher","unstructured":"Meaux, P., Carlet, C., Journault, A., Standaert, F.X.: Improved filter permutators for efficient FHE: better instances and implementations. In: Hao, F., Ruj, S., Sen Gupta, S. (eds.) Progress in Cryptology \u2013 INDOCRYPT 2019. INDOCRYPT 2019. LNCS, vol. 11898, pp. 68\u201391. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35423-7_4","DOI":"10.1007\/978-3-030-35423-7_4"},{"key":"7_CR36","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/j.dam.2022.05.021","volume":"320","author":"P M\u00e9aux","year":"2022","unstructured":"M\u00e9aux, P.: On the algebraic immunity of direct sum constructions. Discret. Appl. Math. 320, 223\u2013234 (2022)","journal-title":"Discret. Appl. Math."},{"key":"7_CR37","doi-asserted-by":"crossref","unstructured":"Ma, S., Huang, T., Wang, A., Wang, X.: Fast and accurate: efficient full-domain functional bootstrap and digit decomposition for homomorphic computation. IACR Cryptol. ePrint Arch., p. 645 (2023)","DOI":"10.46586\/tches.v2024.i1.592-616"},{"key":"7_CR38","doi-asserted-by":"publisher","unstructured":"Meaux, P., Journault, A., Standaert, FX., Carlet, C.: Towards stream ciphers for efficient FHE with low-noise ciphertexts. In: Fischlin, M., Coron, J.S. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2016. EUROCRYPT 2016. LNCS, vol. 9665, pp. 311\u2013343. Springer, Berlin, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49890-3_13","DOI":"10.1007\/978-3-662-49890-3_13"},{"issue":"1","key":"7_CR39","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1080\/00927872.2022.2092628","volume":"51","author":"E Specker","year":"2023","unstructured":"Specker, E., Hungerb\u00fchler, N., Wasem, M.: The ring of polyfunctions over z\/nz. Commun. Algebra 51(1), 116\u2013134 (2023)","journal-title":"Commun. Algebra"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 INDOCRYPT 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-56232-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,28]],"date-time":"2024-03-28T14:06:42Z","timestamp":1711634802000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-56232-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031562310","9783031562327"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-56232-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"29 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"INDOCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in India","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Goa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","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":"10 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"indocrypt2023","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":"74","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":"27","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":"36% - 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","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)"}}]}}