{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T12:29:28Z","timestamp":1768912168731,"version":"3.49.0"},"publisher-location":"Cham","reference-count":42,"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_6","type":"book-chapter","created":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T13:02:57Z","timestamp":1695646977000},"page":"109-128","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Effective Pairings in\u00a0Isogeny-Based Cryptography"],"prefix":"10.1007","author":[{"given":"Krijn","family":"Reijnders","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,26]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Banegas, G., et al.: CTIDH: faster constant-time CSIDH. In: TCHES 2021, pp. 351\u2013387 (2021)","DOI":"10.46586\/tches.v2021.i4.351-387"},{"issue":"1","key":"6_CR2","first-page":"21","volume":"2","author":"G Banegas","year":"2022","unstructured":"Banegas, G., Gilchrist, V., Smith, B.: Efficient supersingularity testing over $$\\mathbb{F} _p$$ and CSIDH key validation. Math. Cryptol. 2(1), 21\u201335 (2022)","journal-title":"Math. Cryptol."},{"key":"6_CR3","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/978-3-031-30589-4_11","volume-title":"EUROCRYPT 2023","author":"G Banegas","year":"2023","unstructured":"Banegas, G., et al.: Disorientation faults in CSIDH. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023. LNCS, vol. 14008, pp. 310\u2013342. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_11"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/3-540-45708-9_23","volume-title":"Advances in Cryptology \u2014 CRYPTO 2002","author":"PSLM Barreto","year":"2002","unstructured":"Barreto, P.S.L.M., Kim, H.Y., Lynn, B., Scott, M.: Efficient algorithms for pairing-based cryptosystems. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 354\u2013369. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_23"},{"issue":"4","key":"6_CR5","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s00145-004-0311-z","volume":"17","author":"P Barreto","year":"2004","unstructured":"Barreto, P., Lynn, B., Scott, M.: Efficient implementation of pairing-based cryptosystems. J. Cryptol. 17(4), 321\u2013334 (2004)","journal-title":"J. Cryptol."},{"key":"6_CR6","unstructured":"Campos, F., et al.: On the Practicality of Post-Quantum TLS Using Large-Parameter CSIDH. ePrint 2023\/793"},{"key":"6_CR7","doi-asserted-by":"crossref","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: FDTC 2020, pp. 57\u201365. IEEE (2020)","DOI":"10.1109\/FDTC51366.2020.00015"},{"key":"6_CR8","unstructured":"Campos, F., Meyer, M., Reijnders, K., St\u00f6ttinger, M.: Patient zero and patient six. SAC (2022)"},{"key":"6_CR9","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":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-030-30530-7_9","volume-title":"Progress in Cryptology \u2013 LATINCRYPT 2019","author":"D Cervantes-V\u00e1zquez","year":"2019","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"},{"issue":"3","key":"6_CR11","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s13389-021-00271-w","volume":"12","author":"J Ch\u00e1vez-Saab","year":"2022","unstructured":"Ch\u00e1vez-Saab, J., Chi-Dom\u00ednguez, J.-J., Jaques, S., Rodr\u00edguez-Henr\u00edquez, F.: The SQALE of CSIDH. J. Cryptogr. Eng. 12(3), 349\u2013368 (2022)","journal-title":"J. Cryptogr. Eng."},{"issue":"2","key":"6_CR12","doi-asserted-by":"publisher","first-page":"383","DOI":"10.3934\/amc.2020116","volume":"16","author":"J-J Chi-Dom\u00ednguez","year":"2022","unstructured":"Chi-Dom\u00ednguez, J.-J., Rodr\u00edguez-Henr\u00edquez, F.: Optimal strategies for CSIDH. Adv. Math. Commun. 16(2), 383\u2013411 (2022)","journal-title":"Adv. Math. Commun."},{"key":"6_CR13","unstructured":"Costello, C.: Pairings for beginners (2015). https:\/\/www.craigcostello.com.au\/"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/978-3-319-56620-7_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"C Costello","year":"2017","unstructured":"Costello, C., Jao, D., Longa, P., Naehrig, M., Renes, J., Urbanik, D.: Efficient compression of SIDH public keys. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10210, pp. 679\u2013706. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56620-7_24"},{"key":"6_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":"6_CR16","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s13389-017-0157-6","volume":"8","author":"C Costello","year":"2018","unstructured":"Costello, C., Smith, B.: Montgomery curves and their arithmetic: the case of large characteristic fields. J. Cryptogr. Eng. 8, 227\u2013240 (2018)","journal-title":"J. Cryptogr. Eng."},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-030-64837-4_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"L De Feo","year":"2020","unstructured":"De Feo, L., Kohel, D., Leroux, A., Petit, C., Wesolowski, B.: SQISign: compact post-quantum signatures from quaternions and isogenies. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12491, pp. 64\u201393. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64837-4_3"},{"issue":"5","key":"6_CR18","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/s00200-018-0349-z","volume":"29","author":"J Doliskani","year":"2018","unstructured":"Doliskani, J.: On division polynomial pit and supersingularity. Appl. Algebra Eng. Commun. Comput. 29(5), 393\u2013407 (2018)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Galbraith, S.D.: Pairings (2005)","DOI":"10.1017\/CBO9780511546570.011"},{"issue":"3","key":"6_CR20","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/s10623-008-9233-3","volume":"50","author":"SD Galbraith","year":"2009","unstructured":"Galbraith, S.D., Lin, X.: Computing pairings using $$x$$-coordinates only. Des. Codes Crypt. 50(3), 305\u2013324 (2009)","journal-title":"Des. Codes Crypt."},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/978-3-030-57808-4_24","volume-title":"Applied Cryptography and Network Security","author":"A Hutchinson","year":"2020","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"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Joye, M., Quisquater, J.-J.: On the importance of securing your bins: The garbage-man-in-the-middle attack. In: CCS 1997, pp. 135\u2013141 (1997)","DOI":"10.1145\/266420.266449"},{"issue":"10","key":"6_CR23","doi-asserted-by":"publisher","first-page":"2055","DOI":"10.1587\/transfun.E97.A.2055","volume":"97","author":"Y Kiyomura","year":"2014","unstructured":"Kiyomura, Y., Takagi, T.: Efficient algorithm for Tate pairing of composite order. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 97(10), 2055\u20132063 (2014)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"issue":"1","key":"6_CR24","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1093\/ietfec\/e89-a.1.134","volume":"89","author":"T Kobayashi","year":"2006","unstructured":"Kobayashi, T., Aoki, K., Imai, H.: Efficient algorithms for Tate pairing. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89(1), 134\u2013143 (2006)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"6_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-030-85987-9_12","volume-title":"Advances in Information and Computer Security","author":"JT LeGrow","year":"2021","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"},{"key":"6_CR26","unstructured":"Lin, K., Wang, W., Xu, Z., Zhao, C.: A faster software implementation of sqisign. Cryptology ePrint Archive, Paper 2023\/753 (2023)"},{"key":"6_CR27","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.jsc.2014.08.001","volume":"67","author":"D Lubicz","year":"2015","unstructured":"Lubicz, D., Robert, D.: A generalisation of miller\u2019s algorithm and applications to pairing computations on abelian varieties. J. Symb. Comput. 67, 68\u201392 (2015)","journal-title":"J. Symb. Comput."},{"key":"6_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-642-14518-6_21","volume-title":"Algorithmic Number Theory","author":"D Lubicz","year":"2010","unstructured":"Lubicz, D., Robert, D.: Efficient pairing computation with theta functions. In: Hanrot, G., Morain, F., Thom\u00e9, E. (eds.) ANTS 2010. LNCS, vol. 6197, pp. 251\u2013269. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14518-6_21"},{"key":"6_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-1983-2","volume-title":"Finite Fields for Computer Scientists and Engineers","author":"R McEliece","year":"2012","unstructured":"McEliece, R.: Finite Fields for Computer Scientists and Engineers, vol. 23. Springer, New York (2012). https:\/\/doi.org\/10.1007\/978-1-4613-1983-2"},{"key":"6_CR30","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":"6_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/978-3-030-05378-9_8","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2018","author":"M Meyer","year":"2018","unstructured":"Meyer, M., Reith, S.: A faster way to the CSIDH. In: Chakraborty, D., Iwata, T. (eds.) INDOCRYPT 2018. LNCS, vol. 11356, pp. 137\u2013152. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-05378-9_8"},{"issue":"4","key":"6_CR32","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00145-004-0315-8","volume":"17","author":"V Miller","year":"2004","unstructured":"Miller, V.: The weil pairing, and its efficient calculation. J. Cryptol. 17(4), 235\u2013261 (2004)","journal-title":"J. Cryptol."},{"key":"6_CR33","doi-asserted-by":"crossref","unstructured":"Onuki, H., Aikawa, Y., Yamazaki, T., Takagi, T.: A faster constant-time algorithm of CSIDH keeping two points. In: IWSEC 2019 (2019)","DOI":"10.1007\/978-3-030-26834-3_2"},{"key":"6_CR34","doi-asserted-by":"crossref","unstructured":"Reitwiesner, G.: Binary arithmetic. In: Advances in Computers, vol. 1, pp. 231\u2013308. Elsevier (1960)","DOI":"10.1016\/S0065-2458(08)60610-5"},{"key":"6_CR35","unstructured":"Scott, M.: Pairing implementation revisited. ePrint 2019\/077 (2019)"},{"key":"6_CR36","doi-asserted-by":"crossref","unstructured":"Scott, M.: Understanding the Tate pairing (2004). http:\/\/www.computing.dcu.ie\/~mike\/tate.html","DOI":"10.1007\/978-3-540-30574-3_20"},{"key":"6_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-540-28628-8_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"M Scott","year":"2004","unstructured":"Scott, M., Barreto, P.S.L.M.: Compressed pairings. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 140\u2013156. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28628-8_9"},{"key":"6_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/978-3-642-17455-1_24","volume-title":"Pairing-Based Cryptography - Pairing 2010","author":"JH Silverman","year":"2010","unstructured":"Silverman, J.H.: A Survey of Local and Global Pairings on Elliptic Curves and Abelian Varieties. In: Joye, M., Miyaji, A., Otsuka, A. (eds.) Pairing 2010. LNCS, vol. 6487, pp. 377\u2013396. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17455-1_24"},{"key":"6_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/978-3-540-73489-5_19","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2007","author":"KE Stange","year":"2007","unstructured":"Stange, K.E.: The Tate pairing via elliptic nets. In: Takagi, T., Okamoto, T., Okamoto, E., Okamoto, T. (eds.) Pairing 2007. LNCS, vol. 4575, pp. 329\u2013348. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73489-5_19"},{"key":"6_CR40","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1112\/S1461157012001106","volume":"15","author":"A Sutherland","year":"2012","unstructured":"Sutherland, A.: Identifying supersingular elliptic curves. LMS J. Comput. Math. 15, 317\u2013325 (2012)","journal-title":"LMS J. Comput. Math."},{"key":"6_CR41","first-page":"238","volume":"273","author":"J V\u00e9lu","year":"1971","unstructured":"V\u00e9lu, J.: Isog\u00e9nies entre courbes elliptiques. Comptes Rendus de l\u2019Acad\u00e9mie des Sciences de Paris, S\u00e9ries A 273, 238\u2013241 (1971)","journal-title":"Comptes Rendus de l\u2019Acad\u00e9mie des Sciences de Paris, S\u00e9ries A"},{"issue":"1","key":"6_CR42","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1109\/TIT.2009.2034881","volume":"56","author":"F Vercauteren","year":"2009","unstructured":"Vercauteren, F.: Optimal pairings. IEEE Trans. Inf. Theory 56(1), 455\u2013461 (2009)","journal-title":"IEEE Trans. Inf. Theory"}],"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_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:52:27Z","timestamp":1709812347000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-44469-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031444685","9783031444692"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-44469-2_6","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)"}}]}}