{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:36:52Z","timestamp":1766281012332,"version":"3.40.3"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030920678"},{"type":"electronic","value":"9783030920685"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-92068-5_18","type":"book-chapter","created":{"date-parts":[[2021,11,30]],"date-time":"2021-11-30T20:34:17Z","timestamp":1638304457000},"page":"526-556","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["Compressed $$\\varSigma $$-Protocols for\u00a0Bilinear Group Arithmetic Circuits and\u00a0Application to\u00a0Logarithmic Transparent Threshold Signatures"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Attema","sequence":"first","affiliation":[]},{"given":"Ronald","family":"Cramer","sequence":"additional","affiliation":[]},{"given":"Matthieu","family":"Rambaud","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,1]]},"reference":[{"key":"18_CR1","unstructured":"Full version of this paper. IACR ePrint 2020\/1147"},{"issue":"2","key":"18_CR2","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s00145-014-9196-7","volume":"29","author":"M Abe","year":"2015","unstructured":"Abe, M., Fuchsbauer, G., Groth, J., Haralambiev, K., Ohkubo, M.: Structure-preserving signatures and commitments to group elements. J. Cryptol. 29(2), 363\u2013421 (2015). https:\/\/doi.org\/10.1007\/s00145-014-9196-7","journal-title":"J. Cryptol."},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Ateniese, G., Camenisch, J., Hohenberger, S., de Medeiros, B.: Practical group signatures without random oracles. IACR ePrint 2005\/385 (2005)","DOI":"10.1007\/978-3-540-30598-9_10"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/978-3-030-56877-1_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"T Attema","year":"2020","unstructured":"Attema, T., Cramer, R.: Compressed $$\\Sigma $$-protocol theory and\u00a0practical application\u00a0to\u00a0plug\u00a0&\u00a0play secure algorithmics. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12172, pp. 513\u2013543. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_18"},{"key":"18_CR5","unstructured":"Attema, T., Cramer, R., Fehr, S.: Compressing proofs of $$k$$-out-of-$$n$$-partial knowledge. IACR ePrint 2020\/753 (2020)"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/978-3-030-84245-1_19","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"T Attema","year":"2021","unstructured":"Attema, T., Cramer, R., Kohl, L.: A compressed $$\\Sigma $$-protocol theory for\u00a0lattices. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12826, pp. 549\u2013579. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_19"},{"key":"18_CR7","unstructured":"Ballard, L., Green, M., de Medeiros, B., Monrose, F.: Correlation-resistant storage via keyword-searchable encryption. IACR ePrint 2005\/417 (2005)"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: ACM CCS 1993 (1993)","DOI":"10.1145\/168588.168596"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/3-540-36288-6_3","volume-title":"Public Key Cryptography \u2014 PKC 2003","author":"A Boldyreva","year":"2003","unstructured":"Boldyreva, A.: Threshold signatures, multisignatures and blind signatures based on the gap-Diffie-Hellman-group signature scheme. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol. 2567, pp. 31\u201346. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36288-6_3"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-45682-1_30","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2001","author":"D Boneh","year":"2001","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 514\u2013532. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45682-1_30"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-662-49896-5_12","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"J Bootle","year":"2016","unstructured":"Bootle, J., Cerulli, A., Chaidos, P., Groth, J., Petit, C.: Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 327\u2013357. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_12"},{"key":"18_CR12","unstructured":"Boyle, E., Cohen, R., Goel, A.: Breaking the $$O(\\sqrt{n})$$-bits barrier: balanced byzantine agreement with polylog bits per-party. In: To Appear in ACM PODC (2021)"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"B\u00fcnz, B., Bootle, J., Boneh, D., Poelstra, A., Wuille, P., Maxwell, G.: Bulletproofs: short proofs for confidential transactions and more. In: IEEE S&P (2018)","DOI":"10.1109\/SP.2018.00020"},{"key":"18_CR14","unstructured":"B\u00fcnz, B., Maller, M., Mishra, P., Vesely, N.: Proofs for inner pairing products and applications. IACR ePrint 2019\/1177 (2019)"},{"issue":"3","key":"18_CR15","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s00145-005-0318-0","volume":"18","author":"C Cachin","year":"2005","unstructured":"Cachin, C., Kursawe, K., Shoup, V.: Random oracles in Constantinople: practical asynchronous byzantine agreement using cryptography. J. Cryptol. 18(3), 219\u2013246 (2005). https:\/\/doi.org\/10.1007\/s00145-005-0318-0","journal-title":"J. Cryptol."},{"key":"18_CR16","unstructured":"Canetti, R.: Universally composable signature, certification, and authentication. In: IEEE Computer Security Foundations Workshop 2004 (2004)"},{"key":"18_CR17","unstructured":"Cramer, R.: Modular design of secure yet practical cryptographic protocols. Ph.D. thesis, CWI and University of Amsterdam (1996)"},{"key":"18_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/BFb0055745","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201998","author":"R Cramer","year":"1998","unstructured":"Cramer, R., Damg\u00e5rd, I.: Zero-knowledge proofs for finite field arithmetic, or: can zero-knowledge be for free? In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 424\u2013441. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0055745"},{"key":"18_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-642-32284-6_4","volume-title":"Information Theoretic Security","author":"R Cramer","year":"2012","unstructured":"Cramer, R., Damg\u00e5rd, I., Pastro, V.: On the amortized complexity of zero knowledge protocols for multiplicative relations. In: Smith, A. (ed.) ICITS 2012. LNCS, vol. 7412, pp. 62\u201379. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32284-6_4"},{"key":"18_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/0-387-34805-0_28","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 89 Proceedings","author":"Y Desmedt","year":"1990","unstructured":"Desmedt, Y., Frankel, Y.: Threshold cryptosystems. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 307\u2013315. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_28"},{"key":"18_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-47721-7_12","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 86","author":"A Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186\u2013194. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_12"},{"key":"18_CR22","doi-asserted-by":"publisher","first-page":"3113","DOI":"10.1016\/j.dam.2007.12.010","volume":"156","author":"SD Galbraith","year":"2008","unstructured":"Galbraith, S.D., Paterson, K.G., Smart, N.P.: Pairings for cryptographers. Discret. Appl. Math 156, 3113\u20133121 (2008)","journal-title":"Discret. Appl. Math"},{"key":"18_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/3-540-39568-7_2","volume-title":"Advances in Cryptology","author":"T ElGamal","year":"1985","unstructured":"ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. In: Blakley, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 10\u201318. Springer, Heidelberg (1985). https:\/\/doi.org\/10.1007\/3-540-39568-7_2"},{"key":"18_CR24","unstructured":"Gennaro, R., Goldfeder, S.: One round threshold ECDSA with identifiable abort. IACR ePrint 2020\/540 (2020)"},{"key":"18_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/3-540-68339-9_31","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201996","author":"R Gennaro","year":"1996","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Robust threshold DSS signatures. In: Maurer, U. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 354\u2013371. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68339-9_31"},{"key":"18_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/3-540-36563-X_26","volume-title":"Topics in Cryptology \u2014 CT-RSA 2003","author":"R Gennaro","year":"2003","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Secure applications of Pedersen\u2019s distributed key generation protocol. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol. 2612, pp. 373\u2013390. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36563-X_26"},{"key":"18_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-030-84252-9_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"A Ghoshal","year":"2021","unstructured":"Ghoshal, A., Tessaro, S.: Tight state-restoration soundness in the algebraic group model. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12827, pp. 64\u201393. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84252-9_3"},{"key":"18_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-540-78967-3_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"J Groth","year":"2008","unstructured":"Groth, J., Sahai, A.: Efficient non-interactive proof systems for bilinear groups. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 415\u2013432. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78967-3_24"},{"key":"18_CR29","unstructured":"Haque, A., Krenn, S., Slamanig, D., Striecks, C.: Logarithmic-size (linkable) threshold ring signatures in the plain model. IACR ePrint 2020\/683 (2020)"},{"key":"18_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/978-3-319-93387-0_2","volume-title":"Applied Cryptography and Network Security","author":"Y Harchol","year":"2018","unstructured":"Harchol, Y., Abraham, I., Pinkas, B.: Distributed SSH key management with proactive RSA threshold signatures. In: Preneel, B., Vercauteren, F. (eds.) ACNS 2018. LNCS, vol. 10892, pp. 22\u201343. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93387-0_2"},{"key":"18_CR31","doi-asserted-by":"crossref","unstructured":"Hoffmann, M., Kloo\u00df, M., Rupp, A.: Efficient zero-knowledge arguments in the discrete log setting, revisited. In: ACM CCS 2019 (2019)","DOI":"10.1145\/3319535.3354251"},{"key":"18_CR32","unstructured":"Hopwood, D., Bowe, S., Hornby, T., Wilcox, N.: Zcash Protocol Specication - Version 2020.1.7 (2020)"},{"key":"18_CR33","doi-asserted-by":"crossref","unstructured":"Kokoris-Kogias, E., Spiegelman, A., Malkhi, D.: Asynchronous distributed key generation for computationally-secure randomness, consensus, and threshold signatures. In: ACM CCS 2020 (2020)","DOI":"10.1145\/3372297.3423364"},{"key":"18_CR34","doi-asserted-by":"crossref","unstructured":"Komlo, C., Goldberg, I.: FROST: flexible round-optimized Schnorr threshold signatures. In: SAC 2020, pp. 34\u201365 (2020)","DOI":"10.1007\/978-3-030-81652-0_2"},{"key":"18_CR35","doi-asserted-by":"crossref","unstructured":"Lai, R.W.F., Malavolta, G., Ronge, V.: Succinct arguments for bilinear group arithmetic: practical structure-preserving cryptography. In: ACM CCS 2019, pp. 2057\u20132074 (2019)","DOI":"10.1145\/3319535.3354262"},{"key":"18_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2016.02.031","volume":"645","author":"B Libert","year":"2016","unstructured":"Libert, B., Joye, M., Yung, M.: Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares. Theor. Comput. Sci. 645, 1\u201324 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR37","unstructured":"Libra Team: State machine replication in the LibraBlockchain, version 2019\u201310-24 (2019)"},{"issue":"3","key":"18_CR38","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s00145-002-0143-7","volume":"16","author":"Y Lindell","year":"2003","unstructured":"Lindell, Y.: Parallel coin-tossing and constant-round secure two-party computation. J. Cryptol. 16(3), 143\u2013184 (2003). https:\/\/doi.org\/10.1007\/s00145-002-0143-7","journal-title":"J. Cryptol."},{"key":"18_CR39","unstructured":"Nayak, K., Ren, L., Shi, E., Vaidya, N.H., Xiang, Z.: Improved extension protocols for byzantine broadcast and agreement. In: DISC 2020, pp. 28:1\u201328:17 (2020)"},{"key":"18_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201991","author":"TP Pedersen","year":"1992","unstructured":"Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 129\u2013140. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_9"},{"key":"18_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/11426639_27","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"A Sahai","year":"2005","unstructured":"Sahai, A., Waters, B.: Fuzzy identity-based encryption. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 457\u2013473. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11426639_27"},{"key":"18_CR42","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22, 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"18_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/3-540-45539-6_15","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2000","author":"V Shoup","year":"2000","unstructured":"Shoup, V.: Practical threshold signatures. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 207\u2013220. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45539-6_15"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-92068-5_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,30]],"date-time":"2024-11-30T00:09:46Z","timestamp":1732925386000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92068-5_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030920678","9783030920685"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92068-5_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"1 December 2021","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":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2021\/","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":"341","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":"95","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.21","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.61","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":"The conference was held online due to the COVID-19 pandemic","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}