{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T22:22:27Z","timestamp":1746138147649,"version":"3.40.3"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030654108"},{"type":"electronic","value":"9783030654115"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-65411-5_12","type":"book-chapter","created":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T02:22:57Z","timestamp":1607480577000},"page":"235-258","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Semi-commutative Masking: A Framework for Isogeny-Based Protocols, with an Application to Fully Secure Two-Round Isogeny-Based OT"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0147-2566","authenticated-orcid":false,"given":"Cyprien Delpech","family":"de Saint Guilhem","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1917-1833","authenticated-orcid":false,"given":"Emmanuela","family":"Orsini","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3482-6743","authenticated-orcid":false,"given":"Christophe","family":"Petit","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3567-3304","authenticated-orcid":false,"given":"Nigel P.","family":"Smart","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,12,9]]},"reference":[{"key":"12_CR1","unstructured":"Adj, G., Ahmadi, O., Menezes, A.: ON isogeny graphs of supersingular elliptic curves over finite fields. Cryptology ePrint Archive, Report 2018\/132 (2018). https:\/\/eprint.iacr.org\/2018\/132"},{"key":"12_CR2","unstructured":"Azarderakhsh, R., Jalali, A., Jao, D., Soukharev, V.: Practical supersingular isogeny group key agreement. Cryptology ePrint Archive, Report 2019\/330 (2019), https:\/\/eprint.iacr.org\/2019\/330"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Azarderakhsh, R., Jao, D., Kalach, K., Koziel, B., Leonardi, C.: Key compression for isogeny-based cryptosystems. In: Emura, K., Hanaoka, G., Zhang, R. (eds.) Proceedings of the 3rd ACM International Workshop on ASIA Public-Key Cryptography, APKC, pp. 1\u201310. ACM (2016)","DOI":"10.1145\/2898420.2898421"},{"key":"12_CR4","unstructured":"Barreto, P., Oliveira, G., Benits, W.: Supersingular isogeny oblivious transfer. Cryptology ePrint Archive, Report 2018\/459 (2018). https:\/\/eprint.iacr.org\/2018\/459"},{"key":"12_CR5","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). http:\/\/eprint.iacr.org\/2017\/993"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/978-3-030-03810-6_14","volume-title":"Theory of Cryptography","author":"Z Brakerski","year":"2018","unstructured":"Brakerski, Z., D\u00f6ttling, N.: Two-message statistically sender-private OT from LWE. In: Beimel, A., Dziembowski, S. (eds.) TCC 2018. LNCS, vol. 11240, pp. 370\u2013390. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03810-6_14"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-030-35199-1_5","volume-title":"Cryptography and Coding","author":"P Branco","year":"2019","unstructured":"Branco, P., Ding, J., Goul\u00e3o, M., Mateus, P.: A framework for universally composable oblivious transfer from one-round key-exchange. In: Albrecht, M. (ed.) IMACC 2019. LNCS, vol. 11929, pp. 78\u2013101. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35199-1_5"},{"key":"12_CR8","unstructured":"Branco, P., Ding, J., Goul\u00e3o, M., Mateus, P.: A framework for universally composable oblivious transfer from one-round key-exchange. Cryptology ePrint Archive, Report 2019\/726 (2019). https:\/\/eprint.iacr.org\/2019\/726. To appear at the 17th IMA International Conference on Cryptography and Coding"},{"key":"12_CR9","series-title":"LNCS","first-page":"71","volume-title":"CT-RSA 2008","author":"E Bresson","year":"2008","unstructured":"Bresson, E., Monnerat, J., Vergnaud, D.: Separation results on the \u201cone-more\u201d computational problems. In: Malkin, T. (ed.) CT-RSA 2008. LNCS, vol. 4964, pp. 71\u201387. Springer, Heidelberg (Apr (2008)"},{"key":"12_CR10","unstructured":"Byali, M., Patra, A., Ravi, D., Sarkar, P.: Fast and universally-composable oblivious transfer and commitment scheme with adaptive security. Cryptology ePrint Archive, Report 2017\/1165 (2017). https:\/\/eprint.iacr.org\/2017\/1165"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: 42nd FOCS, pp. 136\u2013145. IEEE Computer Society Press, October 2001","DOI":"10.1109\/SFCS.2001.959888"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-030-03332-3_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"W Castryck","year":"2018","unstructured":"Castryck, W., Lange, T., Martindale, C., Panny, L., Renes, J.: CSIDH: an efficient post-quantum commutative group action. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11274, pp. 395\u2013427. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03332-3_15"},{"issue":"1","key":"12_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1515\/jmc-2012-0016","volume":"8","author":"A Childs","year":"2014","unstructured":"Childs, A., Jao, D., Soukharev, V.: Constructing elliptic curve isogenies in quantum subexponential time. J. Math. Cryptol. 8(1), 1\u201329 (2014). a pre-print version appears at https:\/\/arxiv.org\/abs\/1012.4019","journal-title":"J. Math. Cryptol."},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-319-22174-8_3","volume-title":"Progress in Cryptology \u2013 LATINCRYPT 2015","author":"T Chou","year":"2015","unstructured":"Chou, T., Orlandi, C.: The simplest protocol for oblivious transfer. In: Lauter, K., Rodr\u00edguez-Henr\u00edquez, F. (eds.) LATINCRYPT 2015. LNCS, vol. 9230, pp. 40\u201358. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-22174-8_3"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/978-3-662-53018-4_21","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"C Costello","year":"2016","unstructured":"Costello, C., Longa, P., Naehrig, M.: Efficient algorithms for supersingular isogeny Diffie-Hellman. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9814, pp. 572\u2013601. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4_21"},{"key":"12_CR16","unstructured":"Couveignes, J.M.: Hard homogeneous spaces. Cryptology ePrint Archive, Report 2006\/291 (2006). http:\/\/eprint.iacr.org\/2006\/291"},{"issue":"3","key":"12_CR17","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1515\/jmc-2012-0015","volume":"8","author":"L De Feo","year":"2014","unstructured":"De Feo, L., Jao, D., Pl\u00fbt, J.: Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies. J. Math. Cryptol. 8(3), 209\u2013247 (2014). a pre-print version appears at https:\/\/eprint.iacr.org\/2011\/506","journal-title":"J. Math. Cryptol."},{"key":"12_CR18","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"},{"issue":"11","key":"12_CR19","doi-asserted-by":"publisher","first-page":"1622","DOI":"10.1109\/TC.2017.2771535","volume":"67","author":"A Faz-Hern\u00e1ndez","year":"2018","unstructured":"Faz-Hern\u00e1ndez, A., L\u00f3pez, J., Ochoa-Jim\u00e9nez, E., Rodr\u00edguez-Henr\u00edquez, F.: A faster software implementation of the supersingular isogeny Diffie-Hellman key exchange protocol. IEEE Trans. Comput. 67(11), 1622\u20131636 (2018)","journal-title":"IEEE Trans. Comput."},{"key":"12_CR20","series-title":"LNCS","first-page":"177","volume-title":"ICISC 18","author":"A Fujioka","year":"2019","unstructured":"Fujioka, A., Takashima, K., Terada, S., Yoneyama, K.: Supersingular isogeny Diffie-Hellman authenticated key exchange. In: Lee, K. (ed.) ICISC 18. LNCS, vol. 11396, pp. 177\u2013195. Springer, Heidelberg (Nov (2019)"},{"key":"12_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/978-3-030-31919-9_20","volume-title":"Provable Security","author":"A Fujioka","year":"2019","unstructured":"Fujioka, A., Takashima, K., Yoneyama, K.: One-round authenticated group key exchange from isogenies. In: Steinfeld, R., Yuen, T.H. (eds.) ProvSec 2019. LNCS, vol. 11821, pp. 330\u2013338. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-31919-9_20"},{"key":"12_CR22","unstructured":"Galbraith, S.: Isogeny crypto. Blog post from Ellipticnews (2019). https:\/\/ellipticnews.wordpress.com\/2019\/11\/09\/isogeny-crypto\/. Accessed 15 Apr 2020"},{"key":"12_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-662-53887-6_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"SD Galbraith","year":"2016","unstructured":"Galbraith, S.D., Petit, C., Shani, B., Ti, Y.B.: On the security of supersingular isogeny cryptosystems. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10031, pp. 63\u201391. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53887-6_3"},{"key":"12_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-70694-8_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"SD Galbraith","year":"2017","unstructured":"Galbraith, S.D., Petit, C., Silva, J.: Identification protocols and signature schemes based on supersingular isogeny problems. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10624, pp. 3\u201333. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70694-8_1"},{"issue":"10","key":"12_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-018-2023-6","volume":"17","author":"SD Galbraith","year":"2018","unstructured":"Galbraith, S.D., Vercauteren, F.: Computational problems in supersingular elliptic curve isogenies. Quant. Inf. Process. 17(10), 1\u201322 (2018). https:\/\/doi.org\/10.1007\/s11128-018-2023-6","journal-title":"Quant. Inf. Process."},{"issue":"1","key":"12_CR26","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."},{"key":"12_CR27","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-642-25405-5_2","volume-title":"Post-Quantum Cryptography","author":"D Jao","year":"2011","unstructured":"Jao, D., De Feo, L.: Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies. In: Yang, B.Y. (ed.) Post-Quantum Cryptography, pp. 19\u201334. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25405-5_2"},{"key":"12_CR28","doi-asserted-by":"crossref","unstructured":"Keller, M., Orsini, E., Scholl, P.: MASCOT: faster malicious arithmetic secure computation with oblivious transfer. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) ACM CCS 2016, pp. 830\u2013842. ACM Press, October 2016","DOI":"10.1145\/2976749.2978357"},{"key":"12_CR29","unstructured":"Kutas, P., Martindale, C., Panny, L., Petit, C., Stange, K.E.: Weak instances of sidh variants under improved torsion-point attacks. Cryptology ePrint Archive, Report 2020\/633 (2020). https:\/\/eprint.iacr.org\/2020\/633"},{"key":"12_CR30","unstructured":"Lai, Y.F., Galbraith, S.D., Delpech de Saint Guilhem, C.: Compact, efficient and uc-secure isogeny-based oblivious transfer. Cryptology ePrint Archive, Report 2020\/1012 (2020). https:\/\/eprint.iacr.org\/2020\/1012"},{"key":"12_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/978-3-642-32009-5_40","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"JB Nielsen","year":"2012","unstructured":"Nielsen, J.B., Nordholt, P.S., Orlandi, C., Burra, S.S.: A new approach to practical active-secure two-party computation. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 681\u2013700. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_40"},{"key":"12_CR32","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":"12_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/978-3-319-70697-9_12","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"C Petit","year":"2017","unstructured":"Petit, C.: Faster algorithms for isogeny problems using torsion point images. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10625, pp. 330\u2013353. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70697-9_12"},{"key":"12_CR34","unstructured":"Rabin, M.O.: How to exchange secrets by oblivious transfer. Technical report TR-81, Aiken Computation Laboratory, Harvard University (1981)"},{"key":"12_CR35","unstructured":"Sahu, R.A., Gini, A., Pal, A.: Supersingular isogeny-based designated verifier blind signature. Cryptology ePrint Archive, Report 2019\/1498 (2019). https:\/\/eprint.iacr.org\/2019\/1498"},{"key":"12_CR36","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-1920-8","volume-title":"The arithmetic of elliptic curves, Graduate Texts in Mathematics","author":"JH Silverman","year":"1986","unstructured":"Silverman, J.H.: The arithmetic of elliptic curves, Graduate Texts in Mathematics, vol. 106. Springer, New York (1986). https:\/\/doi.org\/10.1007\/978-1-4757-1920-8"},{"key":"12_CR37","doi-asserted-by":"crossref","unstructured":"Urbanick, D., Jao, D.: Sok: the problem landscape of sidh. In: APKC 2018: Proceedings of the 5th ACM on ASIA Public-Key Cryptography Workshop, pp. 53\u201360. ACM (2018)","DOI":"10.1145\/3197507.3197516"},{"key":"12_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-030-23696-0_4","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2019","author":"V Vitse","year":"2019","unstructured":"Vitse, V.: Simple oblivious transfer protocols compatible with supersingular isogenies. In: Buchmann, J., Nitaj, A., Rachidi, T. (eds.) AFRICACRYPT 2019. LNCS, vol. 11627, pp. 56\u201378. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-23696-0_4"},{"key":"12_CR39","doi-asserted-by":"crossref","unstructured":"Wang, X., Ranellucci, S., Katz, J.: Global-scale secure multiparty computation. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017, pp. 39\u201356. ACM Press, October\/November 2017","DOI":"10.1145\/3133956.3133979"},{"key":"12_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-540-39927-8_21","volume-title":"Information and Communications Security","author":"Q-H Wu","year":"2003","unstructured":"Wu, Q.-H., Zhang, J.-H., Wang, Y.-M.: Practical t-out-n oblivious transfer and its applications. In: Qing, S., Gollmann, D., Zhou, J. (eds.) ICICS 2003. LNCS, vol. 2836, pp. 226\u2013237. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39927-8_21"}],"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-3-030-65411-5_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,21]],"date-time":"2022-12-21T19:13:12Z","timestamp":1671649992000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-65411-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030654108","9783030654115"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-65411-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"9 December 2020","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":"Vienna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 December 2020","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":"cans2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cans2020.at","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":"118","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":"30","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":"25% - 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":"9","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 virtually 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)"}}]}}