{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T08:55:35Z","timestamp":1765961735203,"version":"3.48.0"},"publisher-location":"Singapore","reference-count":32,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819987207"},{"type":"electronic","value":"9789819987214"}],"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-8721-4_9","type":"book-chapter","created":{"date-parts":[[2023,12,17]],"date-time":"2023-12-17T05:01:44Z","timestamp":1702789304000},"page":"272-301","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Robust Publicly Verifiable Covert Security: Limited Information Leakage and\u00a0Guaranteed Correctness with\u00a0Low Overhead"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1722-6746","authenticated-orcid":false,"given":"Yi","family":"Liu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5780-8463","authenticated-orcid":false,"given":"Junzuo","family":"Lai","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9780-5443","authenticated-orcid":false,"given":"Qi","family":"Wang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4316-3286","authenticated-orcid":false,"given":"Xianrui","family":"Qin","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7958-6571","authenticated-orcid":false,"given":"Anjia","family":"Yang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4067-8230","authenticated-orcid":false,"given":"Jian","family":"Weng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,18]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, N., Bell, J., Gasc\u00f3n, A., Kusner, M.J.: MPC-friendly commitments for publicly verifiable covert security. In: Kim, Y., Kim, J., Vigna, G., Shi, E. (eds.) 2021 ACM SIGSAC Conference on Computer and Communications Security, CCS 2021, Virtual Event, Republic of Korea, 15\u201319 November 2021, pp. 2685\u20132704. ACM (2021)","DOI":"10.1145\/3460120.3485375"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/978-3-642-34961-4_41","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"G Asharov","year":"2012","unstructured":"Asharov, G., Orlandi, C.: Calling out cheaters: covert security with public verifiability. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol. 7658, pp. 681\u2013698. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34961-4_41"},{"key":"9_CR3","doi-asserted-by":"publisher","unstructured":"Attema, T., Dunning, V., Everts, M.H., Langenkamp, P.: Efficient compiler to covert security with public verifiability for honest majority MPC. In: Ateniese, G., Venturi, D. (eds.) Proceedings of the 20th International Conference on Applied Cryptography and Network Security, ACNS 2022, Rome, Italy, 20\u201323 June 2022. LNCS, vol. 13269, pp. 663\u2013683. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-09234-3_33","DOI":"10.1007\/978-3-031-09234-3_33"},{"issue":"2","key":"9_CR4","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s00145-009-9040-7","volume":"23","author":"Y Aumann","year":"2010","unstructured":"Aumann, Y., Lindell, Y.: Security against covert adversaries: efficient protocols for realistic adversaries. J. Cryptol. 23(2), 281\u2013343 (2010)","journal-title":"J. Cryptol."},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Bellare, M., Hoang, V.T., Rogaway, P.: Foundations of garbled circuits. In: Yu, T., Danezis, G., Gligor, V.D. (eds.) The ACM Conference on Computer and Communications Security, CCS 2012, Raleigh, NC, USA, 16\u201318 October 2012, pp. 784\u2013796. ACM (2012)","DOI":"10.1145\/2382196.2382279"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Cleve, R.: Limits on the security of coin flips when half the processors are faulty (extended abstract). In: Hartmanis, J. (ed.) Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 28\u201330 May 1986, Berkeley, California, USA, pp. 364\u2013369. ACM (1986)","DOI":"10.1145\/12130.12168"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-319-93387-0_16","volume-title":"Applied Cryptography and Network Security","author":"G Couteau","year":"2018","unstructured":"Couteau, G.: New protocols for secure equality test and comparison. In: Preneel, B., Vercauteren, F. (eds.) ACNS 2018. LNCS, vol. 10892, pp. 303\u2013320. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93387-0_16"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/978-3-642-11799-2_9","volume-title":"Theory of Cryptography","author":"I Damg\u00e5rd","year":"2010","unstructured":"Damg\u00e5rd, I., Geisler, M., Nielsen, J.B.: From passive to covert security at low cost. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol. 5978, pp. 128\u2013145. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11799-2_9"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1007\/978-3-030-56880-1_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"I Damg\u00e5rd","year":"2020","unstructured":"Damg\u00e5rd, I., Orlandi, C., Simkin, M.: Black-box transformations from passive to covert security with public verifiability. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020, Part II. LNCS, vol. 12171, pp. 647\u2013676. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_23"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"782","DOI":"10.1007\/978-3-030-77886-6_27","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"S Faust","year":"2021","unstructured":"Faust, S., Hazay, C., Kretzler, D., Schlosser, B.: Generic compiler for publicly verifiable covert multi-party computation. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021, Part II. LNCS, vol. 12697, pp. 782\u2013811. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_27"},{"key":"9_CR11","doi-asserted-by":"publisher","unstructured":"Faust, S., Hazay, C., Kretzler, D., Schlosser, B.: Financially backed covert security. In: Hanaoka, G., Shikata, J., Watanabe, Y. (eds.) Public-Key Cryptography - PKC 2022, Part II\u201325th IACR International Conference on Practice and Theory of Public-Key Cryptography, Proceedings, Virtual Event. LNCS, 8\u201311 March 2022, vol. 13178, pp. 99\u2013129. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-97131-1_4","DOI":"10.1007\/978-3-030-97131-1_4"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: The Foundations of Cryptography - Volume 2: Basic Applications. Cambridge University Press (2004)","DOI":"10.1017\/CBO9780511721656"},{"issue":"3","key":"9_CR13","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":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/978-3-540-78967-3_17","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"V Goyal","year":"2008","unstructured":"Goyal, V., Mohassel, P., Smith, A.: Efficient two party and multi party computation against covert adversaries. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 289\u2013306. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78967-3_17"},{"key":"9_CR15","series-title":"Information Security and Cryptography","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14303-8","volume-title":"Efficient Secure Two-Party Protocols - Techniques and Constructions","author":"C Hazay","year":"2010","unstructured":"Hazay, C., Lindell, Y.: Efficient Secure Two-Party Protocols - Techniques and Constructions. Information Security and Cryptography, Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14303-8"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/978-3-030-45388-6_12","volume-title":"Public-Key Cryptography \u2013 PKC 2020","author":"C Hazay","year":"2020","unstructured":"Hazay, C., Shelat, A., Venkitasubramaniam, M.: Going beyond dual execution: MPC for functions with efficient verification. In: Kiayias, A., Kohlweiss, M., Wallden, P., Zikas, V. (eds.) PKC 2020, Part II. LNCS, vol. 12111, pp. 328\u2013356. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45388-6_12"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-030-17659-4_4","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"C Hong","year":"2019","unstructured":"Hong, C., Katz, J., Kolesnikov, V., Lu, W., Wang, X.: Covert security with public verifiability: faster, leaner, and simpler. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019, Part III. LNCS, vol. 11478, pp. 97\u2013121. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_4"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Huang, Y., Katz, J., Evans, D.: Quid-pro-quo-tocols: strengthening semi-honest protocols with dual execution. In: IEEE Symposium on Security and Privacy, SP 2012, 21\u201323 May 2012, San Francisco, California, USA, pp. 272\u2013284. IEEE Computer Society (2012)","DOI":"10.1109\/SP.2012.43"},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-642-40084-1_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"Y Huang","year":"2013","unstructured":"Huang, Y., Katz, J., Evans, D.: Efficient secure two-party computation using symmetric cut-and-choose. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part II. LNCS, vol. 8043, pp. 18\u201335. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_2"},{"key":"9_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-662-48800-3_9","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"V Kolesnikov","year":"2015","unstructured":"Kolesnikov, V., Malozemoff, A.J.: Public verifiability in the covert model (almost) for free. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015, Part II. LNCS, vol. 9453, pp. 210\u2013235. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48800-3_9"},{"key":"9_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-662-46494-6_11","volume-title":"Theory of Cryptography","author":"V Kolesnikov","year":"2015","unstructured":"Kolesnikov, V., Mohassel, P., Riva, B., Rosulek, M.: Richer efficiency\/security trade-offs in 2PC. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015, Part I. LNCS, vol. 9014, pp. 229\u2013259. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46494-6_11"},{"issue":"2","key":"9_CR22","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/s00145-015-9198-0","volume":"29","author":"Y Lindell","year":"2016","unstructured":"Lindell, Y.: Fast cut-and-choose-based protocols for malicious and covert adversaries. J. Cryptol. 29(2), 456\u2013490 (2016)","journal-title":"J. Cryptol."},{"issue":"2","key":"9_CR23","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s00145-008-9036-8","volume":"22","author":"Y Lindell","year":"2009","unstructured":"Lindell, Y., Pinkas, B.: A proof of security of Yao\u2019s protocol for two-party computation. J. Cryptol. 22(2), 161\u2013188 (2009). https:\/\/doi.org\/10.1007\/s00145-008-9036-8","journal-title":"J. Cryptol."},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"Liu, Y., Lai, J., Wang, Q., Qin, X., Yang, A., Weng, J.: Robust publicly verifiable covert security: limited information leakage and guaranteed correctness with low overhead. Cryptology ePrint Archive, Paper 2023\/1392 (2023). https:\/\/eprint.iacr.org\/2023\/1392","DOI":"10.1007\/978-981-99-8721-4_9"},{"key":"9_CR25","doi-asserted-by":"publisher","unstructured":"Liu, Y., Wang, Q., Yiu, S.: Making private function evaluation safer, faster, and simpler. In: Hanaoka, G., Shikata, J., Watanabe, Y. (eds.) Public-Key Cryptography - PKC 2022\u201325th IACR International Conference on Practice and Theory of Public-Key Cryptography, Virtual Event, 8\u201311 March 2022, Proceedings, Part I. LNCS, vol. 13177, pp. 349\u2013378. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-97121-2_13","DOI":"10.1007\/978-3-030-97121-2_13"},{"key":"9_CR26","doi-asserted-by":"publisher","unstructured":"Liu, Y., Wang, Q., Yiu, S.: Towards practical homomorphic time-lock puzzles: applicability and verifiability. In: Atluri, V., Pietro, R.D., Jensen, C.D., Meng, W. (eds.) Proceedings of the 27th European Symposium on Research in Computer Security, ESORICS 2022, Copenhagen, Denmark, 26\u201330 September 2022, Part I. LNCS, vol. 13554, pp. 424\u2013443. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-17140-6_21","DOI":"10.1007\/978-3-031-17140-6_21"},{"key":"9_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1007\/11745853_30","volume-title":"Public Key Cryptography - PKC 2006","author":"P Mohassel","year":"2006","unstructured":"Mohassel, P., Franklin, M.: Efficiency tradeoffs for malicious two-party computation. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T. (eds.) PKC 2006. LNCS, vol. 3958, pp. 458\u2013473. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11745853_30"},{"key":"9_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-642-40084-1_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"P Mohassel","year":"2013","unstructured":"Mohassel, P., Riva, B.: Garbled circuits checking garbled circuits: more efficient and secure two-party computation. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part II. LNCS, vol. 8043, pp. 36\u201353. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_3"},{"key":"9_CR29","unstructured":"Rindal, P., Rosulek, M.: Faster malicious 2-party secure computation with online\/offline dual execution. In: Holz, T., Savage, S. (eds.) 25th USENIX Security Symposium, USENIX Security 16, Austin, TX, USA, 10\u201312 August 2016, pp. 297\u2013314. USENIX Association (2016)"},{"key":"9_CR30","doi-asserted-by":"crossref","unstructured":"Rindal, P., Rosulek, M.: Malicious-secure private set intersection via dual execution. In: Thuraisingham, B., Evans, D., Malkin, T., Xu, D. (eds.) Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS 2017, Dallas, TX, USA, 30 October\u201303 November 2017, pp. 1229\u20131242. ACM (2017)","DOI":"10.1145\/3133956.3134044"},{"key":"9_CR31","unstructured":"Scholl, P., Simkin, M., Siniscalchi, L.: Multiparty computation with covert security and public verifiability. Cryptology ePrint Archive, Report 2021\/366 (2021). https:\/\/ia.cr\/2021\/366"},{"key":"9_CR32","doi-asserted-by":"crossref","unstructured":"Zhu, R., Ding, C., Huang, Y.: Efficient publicly verifiable 2PC over a blockchain with applications to financially-secure computations. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J. (eds.) Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, CCS 2019, London, UK, 11\u201315 November 2019, pp. 633\u2013650. ACM (2019)","DOI":"10.1145\/3319535.3363215"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-8721-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T01:02:21Z","timestamp":1765933341000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-8721-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9789819987207","9789819987214"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-8721-4_9","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":"18 December 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":"Guangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"4 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2023\/","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":"375","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":"106","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","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":"12","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"}]}}