{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,15]],"date-time":"2026-08-15T20:34:42Z","timestamp":1786826082908,"version":"3.56.0"},"publisher-location":"Cham","reference-count":50,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031444685","type":"print"},{"value":"9783031444692","type":"electronic"}],"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-3-031-44469-2_8","type":"book-chapter","created":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T13:02:57Z","timestamp":1695646977000},"page":"149-168","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Towards a\u00a0Quantum-Resistant Weak Verifiable Delay Function"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Decru","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Luciano","family":"Maino","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Antonio","family":"Sanso","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,9,26]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","unstructured":"Arpin, S., et al.: Adventures in supersingularland. Exp. Math. (2021). https:\/\/doi.org\/10.1080\/10586458.2021.1926009","DOI":"10.1080\/10586458.2021.1926009"},{"key":"8_CR2","unstructured":"Azarderakhsh, R., et al.: Supersingular Isogeny Key Encapsulation (2017). http:\/\/sike.org"},{"key":"8_CR3","doi-asserted-by":"publisher","unstructured":"Banegas, G., et al.: Disorientation faults in CSIDH. In: Advances in Cryptology - EUROCRYPT 2023, part II, pp. 310\u2013342. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_11","DOI":"10.1007\/978-3-031-30589-4_11"},{"key":"8_CR4","doi-asserted-by":"publisher","unstructured":"Basso, A., et al.: Supersingular curves you can trust. In: EUROCRYPT 2023, Part II, pp. 405\u2013437. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-30617-4_14","DOI":"10.1007\/978-3-031-30617-4_14"},{"key":"8_CR5","doi-asserted-by":"publisher","unstructured":"Bernstein, D.J., De Feo, L., Leroux, A., Smith, B.: Faster computation of isogenies of large prime degree. ANTS-XIV Open Book Series 4(1), 39\u201355 (2020). https:\/\/doi.org\/10.2140\/obs.2020.4.39","DOI":"10.2140\/obs.2020.4.39"},{"key":"8_CR6","unstructured":"Bernstein, D.J., Lange, T.: Montgomery curves and the Montgomery ladder. Cryptology ePrint Archive, Paper 2017\/293 (2017). https:\/\/eprint.iacr.org\/2017\/293"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Beullens, W., De Feo, L., Galbraith, S., Petit, C.: Proving knowledge of isogenies: a survey. Des. Codes Cryptogr. (2023). https:\/\/doi.org\/10.1007\/s10623-023-01243-3","DOI":"10.1007\/s10623-023-01243-3"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Beullens, W., Kleinjung, T., Vercauteren, F.: CSI-FiSh: Efficient isogeny based signatures through class group computations. In: ASIACRYPT 2019, Part I. pp. 227\u2013247. Springer (2019), https:\/\/doi.org\/10.1007\/978-3-030-34578-5_9","DOI":"10.1007\/978-3-030-34578-5_9"},{"key":"8_CR9","unstructured":"Boneh, D., B\u00fcnz, B., Fisch, B.: A survey of two verifiable delay functions. Cryptology ePrint Archive, Paper 2018\/712 (2018). https:\/\/eprint.iacr.org\/2018\/712"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1007\/978-3-319-96884-1_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"D Boneh","year":"2018","unstructured":"Boneh, D., Bonneau, J., B\u00fcnz, B., Fisch, B.: Verifiable delay functions. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10991, pp. 757\u2013788. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_25"},{"key":"8_CR11","unstructured":"Booher, J., et al.: Failing to hash into supersingular isogeny graphs. Cryptology ePrint Archive, Report 2022\/518 (2022). https:\/\/eprint.iacr.org\/2022\/518"},{"key":"8_CR12","doi-asserted-by":"publisher","unstructured":"Borodin, A., von zur Gathen, J., Hopcroft, J.: Fast parallel matrix and GCD computations. Inf. Control 52(3), 241\u2013256 (1982). https:\/\/doi.org\/10.1016\/S0019-9958(82)90766-5","DOI":"10.1016\/S0019-9958(82)90766-5"},{"key":"8_CR13","doi-asserted-by":"publisher","unstructured":"Cantor, D.G., Zassenhaus, H.: A new algorithm for factoring polynomials over finite fields. Math. Comput. 36, 587\u2013592 (1981). https:\/\/doi.org\/10.2307\/2007663","DOI":"10.2307\/2007663"},{"key":"8_CR14","doi-asserted-by":"publisher","unstructured":"Castryck, W., Decru, T.: An efficient key recovery attack on SIDH. In: EUROCRYPT 2023, Part II, pp. 423\u2013447. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_15","DOI":"10.1007\/978-3-031-30589-4_15"},{"issue":"1","key":"8_CR15","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1515\/jmc-2019-0021","volume":"14","author":"W Castryck","year":"2020","unstructured":"Castryck, W., Decru, T., Smith, B.: Hash functions from superspecial genus-2 curves using Richelot isogenies. J. Math. Cryptol. 14(1), 268\u2013292 (2020). https:\/\/doi.org\/10.1515\/jmc-2019-0021","journal-title":"J. Math. Cryptol."},{"key":"8_CR16","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"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/978-3-030-99277-4_21","volume-title":"Selected Areas in Cryptography","author":"J Chavez-Saab","year":"2022","unstructured":"Chavez-Saab, J., Rodr\u00edguez-Henr\u00edquez, F., Tibouchi, M.: Verifiable isogeny walks: towards an isogeny-based postquantum VDF. In: AlTawy, R., H\u00fclsing, A. (eds.) SAC 2021. LNCS, vol. 13203, pp. 441\u2013460. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-99277-4_21"},{"key":"8_CR18","doi-asserted-by":"publisher","unstructured":"Chu, E., George, A.: Inside the FFT Black Box: Serial and Parallel Fast Fourier Transform Algorithms. CRC Press, Boca Raton (1999). https:\/\/doi.org\/10.1201\/9780367802332","DOI":"10.1201\/9780367802332"},{"key":"8_CR19","doi-asserted-by":"publisher","DOI":"10.1201\/9781420034981","volume-title":"Handbook of Elliptic and Hyperelliptic Curve Cryptography","author":"H Cohen","year":"2005","unstructured":"Cohen, H., et al.: Handbook of Elliptic and Hyperelliptic Curve Cryptography. CRC Press, Boca Raton (2005)"},{"key":"8_CR20","doi-asserted-by":"publisher","unstructured":"Cong, K., Lai, Y.F., Levin, S.: Efficient isogeny proofs using generic techniques. In: Applied Cryptography and Network Security, pp. 248\u2013275. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-33491-7_10","DOI":"10.1007\/978-3-031-33491-7_10"},{"key":"8_CR21","unstructured":"Cook, S.A.: On the minimum computation time of functions. Ph.D. thesis, Harvard University (1966)"},{"key":"8_CR22","doi-asserted-by":"publisher","unstructured":"Cui-xiang, Z., Guo-qiang, H., Ming-he, H.: Some new parallel fast Fourier transform algorithms. In: Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT 2005), pp. 624\u2013628 (2005). https:\/\/doi.org\/10.1109\/PDCAT.2005.224","DOI":"10.1109\/PDCAT.2005.224"},{"key":"8_CR23","unstructured":"De Feo, L.: Mathematics of isogeny based cryptography. The Arxive abs\/1711.04062 (2017). http:\/\/arxiv.org\/abs\/1711.04062"},{"issue":"3","key":"8_CR24","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1515\/jmc-2012-0015","journal-title":"J. Math. Cryptol."},{"key":"8_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-030-34578-5_10","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"L De Feo","year":"2019","unstructured":"De Feo, L., Masson, S., Petit, C., Sanso, A.: Verifiable delay functions from supersingular isogenies and pairings. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11921, pp. 248\u2013277. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34578-5_10"},{"key":"8_CR26","doi-asserted-by":"crossref","unstructured":"Delfs, C., Galbraith, S.D.: Computing isogenies between supersingular elliptic curves over $$\\mathbb{F} _p$$. Des. Codes Cryptogr. 78(2), 425\u2013440 (2016). https:\/\/doi.org\/10.1007\/s10623-014-0010-1","DOI":"10.1007\/s10623-014-0010-1"},{"issue":"1\u20132","key":"8_CR27","first-page":"1","volume":"19","author":"J Doliskani","year":"2019","unstructured":"Doliskani, J.: Toward an optimal quantum algorithm for polynomial factorization over finite fields. Quant. Info. Comput. 19(1\u20132), 1\u201313 (2019)","journal-title":"Quant. Info. Comput."},{"key":"8_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-030-57990-6_4","volume-title":"Security and Cryptography for Networks","author":"N D\u00f6ttling","year":"2020","unstructured":"D\u00f6ttling, N., Garg, S., Malavolta, G., Vasudevan, P.N.: Tight verifiable delay functions. In: Galdi, C., Kolesnikov, V. (eds.) SCN 2020. LNCS, vol. 12238, pp. 65\u201384. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-57990-6_4"},{"key":"8_CR29","doi-asserted-by":"crossref","unstructured":"Elkies, N.D.: Elliptic and modular curves over finite fields and related computational issues. In: Computational Perspectives on Number Theory, Studies in Advanced Mathematics, vol. 7, pp. 21\u201376. AMS (1998)","DOI":"10.1090\/amsip\/007\/03"},{"key":"8_CR30","unstructured":"Eriksen, J.K., Panny, L., Sot\u00e1kov\u00e1, J., Veroni, M.: Deuring for the people: supersingular elliptic curves with prescribed endomorphism ring in general characteristic. Cryptology ePrint Archive, Paper 2023\/106 (2023). https:\/\/eprint.iacr.org\/2023\/106"},{"key":"8_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/978-3-030-95312-6_14","volume-title":"Topics in Cryptology \u2013 CT-RSA 2022","author":"TB Fouotsa","year":"2022","unstructured":"Fouotsa, T.B., Petit, C.: A new adaptive attack on SIDH. In: Galbraith, S.D. (ed.) CT-RSA 2022. LNCS, vol. 13161, pp. 322\u2013344. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-95312-6_14"},{"key":"8_CR32","doi-asserted-by":"publisher","unstructured":"von zur Gathen, J.: Parallel algorithms for algebraic problems. In: Symposium on Theory of Computing, STOC 1983, pp. 17\u201323. Association for Computing Machinery (1983). https:\/\/doi.org\/10.1145\/800061.808728","DOI":"10.1145\/800061.808728"},{"key":"8_CR33","unstructured":"Giacomelli, I., Madsen, J., Orlandi, C.: ZKBoo: faster zero-knowledge for boolean circuits. In: Conference on Security Symposium, SEC 2016, pp. 1069\u20131083. USENIX Association (2016)"},{"key":"8_CR34","doi-asserted-by":"publisher","unstructured":"Kani, E.: The number of curves of genus two with elliptic differentials. J. f\u00fcr die reine und angewandte Mathematik 1997(485), 93\u2013122 (1997). https:\/\/doi.org\/10.1515\/crll.1997.485.93","DOI":"10.1515\/crll.1997.485.93"},{"key":"8_CR35","unstructured":"Kohel, D.R.: Endomorphism rings of elliptic curves over finite fields. Ph.D. thesis, University of California, Berkeley (1996)"},{"key":"8_CR36","doi-asserted-by":"publisher","unstructured":"Leroux, A.: A new isogeny representation and applications to cryptography. In: ASIACRYPT 2022, Part II, pp. 3\u201335. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-22966-4_1","DOI":"10.1007\/978-3-031-22966-4_1"},{"key":"8_CR37","doi-asserted-by":"publisher","unstructured":"Maino, L., Martindale, C., Panny, L., Pope, G., Wesolowski, B.: A direct key recovery attack on SIDH. In: EUROCRYPT 2023, Part II, pp. 448\u2013471. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_16","DOI":"10.1007\/978-3-031-30589-4_16"},{"key":"8_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-030-25510-7_17","volume-title":"Post-Quantum Cryptography","author":"M Meyer","year":"2019","unstructured":"Meyer, M., Campos, F., Reith, S.: On lions and elligators: an efficient constant-time implementation of CSIDH. In: Ding, J., Steinwandt, R. (eds.) PQCrypto 2019. LNCS, vol. 11505, pp. 307\u2013325. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25510-7_17"},{"key":"8_CR39","unstructured":"Morgenstern, M., Shamir, E.: Parallel algorithms for arithmetics, irreducibility and factoring of GFq-polynomials. Technical report, Stanford University (1983). https:\/\/dl.acm.org\/doi\/10.5555\/892306"},{"key":"8_CR40","unstructured":"Mula, M., Murru, N., Pintore, F.: On Random Sampling of Supersingular Elliptic Curves. Cryptology ePrint Archive, Paper 2022\/528 (2022). https:\/\/eprint.iacr.org\/2022\/528"},{"key":"8_CR41","unstructured":"Panny, L.: CSI\u2013FiSh really isn\u2019t polynomial\u2013time. https:\/\/yx7.cc\/blah\/2023-04-14.html#fn5"},{"key":"8_CR42","doi-asserted-by":"publisher","unstructured":"Pietrzak, K.: Simple verifiable delay functions. In: Innovations in Theoretical Computer Science (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), vol. 124, pp. 60:1\u201360:15. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018). https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2019.60","DOI":"10.4230\/LIPIcs.ITCS.2019.60"},{"key":"8_CR43","doi-asserted-by":"publisher","unstructured":"Robert, D.: Breaking SIDH in polynomial time. In: EUROCRYPT 2023, Part II, pp. 472\u2013503. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_17","DOI":"10.1007\/978-3-031-30589-4_17"},{"key":"8_CR44","doi-asserted-by":"publisher","unstructured":"Silverman, J.H.: The Arithmetic of Elliptic Curves, vol. 106. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-0-387-09494-6","DOI":"10.1007\/978-0-387-09494-6"},{"key":"8_CR45","doi-asserted-by":"crossref","unstructured":"Smith, B.: Explicit endomorphisms and correspondences. Ph.D. thesis, University of Sydney (2006)","DOI":"10.1017\/S0004972700040521"},{"key":"8_CR46","doi-asserted-by":"crossref","unstructured":"Sutherland, A.: On the evaluation of modular polynomials. Open Book Ser. 1(1), 531\u2013555 (2013). https:\/\/dx.doi.org\/10.2140\/obs.2013.1.531","DOI":"10.2140\/obs.2013.1.531"},{"key":"8_CR47","unstructured":"Tan, T.G., Sharma, V., Li, Z., Szalachowski, P., Zhou, J.: ZKBdf: a ZKBoo-based quantum-secure verifiable delay function with prover-secret. Cryptology ePrint Archive, Paper 2022\/1373 (2022). https:\/\/eprint.iacr.org\/2022\/1373"},{"key":"8_CR48","unstructured":"Toom, A.L.: The complexity of a scheme of functional elements realizing the multiplication of integers. In: Soviet Mathematics Doklady, vol. 3, pp. 714\u2013716 (1963)"},{"key":"8_CR49","doi-asserted-by":"publisher","unstructured":"von zur Gathen, J., Panario, D.: Factoring polynomials over finite fields: a survey. J. Symb. Comput. 31(1), 3\u201317 (2001). https:\/\/doi.org\/10.1006\/jsco.1999.1002","DOI":"10.1006\/jsco.1999.1002"},{"issue":"4","key":"8_CR50","doi-asserted-by":"publisher","first-page":"2113","DOI":"10.1007\/s00145-020-09364-x","volume":"33","author":"B Wesolowski","year":"2020","unstructured":"Wesolowski, B.: Efficient verifiable delay functions. J. Cryptol. 33(4), 2113\u20132147 (2020). https:\/\/doi.org\/10.1007\/s00145-020-09364-x","journal-title":"J. Cryptol."}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 LATINCRYPT 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-44469-2_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:53:13Z","timestamp":1709812393000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-44469-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031444685","9783031444692"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-44469-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"26 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATINCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology and Information Security in Latin America","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Quito","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ecuador","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":"3 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latincrypt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.espe.edu.ec\/latincrypt\/","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":"59","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":"19","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":"32% - 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":"4","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)"}}]}}