{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:17:05Z","timestamp":1742941025047,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031478178"},{"type":"electronic","value":"9783031478185"}],"license":[{"start":{"date-parts":[[2023,12,4]],"date-time":"2023-12-04T00:00:00Z","timestamp":1701648000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,4]],"date-time":"2023-12-04T00:00:00Z","timestamp":1701648000000},"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-47818-5_7","type":"book-chapter","created":{"date-parts":[[2023,12,4]],"date-time":"2023-12-04T00:02:28Z","timestamp":1701648148000},"page":"120-136","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Zero-Knowledge Systems from\u00a0MPC-in-the-Head and\u00a0Oblivious Transfer"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0147-2566","authenticated-orcid":false,"given":"Cyprien","family":"Delpech de Saint Guilhem","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6917-7734","authenticated-orcid":false,"given":"Ehsan","family":"Ebrahimi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3792-4042","authenticated-orcid":false,"given":"Barry","family":"van Leeuwen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,4]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","unstructured":"Aguilar Melchor, C., Gama, N., Howe, J., H\u00fclsing, A., Joseph, D., Yue, D.: The return of the SDitH. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023, Part V. LNCS, April 2023, vol. 14008, pp. 564\u2013596. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_20","DOI":"10.1007\/978-3-031-30589-4_20"},{"key":"7_CR2","doi-asserted-by":"publisher","unstructured":"Ambainis, A., Rosmanis, A., Unruh, D.: Quantum attacks on classical proof systems: the hardness of quantum rewinding. In: 55th FOCS, October 2014, pp. 474\u2013483. IEEE Computer Society Press (2014). https:\/\/doi.org\/10.1109\/FOCS.2014.57","DOI":"10.1109\/FOCS.2014.57"},{"key":"7_CR3","doi-asserted-by":"publisher","unstructured":"Badrinarayanan, S., Masny, D., Mukherjee, P., Patranabis, S., Raghuraman, S., Sarkar, P.: Round-optimal oblivious transfer and MPC from computational CSIDH. In: Boldyreva, A., Kolesnikov, V. (eds.) PKC 2023, Part I. LNCS, May 2023, vol. 13940, pp. 376\u2013405. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-31368-4_14","DOI":"10.1007\/978-3-031-31368-4_14"},{"key":"7_CR4","unstructured":"Barreto, P.S.L.M., David, B., Dowsley, R., Morozov, K., Nascimento, A.C.A.: A framework for efficient adaptively secure composable oblivious transfer in the ROM. Cryptology ePrint Archive, Report 2017\/993 (2017). https:\/\/eprint.iacr.org\/2017\/993"},{"key":"7_CR5","doi-asserted-by":"publisher","unstructured":"Baum, C., et al.: Publicly verifiable zero-knowledge and post-quantum signatures from vole-in-the-head. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology, CRYPTO 2023, pp. 581\u2013615. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_19","DOI":"10.1007\/978-3-031-38554-4_19"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-030-75245-3_11","volume-title":"Public-Key Cryptography \u2013 PKC 2021","author":"C Baum","year":"2021","unstructured":"Baum, C., de Saint Guilhem, C.D., Kales, D., Orsini, E., Scholl, P., Zaverucha, G.: Banquet: short and fast signatures from AES. In: Garay, J.A. (ed.) PKC 2021, Part I. LNCS, vol. 12710, pp. 266\u2013297. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75245-3_11"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/3-540-69053-0_20","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201997","author":"M Bellare","year":"1997","unstructured":"Bellare, M., Jakobsson, M., Yung, M.: Round-optimal zero-knowledge arguments based on any one-way function. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 280\u2013305. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-69053-0_20"},{"key":"7_CR8","doi-asserted-by":"publisher","unstructured":"Bitansky, N., Kalai, Y.T., Paneth, O.: Multi-collision resistance: a paradigm for keyless hash functions. In: Diakonikolas, I., Kempe, D., Henzinger, M. (eds.) Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, 25\u201329 June 2018, pp. 671\u2013684. ACM (2018). https:\/\/doi.org\/10.1145\/3188745.3188870","DOI":"10.1145\/3188745.3188870"},{"key":"7_CR9","doi-asserted-by":"publisher","unstructured":"Blazy, O., Chevalier, C., Vu, Q.H.: Post-quantum UC-secure oblivious transfer in the standard model with adaptive corruptions. In: Proceedings of the 14th International Conference on Availability, Reliability and Security, ARES 2019, pp. 28:1\u201328:6. ACM (2019). https:\/\/doi.org\/10.1145\/3339252.3339280","DOI":"10.1145\/3339252.3339280"},{"issue":"2","key":"7_CR10","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0022-0000(88)90005-0","volume":"37","author":"G Brassard","year":"1988","unstructured":"Brassard, G., Chaum, D., Cr\u00e9peau, C.: Minimum disclosure proofs of knowledge. J. Comput. Syst. Sci. 37(2), 156\u2013189 (1988). https:\/\/doi.org\/10.1016\/0022-0000(88)90005-0","journal-title":"J. Comput. Syst. Sci."},{"key":"7_CR11","unstructured":"Canetti, R.: Security and composition of multi-party cryptographic protocols. Cryptology ePrint Archive, Report 1998\/018 (1998). https:\/\/eprint.iacr.org\/1998\/018"},{"key":"7_CR12","doi-asserted-by":"publisher","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: 42nd FOCS, October 2001, pp. 136\u2013145. IEEE Computer Society Press (2001). https:\/\/doi.org\/10.1109\/SFCS.2001.959888","DOI":"10.1109\/SFCS.2001.959888"},{"key":"7_CR13","doi-asserted-by":"publisher","unstructured":"Chia, N.H., Chung, K.M., Liu, Q., Yamakawa, T.: On the impossibility of post-quantum black-box zero-knowledge in constant round. In: 62nd FOCS, February 2022, pp. 59\u201367. IEEE Computer Society Press (2022). https:\/\/doi.org\/10.1109\/FOCS52979.2021.00015","DOI":"10.1109\/FOCS52979.2021.00015"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-319-12280-9_10","volume-title":"Cryptology and Network Security","author":"B David","year":"2014","unstructured":"David, B., Dowsley, R., Nascimento, A.C.A.: Universally composable oblivious transfer based on a variant of LPN. In: Gritzalis, D., Kiayias, A., Askoxylakis, I. (eds.) CANS 2014. LNCS, vol. 8813, pp. 143\u2013158. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-12280-9_10"},{"key":"7_CR15","doi-asserted-by":"publisher","unstructured":"Delpech de Saint Guilhem, C., Orsini, E., Tanguy, T.: Limbo: efficient zero-knowledge MPCitH-based arguments. In: Vigna, G., Shi, E. (eds.) ACM CCS 2021, November 2021, pp. 3022\u20133036. ACM Press (2021). https:\/\/doi.org\/10.1145\/3460120.3484595","DOI":"10.1145\/3460120.3484595"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Delpech de Saint Guilhem, C., Orsini, E., Tanguy, T., Verbauwhede, M.: Efficient proof of RAM programs from any public-coin zero-knowledge system. Cryptology ePrint Archive, Report 2022\/313 (2022). https:\/\/eprint.iacr.org\/2022\/313","DOI":"10.1007\/978-3-031-14791-3_27"},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"768","DOI":"10.1007\/978-3-030-45724-2_26","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"N D\u00f6ttling","year":"2020","unstructured":"D\u00f6ttling, N., Garg, S., Hajiabadi, M., Masny, D., Wichs, D.: Two-round oblivious transfer from CDH or LPN. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12106, pp. 768\u2013797. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_26"},{"key":"7_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-78372-7_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"N Fleischhacker","year":"2018","unstructured":"Fleischhacker, N., Goyal, V., Jain, A.: On the existence of three round zero-knowledge proofs. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10822, pp. 3\u201333. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78372-7_1"},{"key":"7_CR19","unstructured":"Giacomelli, I., Madsen, J., Orlandi, C.: ZKBoo: faster zero-knowledge for Boolean circuits. In: Holz, T., Savage, S. (eds.) USENIX Security 2016, August 2016, pp. 1069\u20131083. USENIX Association (2016)"},{"key":"7_CR20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography: Basic Tools","author":"O Goldreich","year":"2001","unstructured":"Goldreich, O.: Foundations of Cryptography: Basic Tools, vol. 1. Cambridge University Press, Cambridge (2001)"},{"issue":"3","key":"7_CR21","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BF00208001","volume":"9","author":"O Goldreich","year":"1996","unstructured":"Goldreich, O., Kahan, A.: How to construct constant-round zero-knowledge proof systems for NP. J. Cryptol. 9(3), 167\u2013190 (1996)","journal-title":"J. Cryptol."},{"key":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/BFb0032038","volume-title":"Automata, Languages and Programming","author":"O Goldreich","year":"1990","unstructured":"Goldreich, O., Krawczyk, H.: On the composition of zero-knowledge proof systems. In: Paterson, M.S. (ed.) ICALP 1990. LNCS, vol. 443, pp. 268\u2013282. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/BFb0032038"},{"issue":"1","key":"7_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00195207","volume":"7","author":"O Goldreich","year":"1994","unstructured":"Goldreich, O., Oren, Y.: Definitions and properties of zero-knowledge proof systems. J. Cryptol. 7(1), 1\u201332 (1994). https:\/\/doi.org\/10.1007\/BF00195207","journal-title":"J. Cryptol."},{"issue":"1","key":"7_CR24","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM J. Comput. 18(1), 186\u2013208 (1989)","journal-title":"SIAM J. Comput."},{"key":"7_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-642-19571-6_21","volume-title":"Theory of Cryptography","author":"M Green","year":"2011","unstructured":"Green, M., Hohenberger, S.: Practical adaptive oblivious transfer from simple assumptions. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 347\u2013363. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19571-6_21"},{"key":"7_CR26","unstructured":"Hauck, E., Loss, J.: Efficient and universally composable protocols for oblivious transfer from the CDH assumption. Cryptology ePrint Archive, Report 2017\/1011 (2017). https:\/\/eprint.iacr.org\/2017\/1011"},{"issue":"3","key":"7_CR27","doi-asserted-by":"publisher","first-page":"1121","DOI":"10.1137\/080725398","volume":"39","author":"Y Ishai","year":"2009","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Zero-knowledge proofs from secure multiparty computation. SIAM J. Comput. 39(3), 1121\u20131152 (2009). https:\/\/doi.org\/10.1137\/080725398","journal-title":"SIAM J. Comput."},{"key":"7_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/978-3-540-85174-5_32","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"Y Ishai","year":"2008","unstructured":"Ishai, Y., Prabhakaran, M., Sahai, A.: Founding cryptography on oblivious transfer \u2013 efficiently. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 572\u2013591. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_32"},{"key":"7_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-319-63715-0_8","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"YT Kalai","year":"2017","unstructured":"Kalai, Y.T., Rothblum, G.N., Rothblum, R.D.: From obfuscation to the security of Fiat-Shamir for proofs. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017, Part II. LNCS, vol. 10402, pp. 224\u2013251. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63715-0_8"},{"key":"7_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-540-78524-8_5","volume-title":"Theory of Cryptography","author":"J Katz","year":"2008","unstructured":"Katz, J.: Which languages have 4-round zero-knowledge proofs? In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 73\u201388. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78524-8_5"},{"key":"7_CR31","doi-asserted-by":"publisher","unstructured":"Lai, Y.-F., Galbraith, S.D., Delpech de Saint Guilhem, C.: Compact, efficient and UC-secure isogeny-based oblivious transfer. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021, Part I. LNCS, vol. 12696, pp. 213\u2013241. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_8","DOI":"10.1007\/978-3-030-77870-5_8"},{"key":"7_CR32","doi-asserted-by":"publisher","unstructured":"Lombardi, A., Ma, F., Spooner, N.: Post-quantum zero knowledge, revisited or: how to do quantum rewinding undetectably. In: 63rd FOCS, October\/November 2022, pp. 851\u2013859. IEEE Computer Society Press (2021). https:\/\/doi.org\/10.1109\/FOCS54457.2022.00086","DOI":"10.1109\/FOCS54457.2022.00086"},{"key":"7_CR33","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.compeleceng.2019.01.021","volume":"75","author":"B Mi","year":"2019","unstructured":"Mi, B., Huang, D., Wan, S., Hu, Y., Choo, K.K.R.: A post-quantum light weight 1-out-n oblivious transfer protocol. Comput. Electr. Eng. 75, 90\u2013100 (2019). https:\/\/doi.org\/10.1016\/j.compeleceng.2019.01.021","journal-title":"Comput. Electr. Eng."},{"key":"7_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/978-3-540-78524-8_27","volume-title":"Theory of Cryptography","author":"SJ Ong","year":"2008","unstructured":"Ong, S.J., Vadhan, S.: An equivalence between zero knowledge and commitments. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 482\u2013500. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78524-8_27"},{"key":"7_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/978-3-540-85174-5_31","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"C Peikert","year":"2008","unstructured":"Peikert, C., Vaikuntanathan, V., Waters, B.: A framework for efficient and composable oblivious transfer. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 554\u2013571. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_31"},{"key":"7_CR36","unstructured":"Rabin, M.O.: How to exchange secrets with oblivious transfer. Cryptology ePrint Archive, Report 2005\/187 (2005). https:\/\/eprint.iacr.org\/2005\/187"}],"container-title":["Lecture Notes in Computer Science","Cryptography and Coding"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-47818-5_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,4]],"date-time":"2023-12-04T00:10:46Z","timestamp":1701648646000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-47818-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,4]]},"ISBN":["9783031478178","9783031478185"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-47818-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,4]]},"assertion":[{"value":"4 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IMACC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IMA International Conference on Cryptography and Coding","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"London","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","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":"12 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ima2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ima.org.uk\/21435\/19th-ima-international-conference-on-cryptography-and-coding\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36","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":"14","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":"39% - 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)"}}]}}