{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T13:56:37Z","timestamp":1764251797283,"version":"3.40.3"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031229435"},{"type":"electronic","value":"9783031229442"}],"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-22944-2_17","type":"book-chapter","created":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T18:03:58Z","timestamp":1673373838000},"page":"269-287","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["New Versions of\u00a0Miller-loop Secured Against Side-Channel Attacks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3840-584X","authenticated-orcid":false,"given":"Nadia El","family":"Mrabet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3438-1860","authenticated-orcid":false,"given":"Loubna","family":"Ghammam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6286-6756","authenticated-orcid":false,"given":"Nicolas","family":"Meloni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3015-2780","authenticated-orcid":false,"given":"Emmanuel","family":"Fouotsa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,11]]},"reference":[{"key":"17_CR1","unstructured":"National Institute of Standards and Technology. http:\/\/csrc.nist.gov\/publications\/PubsSPs.html"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/3-540-39568-7_5","volume-title":"Advances in Cryptology","author":"A Shamir","year":"1985","unstructured":"Shamir, A.: Identity-based cryptosystems and signature schemes. In: Blakley, G.R., Chaum, D. (eds.) Identity-based cryptosystems and signature schemes. LNCS, vol. 196, pp. 47\u201353. Springer, Heidelberg (1985). https:\/\/doi.org\/10.1007\/3-540-39568-7_5"},{"issue":"1","key":"17_CR3","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1515\/gcc-2016-0006","volume":"8","author":"S Duquesne","year":"2016","unstructured":"Duquesne, S., Ghammam, L.: Memory-saving computation of the pairing final exponentiation on BN curves. Groups Complex. Cryptol. 8(1), 75\u201390 (2016)","journal-title":"Groups Complex. Cryptol."},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"El Mrabet, N., Di Natale, G., Flottes, M.L.: A practical differential power analysis attack against the miller algorithm. In: PRIME 2009\u20135th Conference on Ph.D. Research in Microelectronics and Electronics, Circuits and Systems Magazine, IEEE Xplore (2009)","DOI":"10.1109\/RME.2009.5201339"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-642-40026-1_10","volume-title":"Constructive Side-Channel Analysis and Secure Design","author":"J Bl\u00f6mer","year":"2013","unstructured":"Bl\u00f6mer, J., G\u00fcnther, P., Liske, G.: Improved side channel attacks on pairing based cryptography. In: Prouff, E. (ed.) COSADE 2013. LNCS, vol. 7864, pp. 154\u2013168. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40026-1_10"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Unterluggauer, T., Wenger, E.: Practical attack on bilinear pairings to disclose the secrets of embedded devices. In: 2014 Ninth International Conference on Availability, Reliability and Security, pp. 69\u201377 (2014)","DOI":"10.1109\/ARES.2014.16"},{"issue":"1","key":"17_CR7","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s12095-014-0114-5","volume":"7","author":"N El Mrabet","year":"2015","unstructured":"El Mrabet, N., Fournier, J.J.A., Goubin, L., Lashermes, R.: A survey of fault attacks in pairing based cryptography. Cryptogr. Commun. 7(1), 185\u2013205 (2015)","journal-title":"Cryptogr. Commun."},{"key":"17_CR8","series-title":"CRC Cryptography and Network Security Series","doi-asserted-by":"publisher","DOI":"10.1201\/9781315370170","volume-title":"Guide to Pairing-Based Cryptography","author":"N El Mrabet","year":"2017","unstructured":"El Mrabet, N., Joye, M.: Guide to Pairing-Based Cryptography. CRC Cryptography and Network Security Series, Chapman & Hall\/CRC Press, Boca Raton (2017)"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13389-018-00201-3","volume":"10","author":"D Jauvart","year":"2019","unstructured":"Jauvart, D., El Mrabet, N., Fournier, J.J.A., Goubin, L.: Improving side-channel attacks against pairing-based cryptography. J. Cryptogr. Eng. 10, 1\u20136 (2019)","journal-title":"J. Cryptogr. Eng."},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-642-13797-6_9","volume-title":"Arithmetic of Finite Fields","author":"S Chatterjee","year":"2010","unstructured":"Chatterjee, S., Hankerson, D., Menezes, A.: On the efficiency and security of pairing-based protocols in the type\u00a01 and type\u00a04 settings. In: Hasan, M.A., Helleseth, T. (eds.) WAIFI 2010. LNCS, vol. 6087, pp. 114\u2013134. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13797-6_9"},{"issue":"6","key":"17_CR11","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1109\/TDSC.2015.2507120","volume":"14","author":"R Azarderakhsh","year":"2017","unstructured":"Azarderakhsh, R., et al.: Fast software implementations of bilinear pairings. IEEE Trans. Depend. Secur. Comput. 14(6), 605\u2013619 (2017)","journal-title":"IEEE Trans. Depend. Secur. Comput."},{"issue":"5","key":"17_CR12","doi-asserted-by":"publisher","first-page":"1717","DOI":"10.1109\/18.771254","volume":"45","author":"G Frey","year":"1999","unstructured":"Frey, G., M\u00fcller, M., R\u00fcck, H.-G.: The TATE pairing and the discrete logarithm applied to elliptic curve cryptosystems. IEEE Trans. Inf. Theory 45(5), 1717\u20131719 (1999)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"17_CR13","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00145-004-0315-8","volume":"17","author":"VS Miller","year":"2004","unstructured":"Miller, V.S.: The Weill pairing, and its efficient calculation. J. Cryptol. 17(4), 235\u2013261 (2004)","journal-title":"J. Cryptol."},{"key":"17_CR14","doi-asserted-by":"publisher","first-page":"1075","DOI":"10.1109\/TC.2006.134","volume":"55\u20139","author":"D Page","year":"2006","unstructured":"Page, D., Vercauteren, F.: Fault and side channel attacks on pairing based cryptography. IEEE Trans. Comput. 55\u20139, 1075\u20131080 (2006)","journal-title":"IEEE Trans. Comput."},{"key":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/11958239_7","volume-title":"Progress in Cryptology - VIETCRYPT 2006","author":"C Whelan","year":"2006","unstructured":"Whelan, C., Scott, M.: Side channel analysis of practical pairing implementations: which path is more secure? In: Nguyen, P.Q. (ed.) VIETCRYPT 2006. LNCS, vol. 4341, pp. 99\u2013114. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11958239_7"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Unterluggauer, T., Wenger, E.: Practical attack on bilinear pairings to disclose the secrets of embedded devices. In: 2014 Ninth International Conference on Availability, Reliability and Security, pp. 69\u201377, September 2014","DOI":"10.1109\/ARES.2014.16"},{"key":"17_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-319-54876-0_16","volume-title":"Risks and Security of Internet and Systems","author":"D Jauvart","year":"2017","unstructured":"Jauvart, D., Fournier, J.J.A., El-Mrabet, N., Goubin, L.: Improving side-channel attacks against pairing-based cryptography. In: Cuppens, F., Cuppens, N., Lanet, J.-L., Legay, A. (eds.) CRiSIS 2016. LNCS, vol. 10158, pp. 199\u2013213. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-54876-0_16"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Nadia El Mrabet, Louis Goubin, Sylvain Guilley, Jacques Fournier, Damien Jauvart, Martin Moreau, Pablo Rauzy, and Franck Rondepierre. Physical Attacks, chapter 12. CRC Press, 2016","DOI":"10.1201\/9781315370170-12"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"Meloni, N.: New point addition formulae for ECC applications. In: Arithmetic of Finite Fields, First International Workshop, WAIFI 2007, Madrid, Spain, June 21\u201322, 2007, Proceedings, pp. 189\u2013201 (2007)","DOI":"10.1007\/978-3-540-73074-3_15"},{"issue":"2","key":"17_CR20","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/s00145-009-9048-z","volume":"23","author":"D Freeman","year":"2010","unstructured":"Freeman, D., Scott, M., Teske, E.: A taxonomy of pairing-friendly elliptic curves. J. Cryptol. 23(2), 224\u2013280 (2010)","journal-title":"J. Cryptol."},{"issue":"1","key":"17_CR21","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1109\/TIT.2009.2034881","volume":"56","author":"F Vercauteren","year":"2010","unstructured":"Vercauteren, F.: Optimal pairings. IEEE Trans. Inf. Theory 56(1), 455\u2013461 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"17_CR22","volume-title":"Handbook of Elliptic and Hyperelliptic Curve Cryptography","author":"H Cohen","year":"2012","unstructured":"Cohen, H., et al.: Handbook of Elliptic and Hyperelliptic Curve Cryptography, 2nd edn. Chapman & Hall\/CRC, Boca Raton (2012)","edition":"2"},{"key":"17_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-642-17401-8_18","volume-title":"Progress in Cryptology - INDOCRYPT 2010","author":"F Herbaut","year":"2010","unstructured":"Herbaut, F., Liardet, P.-Y., M\u00e9loni, N., T\u00e9glia, Y., V\u00e9ron, P.: Random Euclidean addition chain generation and its application to point multiplication. In: Gong, G., Gupta, K.C. (eds.) INDOCRYPT 2010. LNCS, vol. 6498, pp. 238\u2013261. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17401-8_18"},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"Knuth, D., Yao, A.: Analysis of the subtractive algorithm for greater common divisors, pp. 4720\u20134722, December 1975","DOI":"10.1073\/pnas.72.12.4720"},{"key":"17_CR25","unstructured":"Zeckendof, E.: Repr\u00e9sentations des nombres naturels par une somme de nombre de Fibonacci ou de nombres de Lucas. Bulletin de la Soci\u00e9t\u00e9 Royale des Sciences de Li\u00e8ge (1972)"},{"key":"17_CR26","doi-asserted-by":"crossref","unstructured":"Pereira Geovandro, C.C.F., Simpl\u00edcio Jr., M.A., Naehrig, M., Barreto,P.S.L.M.: A family of implementation-friendly BN elliptic curves. J. Syst. Softw. 84(8), 1319\u20131326 (2011)","DOI":"10.1016\/j.jss.2011.03.083"},{"key":"17_CR27","doi-asserted-by":"crossref","unstructured":"Barreto, P.S.L.M., Lynn, B., Scott, M.: Constructing elliptic curves with prescribed embedding degrees. In: Security in Communication Networks (2002)","DOI":"10.1007\/3-540-36413-7_19"},{"key":"17_CR28","doi-asserted-by":"publisher","first-page":"1298","DOI":"10.1007\/s00145-018-9280-5","volume":"32","author":"R Barbulescu","year":"2019","unstructured":"Barbulescu, R., Duquesne, S.: Updating key size estimations for pairings. J. Cryptol. 32, 1298\u20131336 (2019)","journal-title":"J. Cryptol."},{"key":"17_CR29","unstructured":"Black-box wallets: Fast anonymous two-way payments for constrained devices. IACR Cryptology ePrint Archive, p. 1199 (2019)"},{"key":"17_CR30","doi-asserted-by":"crossref","unstructured":"Canard, S., Diop, U., Kheir, N., Paindavoine, M., Sabt, M.: Blindids: market-compliant and privacy-friendly intrusion detection system over encrypted traffic. In: AsiaCCS 2017, Abu Dhabi, Emirats Arabes Unis, 2\u20136 avril, pp. 561\u2013574 (2017)","DOI":"10.1145\/3052973.3053013"},{"key":"17_CR31","first-page":"1212","volume":"2015","author":"S Duquesne","year":"2015","unstructured":"Duquesne, S., El Mrabet, N., Haloui, S., Rondepierre, F.: Choosing and generating parameters for low level pairing implementation on BN curves. IACR Cryptol. ePrint Archive 2015, 1212 (2015)","journal-title":"IACR Cryptol. ePrint Archive"},{"key":"17_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-642-24586-2_4","volume-title":"Security Aspects in Information Technology","author":"S Ghosh","year":"2011","unstructured":"Ghosh, S., Roychowdhury, D.: Security of prime field pairing cryptoprocessor against differential power attack. In: Joye, M., Mukhopadhyay, D., Tunstall, M. (eds.) InfoSecHiComNet 2011. LNCS, vol. 7011, pp. 16\u201329. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24586-2_4"},{"key":"17_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/978-3-642-19475-7_36","volume-title":"Reconfigurable Computing: Architectures, Tools and Applications","author":"W Pan","year":"2011","unstructured":"Pan, W., Marnane, W.P.: A correlation power analysis attack against Tate pairing on FPGA. In: Koch, A., Krishnamurthy, R., McAllister, J., Woods, R., El-Ghazawi, T. (eds.) ARC 2011. LNCS, vol. 6578, pp. 340\u2013349. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19475-7_36"},{"key":"17_CR34","unstructured":"Page, D., Vercauteren, F.: Fault and Side-Channel Attacks on Pairing Based Cryptography (2004)"},{"key":"17_CR35","doi-asserted-by":"crossref","unstructured":"Whelan, C., Scott, M.: Side channel analysis of practical pairing implementations: which path is more secure? In: VIETCRYPT 2006, pp. 99\u2013114 (2006)","DOI":"10.1007\/11958239_7"},{"key":"17_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-642-02617-1_13","volume-title":"Advances in Information Security and Assurance","author":"N Mrabet","year":"2009","unstructured":"Mrabet, N.: What about vulnerability to a fault attack of the Miller\u2019s algorithm during an identity based protocol? In: Park, J.H., Chen, H.-H., Atiquzzaman, M., Lee, C., Kim, T., Yeo, S.-S. (eds.) ISA 2009. LNCS, vol. 5576, pp. 122\u2013134. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02617-1_13"},{"key":"17_CR37","doi-asserted-by":"crossref","unstructured":"Unterluggauer, T., Wenger, E.: Practical attack on bilinear pairings to disclose the secrets of embedded devices. In: ARES, pp. 69\u201377 (2014)","DOI":"10.1109\/ARES.2014.16"},{"key":"17_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-319-18681-8_21","volume-title":"Codes, Cryptology, and Information Security","author":"N El Mrabet","year":"2015","unstructured":"El Mrabet, N., Fouotsa, E.: Failure of the point blinding countermeasure against fault attack in pairing-based cryptography. In: El Hajji, S., Nitaj, A., Carlet, C., Souidi, E.M. (eds.) C2SI 2015. LNCS, vol. 9084, pp. 259\u2013273. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18681-8_21"},{"key":"17_CR39","doi-asserted-by":"crossref","unstructured":"\u00d6zt\u00fcrk, E., Gaubatz, G., Sunar, B.: Tate pairing with strong fault resiliency. In: Fourth International Workshop on Fault Diagnosis and Tolerance in Cryptography, 2007, FDTC 2007, Vienna, Austria, 10 September 2007, pp. 103\u2013111 (2007)","DOI":"10.1109\/FDTC.2007.18"},{"key":"17_CR40","unstructured":"Ghosh, S., Mukhopadhyay, D., Chowdhury, D.R.: Fault attack, countermeasures on pairing based cryptography. I. J. Netw. Secur. 12(1), 21\u201328 (2011)"},{"key":"17_CR41","doi-asserted-by":"crossref","unstructured":"Lashermes, R., Paindavoine, M., El Mrabet, N., Fournier, J.J.A., Goubin, L.: Practical validation of several fault attacks against the miller algorithm. In: 2014 Workshop on Fault Diagnosis and Tolerance in Cryptography, FDTC 2014, Busan, South Korea, 23 September 2014, pp. 115\u2013122 (2014)","DOI":"10.1109\/FDTC.2014.21"},{"key":"17_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-13039-2_1","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2014","author":"B Feix","year":"2014","unstructured":"Feix, B., Roussellet, M., Venelli, A.: Side-channel analysis on blinded regular scalar multiplications. In: Meier, W., Mukhopadhyay, D. (eds.) INDOCRYPT 2014. LNCS, vol. 8885, pp. 3\u201320. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13039-2_1"},{"key":"17_CR43","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-319-44318-8_5","volume-title":"Hardware Security and Trust","author":"AP Fournaris","year":"2017","unstructured":"Fournaris, A.P.: Fault and power analysis attack protection techniques for standardized public key cryptosystems. In: Sklavos, N., Chaves, R., Di Natale, G., Regazzoni, F. (eds.) Hardware Security and Trust, pp. 93\u2013105. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-44318-8_5"}],"container-title":["Lecture Notes in Computer Science","Arithmetic of Finite Fields"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22944-2_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T10:16:33Z","timestamp":1673432193000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22944-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031229435","9783031229442"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22944-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"11 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAIFI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on the Arithmetic of Finite Fields","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chengdu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waifi2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/waifi.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"25","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":"76% - 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":"2","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":"3","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":"3 (invited papers from invited speakers)","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)"}}]}}