{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T08:37:25Z","timestamp":1773218245813,"version":"3.50.1"},"publisher-location":"Cham","reference-count":51,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030648336","type":"print"},{"value":"9783030648343","type":"electronic"}],"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.springernature.com\/gp\/researchers\/text-and-data-mining"},{"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.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-64834-3_23","type":"book-chapter","created":{"date-parts":[[2020,12,4]],"date-time":"2020-12-04T17:40:49Z","timestamp":1607103649000},"page":"667-696","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Security Limitations of Classical-Client Delegated Quantum Computing"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1353-1922","authenticated-orcid":false,"given":"Christian","family":"Badertscher","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2710-1170","authenticated-orcid":false,"given":"Alexandru","family":"Cojocaru","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8963-4656","authenticated-orcid":false,"given":"L\u00e9o","family":"Colisson","sequence":"additional","affiliation":[]},{"given":"Elham","family":"Kashefi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4882-889X","authenticated-orcid":false,"given":"Dominik","family":"Leichtle","sequence":"additional","affiliation":[]},{"given":"Atul","family":"Mantri","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0255-6542","authenticated-orcid":false,"given":"Petros","family":"Wallden","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,12,5]]},"reference":[{"key":"23_CR1","unstructured":"Aharonov, D., Ben-Or, M., Eban, E.: Interactive proofs for quantum computations. arXiv preprint arXiv:0810.5375 (2008)"},{"key":"23_CR2","unstructured":"Aaronson, S., Cojocaru, A., Gheorghiu, A., Kashefi, E.: Complexity-theoretic limitations on blind delegated quantum computation. In: 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019) (2019)"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Abadi, M., Feigenbaum, J., Kilian, J.: On hiding information from an oracle. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, pp. 195\u2013203. ACM (1987)","DOI":"10.1145\/28395.28417"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Badertscher, C., et al.: Security limitations of classical-client delegated quantum computing. Cryptology ePrint Archive, Report 2020\/818 (2020). https:\/\/eprint.iacr.org\/2020\/818 (full version)","DOI":"10.1007\/978-3-030-64834-3_23"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Broadbent, A., Fitzsimons, J., Kashefi, E.: Universal blind quantum computation. In: 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, pp. 517\u2013526. IEEE (2009)","DOI":"10.1109\/FOCS.2009.36"},{"key":"23_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1007\/978-3-662-48000-7_30","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"A Broadbent","year":"2015","unstructured":"Broadbent, A., Jeffery, S.: Quantum homomorphic encryption for circuits of low T-gate complexity. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9216, pp. 609\u2013629. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48000-7_30"},{"key":"23_CR7","unstructured":"Ben-Or, M., Mayers, D.: General security definition and composability for quantum & classical protocols. arXiv preprint quant-ph\/0409062 (2004)"},{"key":"23_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-319-96878-0_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"Z Brakerski","year":"2018","unstructured":"Brakerski, Z.: Quantum FHE (almost) as secure as classical. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10993, pp. 67\u201395. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96878-0_3"},{"issue":"9","key":"23_CR9","doi-asserted-by":"publisher","first-page":"941","DOI":"10.1139\/cjp-2015-0030","volume":"93","author":"A Broadbent","year":"2015","unstructured":"Broadbent, A.: Delegating private quantum computations. Can. J. Phys. 93(9), 941\u2013946 (2015)","journal-title":"Can. J. Phys."},{"key":"23_CR10","unstructured":"Broadbent, A.: How to verify a quantum computation. arXiv preprint arXiv:1509.09180 (2015)"},{"key":"23_CR11","unstructured":"Cojocaru, A., Colisson, L., Kashefi, E., Wallden, P.: On the possibility of classical client blind quantum computing. arXiv preprint arXiv:1802.08759 (2018)"},{"key":"23_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1007\/978-3-030-34578-5_22","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"A Cojocaru","year":"2019","unstructured":"Cojocaru, A., Colisson, L., Kashefi, E., Wallden, P.: QFactory: classically-instructed remote secret qubits preparation. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11921, pp. 615\u2013645. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34578-5_22"},{"issue":"6","key":"23_CR13","first-page":"456","volume":"5","author":"AM Childs","year":"2005","unstructured":"Childs, A.M.: Secure assisted quantum computation. Quantum Inf. Comput. 5(6), 456\u2013466 (2005)","journal-title":"Quantum Inf. Comput."},{"key":"23_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1007\/978-3-662-45608-8_22","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"V Dunjko","year":"2014","unstructured":"Dunjko, V., Fitzsimons, J.F., Portmann, C., Renner, R.: Composable security of delegated quantum computation. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8874, pp. 406\u2013425. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45608-8_22"},{"issue":"5","key":"23_CR15","doi-asserted-by":"publisher","first-page":"052310","DOI":"10.1103\/PhysRevA.74.052310","volume":"74","author":"V Danos","year":"2006","unstructured":"Danos, V., Kashefi, E.: Determinism in the one-way model. Phys. Rev. A 74(5), 052310 (2006)","journal-title":"Phys. Rev. A"},{"key":"23_CR16","unstructured":"Dunjko, V., Kashefi, E.: Blind quantum computing with two almost identical states. arXiv preprint arXiv:1604.01586 (2016)"},{"issue":"20","key":"23_CR17","doi-asserted-by":"publisher","first-page":"200502","DOI":"10.1103\/PhysRevLett.108.200502","volume":"108","author":"V Dunjko","year":"2012","unstructured":"Dunjko, V., Kashefi, E., Leverrier, A.: Blind quantum computing with weak coherent pulses. Phys. Rev. Lett. 108(20), 200502 (2012)","journal-title":"Phys. Rev. Lett."},{"issue":"3","key":"23_CR18","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/BF01647093","volume":"17","author":"EB Davies","year":"1970","unstructured":"Davies, E.B., Lewis, J.T.: An operational approach to quantum probability. Commun. Math. Phys. 17(3), 239\u2013260 (1970)","journal-title":"Commun. Math. Phys."},{"key":"23_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-662-53015-3_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"Y Dulek","year":"2016","unstructured":"Dulek, Y., Schaffner, C., Speelman, F.: Quantum homomorphic encryption for polynomial-sized circuits. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9816, pp. 3\u201332. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53015-3_1"},{"issue":"4","key":"23_CR20","doi-asserted-by":"publisher","first-page":"040501","DOI":"10.1103\/PhysRevLett.120.040501","volume":"120","author":"JF Fitzsimons","year":"2018","unstructured":"Fitzsimons, J.F., Hajdu\u0161ek, M., Morimae, T.: Post hoc verification of quantum computation. Phys. Rev. Lett. 120(4), 040501 (2018)","journal-title":"Phys. Rev. Lett."},{"issue":"1","key":"23_CR21","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1038\/s41534-017-0025-3","volume":"3","author":"JF Fitzsimons","year":"2017","unstructured":"Fitzsimons, J.F.: Private quantum computation: an introduction to blind quantum computing and related protocols. NPJ Quantum Inf. 3(1), 23 (2017)","journal-title":"NPJ Quantum Inf."},{"issue":"1","key":"23_CR22","doi-asserted-by":"publisher","first-page":"012303","DOI":"10.1103\/PhysRevA.96.012303","volume":"96","author":"JF Fitzsimons","year":"2017","unstructured":"Fitzsimons, J.F., Kashefi, E.: Unconditionally verifiable blind quantum computation. Phys. Rev. A 96(1), 012303 (2017)","journal-title":"Phys. Rev. A"},{"issue":"4","key":"23_CR23","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1007\/s00224-018-9872-3","volume":"63","author":"A Gheorghiu","year":"2019","unstructured":"Gheorghiu, A., Kapourniotis, T., Kashefi, E.: Verification of quantum computation: an overview of existing approaches. Theory Comput. Syst. 63(4), 715\u2013808 (2019)","journal-title":"Theory Comput. Syst."},{"key":"23_CR24","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography","author":"O Goldreich","year":"2001","unstructured":"Goldreich, O.: Foundations of Cryptography. Cambridge University Press, Cambridge (2001)"},{"key":"23_CR25","doi-asserted-by":"crossref","unstructured":"Ghirardi, G.C., Rimini, A., Weber, T.: A general argument against superluminal transmission through the quantum mechanical measurement process. Lettere al Nuovo Cimento (1971\u20131985) 27, 293\u2013298 (1980)","DOI":"10.1007\/BF02817189"},{"key":"23_CR26","doi-asserted-by":"crossref","unstructured":"Gheorghiu, A., Vidick, T.: Computationally-secure and composable remote state preparation. In: 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), pp. 1024\u20131033 (2019)","DOI":"10.1109\/FOCS.2019.00066"},{"issue":"22","key":"23_CR27","doi-asserted-by":"publisher","first-page":"220502","DOI":"10.1103\/PhysRevLett.115.220502","volume":"115","author":"M Hayashi","year":"2015","unstructured":"Hayashi, M., Morimae, T.: Verifiable measurement-only blind quantum computing with stabilizer testing. Phys. Rev. Lett. 115(22), 220502 (2015)","journal-title":"Phys. Rev. Lett."},{"key":"23_CR28","unstructured":"Jost, D., Maurer, U.: Context-restricted indifferentiability: generalizing UCE and implications on the soundness of hash-function constructions. IACR Cryptology ePrint Archive 2017:461 (2017)"},{"key":"23_CR29","unstructured":"Kashefi, E., Music, L., Wallden, P.: The quantum cut-and-choose technique and quantum two-party computation. arXiv preprint arXiv:1703.03754 (2017)"},{"issue":"2","key":"23_CR30","doi-asserted-by":"publisher","first-page":"12","DOI":"10.3390\/cryptography1020012","volume":"1","author":"E Kashefi","year":"2017","unstructured":"Kashefi, E., Pappa, A.: Multiparty delegated quantum computing. Cryptography 1(2), 12 (2017)","journal-title":"Cryptography"},{"issue":"1","key":"23_CR31","doi-asserted-by":"publisher","first-page":"6","DOI":"10.3390\/cryptography1010006","volume":"1","author":"E Kashefi","year":"2017","unstructured":"Kashefi, E., Wallden, P.: Garbled quantum computation. Cryptography 1(1), 6 (2017)","journal-title":"Cryptography"},{"key":"23_CR32","doi-asserted-by":"crossref","unstructured":"Mahadev, U.: Classical homomorphic encryption for quantum circuits. In: Thorup, M. (ed.) 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, 7\u20139 October 2018, pp. 332\u2013338. IEEE Computer Society (2018)","DOI":"10.1109\/FOCS.2018.00039"},{"key":"23_CR33","doi-asserted-by":"crossref","unstructured":"Mahadev, U.: Classical verification of quantum computations. In: Thorup, M. (ed.) 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, 7\u20139 October 2018, pp. 259\u2013267. IEEE Computer Society (2018)","DOI":"10.1109\/FOCS.2018.00033"},{"key":"23_CR34","unstructured":"Mantri, A.: Secure delegated quantum computing, Ph.d. thesis (2019)"},{"key":"23_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-642-27375-9_3","volume-title":"Theory of Security and Applications","author":"U Maurer","year":"2012","unstructured":"Maurer, U.: Constructive cryptography \u2013 a new paradigm for security definitions and proofs. In: M\u00f6dersheim, S., Palamidessi, C. (eds.) TOSCA 2011. LNCS, vol. 6993, pp. 33\u201356. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-27375-9_3"},{"key":"23_CR36","doi-asserted-by":"publisher","first-page":"42861","DOI":"10.1038\/srep42861","volume":"7","author":"A Mantri","year":"2017","unstructured":"Mantri, A., Demarie, T.F., Fitzsimons, J.F.: Universality of quantum computation with cluster states and (X, Y)-plane measurements. Sci. Rep. 7, 42861 (2017)","journal-title":"Sci. Rep."},{"issue":"3","key":"23_CR37","first-page":"031004","volume":"7","author":"A Mantri","year":"2017","unstructured":"Mantri, A., Demarie, T.F., Menicucci, N.C., Fitzsimons, J.F.: Flow ambiguity: a path towards classically driven blind quantum computation. Phys. Rev. X 7(3), 031004 (2017)","journal-title":"Phys. Rev. X"},{"issue":"5","key":"23_CR38","doi-asserted-by":"publisher","first-page":"050301","DOI":"10.1103\/PhysRevA.87.050301","volume":"87","author":"T Morimae","year":"2013","unstructured":"Morimae, T., Fujii, K.: Blind quantum computation protocol in which alice only makes measurements. Phys. Rev. A 87(5), 050301 (2013)","journal-title":"Phys. Rev. A"},{"key":"23_CR39","unstructured":"Morimae, T., Koshiba, T.: Composable security of measuring-alice blind quantum computation. arXiv preprint arXiv:1306.2113 (2013)"},{"key":"23_CR40","unstructured":"Morimae, T., Koshiba, T.: Impossibility of perfectly-secure delegated quantum computing for classical client. arXiv preprint arXiv:1407.1636 (2014)"},{"key":"23_CR41","unstructured":"Maurer, U., Renner, R.: Abstract cryptography. In: Innovations in Computer Science. Citeseer (2011)"},{"key":"23_CR42","volume-title":"Quantum Computation and Quantum Information","author":"MA Nielsen","year":"2000","unstructured":"Nielsen, M.A., Chuang, I.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)"},{"issue":"1","key":"23_CR43","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0034-4877(06)80014-5","volume":"57","author":"MA Nielsen","year":"2006","unstructured":"Nielsen, M.A.: Cluster-state quantum computation. Rep. Math. Phys. 57(1), 147\u2013161 (2006)","journal-title":"Rep. Math. Phys."},{"issue":"22","key":"23_CR44","doi-asserted-by":"publisher","first-page":"5188","DOI":"10.1103\/PhysRevLett.86.5188","volume":"86","author":"R Raussendorf","year":"2001","unstructured":"Raussendorf, R., Briegel, H.J.: A one-way quantum computer. Phys. Rev. Lett. 86(22), 5188 (2001)","journal-title":"Phys. Rev. Lett."},{"issue":"6","key":"23_CR45","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O Regev","year":"2009","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM (JACM) 56(6), 34 (2009)","journal-title":"J. ACM (JACM)"},{"key":"23_CR46","doi-asserted-by":"crossref","unstructured":"Reichardt, B.W., Unger, F., Vazirani, U.: A classical leash for a quantum system: command of quantum systems via rigidity of CHSH games. arXiv preprint arXiv:1209.0448 (2012)","DOI":"10.1145\/2422436.2422473"},{"key":"23_CR47","doi-asserted-by":"crossref","unstructured":"Takeuchi, Y., Mantri, A., Morimae, T., Mizutani, A., Fitzsimons, J.F.: Resource-efficient verification of quantum computing using Serfling\u2019s bound. arXiv preprint arXiv:1806.09138 (2018)","DOI":"10.1038\/s41534-019-0142-2"},{"key":"23_CR48","unstructured":"Unruh, D.: Simulatable security for quantum protocols. arXiv preprint quant-ph\/0409125 (2004)"},{"key":"23_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/978-3-642-13190-5_25","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"D Unruh","year":"2010","unstructured":"Unruh, D.: Universally composable quantum multi-party computation. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 486\u2013505. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_25"},{"issue":"1","key":"23_CR50","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1090\/bull\/1678","volume":"57","author":"T Vidick","year":"2020","unstructured":"Vidick, T.: Verifying quantum computations at scale: a cryptographic leash on quantum devices. Bull. Am. Math. Soc. 57(1), 39\u201376 (2020)","journal-title":"Bull. Am. Math. Soc."},{"key":"23_CR51","doi-asserted-by":"crossref","unstructured":"Zhang, J.: Succinct blind quantum computation using a random oracle. arXiv, abs\/2004.12621 (2020)","DOI":"10.1145\/3406325.3451082"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2020"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-64834-3_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,4]],"date-time":"2023-12-04T01:05:35Z","timestamp":1701651935000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-64834-3_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030648336","9783030648343"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-64834-3_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"5 December 2020","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":"Daejeon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Korea (Republic of)","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":"7 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2020\/","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":"websubrev","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"316","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":"85","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":"27% - 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":"19","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 will take place 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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}