{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T22:33:51Z","timestamp":1775774031801,"version":"3.50.1"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031305887","type":"print"},{"value":"9783031305894","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-30589-4_11","type":"book-chapter","created":{"date-parts":[[2023,4,15]],"date-time":"2023-04-15T11:02:07Z","timestamp":1681556527000},"page":"310-342","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Disorientation Faults in\u00a0CSIDH"],"prefix":"10.1007","author":[{"given":"Gustavo","family":"Banegas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juliane","family":"Kr\u00e4mer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tanja","family":"Lange","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Meyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lorenz","family":"Panny","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Krijn","family":"Reijnders","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jana","family":"Sot\u00e1kov\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Monika","family":"Trimoska","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,4,16]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","unstructured":"Adj, G., Chi-Dom\u00ednguez, J., Rodr\u00edguez-Henr\u00edquez, F.: Karatsuba-based square-root V\u00e9lu\u2019s formulas applied to two isogeny-based protocols. J. Cryptogr. Eng. (2022). https:\/\/doi.org\/10.1007\/s13389-022-00293-y, https:\/\/ia.cr\/2020\/1109","DOI":"10.1007\/s13389-022-00293-y"},{"key":"11_CR2","unstructured":"Adj, G., Chi-Dom\u00ednguez, J.J., Mateu, V., Rodr\u00edguez-Henr\u00edquez, F.: Faulty isogenies: a new kind of leakage. Cryptology ePrint Archive, Paper 2022\/153 (2022). https:\/\/ia.cr\/2022\/153"},{"key":"11_CR3","doi-asserted-by":"publisher","unstructured":"Banegas, G., et al.: CTIDH: faster constant-time CSIDH. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2021(4), 351\u2013387 (2021). https:\/\/doi.org\/10.46586\/tches.v2021.i4.351-387","DOI":"10.46586\/tches.v2021.i4.351-387"},{"key":"11_CR4","unstructured":"Banegas, G., Gilchrist, V., Smith, B.: Efficient supersingularity testing over GF(p) and CSIDH key validation. Math. Cryptol. 2(1), 21\u201335 (2022). https:\/\/journals.flvc.org\/mathcryptology\/article\/view\/132125"},{"key":"11_CR5","doi-asserted-by":"publisher","unstructured":"Bernstein, D.J., De Feo, L., Leroux, A., Smith, B.: Faster computation of isogenies of large prime degree. In: Galbraith, S.D. (ed.) Proceedings of the Fourteenth Algorithmic Number Theory Symposium, pp. 39\u201355. Mathematics Sciences Publishers (2020). https:\/\/doi.org\/10.2140\/obs.2020.4.39, https:\/\/ia.cr\/2020\/341","DOI":"10.2140\/obs.2020.4.39"},{"key":"11_CR6","doi-asserted-by":"publisher","unstructured":"Bernstein, D.J., Hamburg, M., Krasnova, A., Lange, T.: Elligator: elliptic-curve points indistinguishable from uniform random strings. In: Sadeghi, A., Gligor, V.D., Yung, M. (eds.) 2013 ACM SIGSAC Conference on Computer and Communications Security, CCS 2013, Berlin, Germany, 4\u20138 November 2013, pp. 967\u2013980. ACM (2013). https:\/\/doi.org\/10.1145\/2508859.2516734, https:\/\/ia.cr\/2013\/325","DOI":"10.1145\/2508859.2516734"},{"key":"11_CR7","doi-asserted-by":"publisher","unstructured":"Bernstein, D.J., Lange, T., Martindale, C., Panny, L.: Quantum circuits for the CSIDH: optimizing quantum evaluation of isogenies. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11477, pp. 409\u2013441. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17656-3_15, https:\/\/ia.cr\/2018\/1059","DOI":"10.1007\/978-3-030-17656-3_15"},{"key":"11_CR8","doi-asserted-by":"publisher","unstructured":"Beullens, W., Kleinjung, T., Vercauteren, F.: CSI-FiSh: efficient isogeny based signatures through class group computations. In: Galbraith, S.D., Moriai, S. (eds.) Advances in Cryptology - ASIACRYPT 2019\u201325th International Conference on the Theory and Application of Cryptology and Information Security, Kobe, Japan, 8\u201312 December 2019, Proceedings, Part I. Lecture Notes in Computer Science, vol. 11921, pp. 227\u2013247. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-34578-5_9, https:\/\/ia.cr\/2019\/498","DOI":"10.1007\/978-3-030-34578-5_9"},{"key":"11_CR9","doi-asserted-by":"publisher","unstructured":"Bonnetain, X., Schrottenloher, A.: Quantum security analysis of CSIDH. In: Canteaut and Ishai [13], pp. 493\u2013522. https:\/\/doi.org\/10.1007\/978-3-030-45724-2_17, https:\/\/ia.cr\/2018\/537","DOI":"10.1007\/978-3-030-45724-2_17"},{"key":"11_CR10","doi-asserted-by":"publisher","unstructured":"Campos, F., Kannwischer, M.J., Meyer, M., Onuki, H., St\u00f6ttinger, M.: Trouble at the CSIDH: protecting CSIDH with dummy-operations against fault injection attacks. In: 17th Workshop on Fault Detection and Tolerance in Cryptography, FDTC 2020, Milan, Italy, 13 September 2020, pp. 57\u201365. IEEE (2020). https:\/\/doi.org\/10.1109\/FDTC51366.2020.00015, https:\/\/ia.cr\/2020\/1005","DOI":"10.1109\/FDTC51366.2020.00015"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-030-95085-9_6","volume-title":"Security, Privacy, and Applied Cryptography Engineering","author":"F Campos","year":"2022","unstructured":"Campos, F., Kr\u00e4mer, J., M\u00fcller, M.: Safe-error attacks on\u00a0SIKE and\u00a0CSIDH. In: Batina, L., Picek, S., Mondal, M. (eds.) SPACE 2021. LNCS, vol. 13162, pp. 104\u2013125. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-95085-9_6"},{"key":"11_CR12","unstructured":"Campos, F., Meyer, M., Reijnders, K., St\u00f6ttinger, M.: Patient zero and patient six: zero-value and correlation attacks on CSIDH and SIKE. Cryptology ePrint Archive, Paper 2022\/904 (2022). https:\/\/ia.cr\/2022\/904"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45724-2","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","year":"2020","unstructured":"Canteaut, A., Ishai, Y. (eds.): LNCS, vol. 12106. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2"},{"key":"11_CR14","unstructured":"Castryck, W., Decru, T.: An efficient key recovery attack on SIDH (preliminary version). Cryptology ePrint Archive, Paper 2022\/975 (2022). https:\/\/ia.cr\/2022\/975"},{"key":"11_CR15","doi-asserted-by":"publisher","unstructured":"Castryck, W., Lange, T., Martindale, C., Panny, L., Renes, J.: CSIDH: an efficient post-quantum commutative group action. In: Peyrin, T., Galbraith, S.D. (eds.) Advances in Cryptology - ASIACRYPT 2018\u201324th International Conference on the Theory and Application of Cryptology and Information Security, Brisbane, QLD, Australia, 2\u20136 December 2018, Proceedings, Part III. Lecture Notes in Computer Science, vol. 11274, pp. 395\u2013427. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-030-03332-3_15, https:\/\/ia.cr\/2018\/383","DOI":"10.1007\/978-3-030-03332-3_15"},{"key":"11_CR16","doi-asserted-by":"publisher","unstructured":"Cervantes-V\u00e1zquez, D., Chenu, M., Chi-Dom\u00ednguez, J.-J., De Feo, L., Rodr\u00edguez-Henr\u00edquez, F., Smith, B.: Stronger and faster side-channel protections for CSIDH. In: Schwabe, P., Th\u00e9riault, N. (eds.) LATINCRYPT 2019. LNCS, vol. 11774, pp. 173\u2013193. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30530-7_9, https:\/\/ia.cr\/2019\/837","DOI":"10.1007\/978-3-030-30530-7_9"},{"key":"11_CR17","doi-asserted-by":"publisher","unstructured":"Ch\u00e1vez-Saab, J., Chi-Dom\u00ednguez, J., Jaques, S., Rodr\u00edguez-Henr\u00edquez, F.: The SQALE of CSIDH: sublinear V\u00e9lu quantum-resistant isogeny action with low exponents. J. Cryptogr. Eng. 12(3), 349\u2013368 (2022). https:\/\/doi.org\/10.1007\/s13389-021-00271-w, https:\/\/ia.cr\/2020\/1520","DOI":"10.1007\/s13389-021-00271-w"},{"key":"11_CR18","doi-asserted-by":"publisher","unstructured":"Chi-Dom\u00ednguez, J., Rodr\u00edguez-Henr\u00edquez, F.: Optimal strategies for CSIDH. Adv. Math. Commun. 16(2), 383\u2013411 (2022). https:\/\/doi.org\/10.3934\/amc.2020116, https:\/\/ia.cr\/2020\/417","DOI":"10.3934\/amc.2020116"},{"key":"11_CR19","doi-asserted-by":"publisher","unstructured":"Childs, A.M., Jao, D., Soukharev, V.: Constructing elliptic curve isogenies in quantum subexponential time. J. Math. Cryptol. 8(1), 1\u201329 (2014). https:\/\/doi.org\/10.1515\/jmc-2012-0016, https:\/\/arxiv.org\/abs\/1012.4019","DOI":"10.1515\/jmc-2012-0016"},{"key":"11_CR20","doi-asserted-by":"publisher","first-page":"2369","DOI":"10.1098\/rspa.1997.0126","volume":"453","author":"JH Conway","year":"1997","unstructured":"Conway, J.H., Sloane, N.J.A.: Low dimensional lattices vii: coordination sequences. Proc. Roy. Soc. Lond. Ser. A 453, 2369\u20132389 (1997)","journal-title":"Proc. Roy. Soc. Lond. Ser. A"},{"key":"11_CR21","unstructured":"Couveignes, J.M.: Hard Homogeneous Spaces. IACR Cryptology ePrint Archive 2006\/291 (2006). https:\/\/ia.cr\/2006\/291"},{"key":"11_CR22","doi-asserted-by":"publisher","unstructured":"De Feo, L., Galbraith, S.D.: SeaSign: compact isogeny signatures from class group actions. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11478, pp. 759\u2013789. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_26, https:\/\/ia.cr\/2018\/824","DOI":"10.1007\/978-3-030-17659-4_26"},{"key":"11_CR23","doi-asserted-by":"publisher","unstructured":"De Feo, L., Meyer, M.: Threshold Schemes from Isogeny Assumptions. In: Kiayias, A., Kohlweiss, M., Wallden, P., Zikas, V. (eds.) PKC 2020. LNCS, vol. 12111, pp. 187\u2013212. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45388-6_7, https:\/\/ia.cr\/2019\/1288","DOI":"10.1007\/978-3-030-45388-6_7"},{"key":"11_CR24","doi-asserted-by":"publisher","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, https:\/\/arxiv.org\/abs\/1310.7789","DOI":"10.1007\/s10623-014-0010-1"},{"key":"11_CR25","doi-asserted-by":"publisher","unstructured":"G\u00e9lin, A., Wesolowski, B.: Loop-abort faults on supersingular isogeny cryptosystems. In: Lange, T., Takagi, T. (eds.) PQCrypto 2017. LNCS, vol. 10346, pp. 93\u2013106. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59879-6_6, https:\/\/ia.cr\/2017\/374","DOI":"10.1007\/978-3-319-59879-6_6"},{"key":"11_CR26","doi-asserted-by":"publisher","unstructured":"Hutchinson, A., LeGrow, J., Koziel, B., Azarderakhsh, R.: Further optimizations of CSIDH: a systematic approach to efficient strategies, permutations, and bound vectors. In: Conti, M., Zhou, J., Casalicchio, E., Spognardi, A. (eds.) ACNS 2020. LNCS, vol. 12146, pp. 481\u2013501. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-57808-4_24, https:\/\/ia.cr\/2019\/1121","DOI":"10.1007\/978-3-030-57808-4_24"},{"key":"11_CR27","doi-asserted-by":"publisher","unstructured":"Lai, Y.-F., Galbraith, S.D., Delpech de Saint Guilhem, C.: Compact, efficient and UC-secure isogeny-based oblivious transfer. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12696, pp. 213\u2013241. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_8, https:\/\/ia.cr\/2020\/1012","DOI":"10.1007\/978-3-030-77870-5_8"},{"key":"11_CR28","doi-asserted-by":"publisher","unstructured":"LeGrow, J.T., Hutchinson, A.: (Short Paper) Analysis of a strong fault attack on static\/ephemeral CSIDH. In: Nakanishi, T., Nojima, R. (eds.) IWSEC 2021. LNCS, vol. 12835, pp. 216\u2013226. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-85987-9_12, https:\/\/ia.cr\/2020\/1006","DOI":"10.1007\/978-3-030-85987-9_12"},{"key":"11_CR29","unstructured":"Maino, L., Martindale, C.: An attack on SIDH with arbitrary starting curve. Cryptology ePrint Archive, Paper 2022\/1026 (2022). https:\/\/ia.cr\/2022\/1026"},{"key":"11_CR30","doi-asserted-by":"publisher","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, https:\/\/ia.cr\/2018\/1198","DOI":"10.1007\/978-3-030-25510-7_17"},{"key":"11_CR31","doi-asserted-by":"publisher","unstructured":"Meyer, Michael, Reith, Steffen: A faster way to the CSIDH. In: Chakraborty, Debrup, Iwata, Tetsu (eds.) INDOCRYPT 2018. LNCS, vol. 11356, pp. 137\u2013152. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-05378-9_8, https:\/\/ia.cr\/2018\/782","DOI":"10.1007\/978-3-030-05378-9_8"},{"key":"11_CR32","doi-asserted-by":"publisher","unstructured":"Onuki, H., Aikawa, Y., Yamazaki, T., Takagi, T.: (Short paper) A faster constant-time algorithm of CSIDH keeping two points. In: Attrapadung, N., Yagi, T. (eds.) Advances in Information and Computer Security - 14th International Workshop on Security, IWSEC 2019, Tokyo, Japan, August 28\u201330, 2019, Proceedings. Lecture Notes in Computer Science, vol. 11689, pp. 23\u201333. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-26834-3_2, https:\/\/ia.cr\/2019\/353","DOI":"10.1007\/978-3-030-26834-3_2"},{"key":"11_CR33","doi-asserted-by":"publisher","unstructured":"Peikert, C.: He gives C-sieves on the CSIDH. In: Canteaut and Ishai [13], pp. 463\u2013492. https:\/\/doi.org\/10.1007\/978-3-030-45724-2_16, https:\/\/ia.cr\/2019\/725","DOI":"10.1007\/978-3-030-45724-2_16"},{"key":"11_CR34","unstructured":"Robert, D.: Breaking SIDH in polynomial time. Cryptology ePrint Archive, Paper 2022\/1038 (2022). https:\/\/ia.cr\/2022\/1038"},{"key":"11_CR35","unstructured":"Rostovtsev, A., Stolbunov, A.: Public-key cryptosystem based on isogenies. IACR Cryptology ePrint Archive 2006\/145 (2006), https:\/\/ia.cr\/2006\/145"},{"key":"11_CR36","doi-asserted-by":"publisher","unstructured":"Tasso, \u00c9., De Feo, L., El Mrabet, N., Ponti\u00e9, S.: Resistance of isogeny-based cryptographic implementations to a fault attack. In: Bhasin, S., De Santis, F. (eds.) COSADE 2021. LNCS, vol. 12910, pp. 255\u2013276. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-89915-8_12, https:\/\/ia.cr\/2021\/850","DOI":"10.1007\/978-3-030-89915-8_12"},{"key":"11_CR37","doi-asserted-by":"publisher","unstructured":"Ti, Y.B.: Fault attack on supersingular isogeny cryptosystems. In: Lange, T., Takagi, T. (eds.) PQCrypto 2017. LNCS, vol. 10346, pp. 107\u2013122. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59879-6_7, https:\/\/ia.cr\/2017\/379","DOI":"10.1007\/978-3-319-59879-6_7"},{"key":"11_CR38","unstructured":"Udovenko, A., Vitto, G.: Breaking the \\$IKEp182 challenge. IACR Cryptology ePrint Archive 2021\/1421 (2021). https:\/\/ia.cr\/2021\/1421"},{"key":"11_CR39","unstructured":"V\u00e9lu, J.: Isog\u00e9nies entre courbes elliptiques. Comptes Rendus de l\u2019Acad\u00e9mie des Sciences de Paris 273, 238\u2013241 (1971). https:\/\/gallica.bnf.fr\/ark:\/12148\/cb34416987n\/date"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30589-4_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,15]],"date-time":"2025-04-15T22:04:26Z","timestamp":1744754666000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30589-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031305887","9783031305894"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30589-4_11","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":"16 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lyon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","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":"23 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"42","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.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":"415","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":"109","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":"26% - 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":"16","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)"}}]}}