{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:40:38Z","timestamp":1742913638390,"version":"3.40.3"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030925178"},{"type":"electronic","value":"9783030925185"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-92518-5_14","type":"book-chapter","created":{"date-parts":[[2021,12,8]],"date-time":"2021-12-08T07:03:27Z","timestamp":1638947007000},"page":"287-310","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Differential Fault Attack on\u00a0Montgomery Ladder and\u00a0in the\u00a0Presence of\u00a0Scalar Randomization"],"prefix":"10.1007","author":[{"given":"Andy","family":"Russon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,9]]},"reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-319-76953-0_18","volume-title":"Topics in Cryptology \u2013 CT-RSA 2018","author":"C Ambrose","year":"2018","unstructured":"Ambrose, C., Bos, J.W., Fay, B., Joye, M., Lochter, M., Murray, B.: Differential attacks on deterministic signatures. In: Smart, N.P. (ed.) CT-RSA 2018. LNCS, vol. 10808, pp. 339\u2013353. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-76953-0_18"},{"key":"14_CR2","doi-asserted-by":"publisher","unstructured":"Barenghi, A., Bertoni, G.M., Breveglieri, L., Pelosi, G., Sanfilippo, S., Susella, R.: A fault-based secret key retrieval method for ECDSA: analysis and countermeasure. ACM J. Emerg. Technol. Comput. Syst. 13(1), 8:1\u20138:26 (2016). https:\/\/doi.org\/10.1145\/2767132","DOI":"10.1145\/2767132"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/3-540-44598-6_8","volume-title":"Advances in Cryptology \u2014 CRYPTO 2000","author":"I Biehl","year":"2000","unstructured":"Biehl, I., Meyer, B., M\u00fcller, V.: Differential fault attacks on elliptic curve cryptosystems. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 131\u2013146. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44598-6_8"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/BFb0052259","volume-title":"Advances in Cryptology \u2014 CRYPTO 1997","author":"E Biham","year":"1997","unstructured":"Biham, E., Shamir, A.: Differential fault analysis of secret key cryptosystems. In: Kaliski, B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 513\u2013525. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0052259"},{"key":"14_CR5","doi-asserted-by":"publisher","unstructured":"Bl\u00f6mer, J., G\u00fcnther, P.: Singular curve point decompression attack. In: Homma, N., Lomn\u00e9, V. (eds.) FDTC 2015, pp. 71\u201384. IEEE Computer Society (2015). https:\/\/doi.org\/10.1109\/FDTC.2015.17","DOI":"10.1109\/FDTC.2015.17"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/11889700_4","volume-title":"Fault Diagnosis and Tolerance in Cryptography","author":"J Bl\u00f6mer","year":"2006","unstructured":"Bl\u00f6mer, J., Otto, M., Seifert, J.-P.: Sign change fault attacks on elliptic curve cryptosystems. In: Breveglieri, L., Koren, I., Naccache, D., Seifert, J.-P. (eds.) FDTC 2006. LNCS, vol. 4236, pp. 36\u201352. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11889700_4"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/3-540-69053-0_4","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1997","author":"D Boneh","year":"1997","unstructured":"Boneh, D., DeMillo, R.A., Lipton, R.J.: On the importance of checking cryptographic protocols for faults. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 37\u201351. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-69053-0_4"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/3-540-68697-5_11","volume-title":"Advances in Cryptology \u2014 CRYPTO 1996","author":"D Boneh","year":"1996","unstructured":"Boneh, D., Venkatesan, R.: Hardness of computing the most significant bits of secret keys in Diffie-Hellman and related schemes. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 129\u2013142. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68697-5_11"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/3-540-45664-3_24","volume-title":"Public Key Cryptography","author":"\u00c9 Brier","year":"2002","unstructured":"Brier, \u00c9., Joye, M.: Weierstra\u00df elliptic curves and side-channel attacks. In: Naccache, D., Paillier, P. (eds.) PKC 2002. LNCS, vol. 2274, pp. 335\u2013345. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45664-3_24"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-3-642-23822-2_20","volume-title":"Computer Security \u2013 ESORICS 2011","author":"BB Brumley","year":"2011","unstructured":"Brumley, B.B., Tuveri, N.: Remote timing attacks are still practical. In: Atluri, V., Diaz, C. (eds.) ESORICS 2011. LNCS, vol. 6879, pp. 355\u2013371. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23822-2_20"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-319-30840-1_19","volume-title":"Information Security and Cryptology - ICISC 2015","author":"W Cao","year":"2016","unstructured":"Cao, W., et al.: Two lattice-based differential fault attacks against ECDSA with wNAF algorithm. In: Kwon, S., Yun, A. (eds.) ICISC 2015. LNCS, vol. 9558, pp. 297\u2013313. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-30840-1_19"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-540-39927-8_32","volume-title":"Information and Communications Security","author":"M Ciet","year":"2003","unstructured":"Ciet, M., Joye, M.: (Virtually) free randomization techniques for elliptic curve cryptography. In: Qing, S., Gollmann, D., Zhou, J. (eds.) ICICS 2003. LNCS, vol. 2836, pp. 348\u2013359. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39927-8_32"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/3-540-48059-5_25","volume-title":"Cryptographic Hardware and Embedded Systems","author":"J-S Coron","year":"1999","unstructured":"Coron, J.-S.: Resistance against differential power analysis for elliptic curve cryptosystems. In: Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 1999. LNCS, vol. 1717, pp. 292\u2013302. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48059-5_25"},{"issue":"1","key":"14_CR14","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s13389-011-0003-1","volume":"1","author":"A Dominguez-Oviedo","year":"2011","unstructured":"Dominguez-Oviedo, A., Hasan, M.A.: Algorithm-Level error detection for Montgomery ladder-based ECSM. J. Cryptogr. Eng. 1(1), 57\u201369 (2011). https:\/\/doi.org\/10.1007\/s13389-011-0003-1","journal-title":"J. Cryptogr. Eng."},{"key":"14_CR15","doi-asserted-by":"publisher","unstructured":"Ebeid, N.M., Lambert, R.: Securing the elliptic curve Montgomery ladder against fault attacks. In: Breveglieri, L., Koren, I., Naccache, D., Oswald, E., Seifert, J. (eds.) FDTC 2009, pp. 46\u201350. IEEE Computer Society (2009). https:\/\/doi.org\/10.1109\/FDTC.2009.35","DOI":"10.1109\/FDTC.2009.35"},{"key":"14_CR16","doi-asserted-by":"publisher","unstructured":"Fouque, P., Lercier, R., R\u00e9al, D., Valette, F.: Fault attack on elliptic curve Montgomery ladder implementation. In: Breveglieri, L., Gueron, S., Koren, I., Naccache, D., Seifert, J. (eds.) FDTC 2008, pp. 92\u201398. IEEE Computer Society (2008). https:\/\/doi.org\/10.1109\/FDTC.2008.15","DOI":"10.1109\/FDTC.2008.15"},{"issue":"2","key":"14_CR17","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s13389-011-0012-0","volume":"1","author":"RR Goundar","year":"2011","unstructured":"Goundar, R.R., Joye, M., Miyaji, A., Rivain, M., Venelli, A.: Scalar multiplication on Weierstra\u00df elliptic curves from co-Z arithmetic. J. Cryptogr. Eng. 1(2), 161\u2013176 (2011). https:\/\/doi.org\/10.1007\/s13389-011-0012-0","journal-title":"J. Cryptogr. Eng."},{"key":"14_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/3-540-45664-3_20","volume-title":"Public Key Cryptography","author":"T Izu","year":"2002","unstructured":"Izu, T., Takagi, T.: A fast parallel elliptic curve multiplication resistant against side channel attacks. In: Naccache, D., Paillier, P. (eds.) PKC 2002. LNCS, vol. 2274, pp. 280\u2013296. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45664-3_20"},{"key":"14_CR19","doi-asserted-by":"publisher","unstructured":"Joye, M.: A method for preventing \u201cskipping\u201d attacks. In: IEEE Symposium on Security and Privacy Workshops, pp. 12\u201315. IEEE Computer Society (2012). https:\/\/doi.org\/10.1109\/SPW.2012.14","DOI":"10.1109\/SPW.2012.14"},{"key":"14_CR20","doi-asserted-by":"publisher","unstructured":"Lenstra, A.K., Lenstra, Hendrik W., J., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Mathematische Annalen 261, 515\u2013534 (1982). https:\/\/doi.org\/10.1007\/BF01457454","DOI":"10.1007\/BF01457454"},{"key":"14_CR21","doi-asserted-by":"publisher","unstructured":"Loiseau, A., Lecomte, M., Fournier, J.J.A.: Template attacks against ECC: practical implementation against Curve25519. In: HOST 2020, pp. 13\u201322. IEEE (2020). https:\/\/doi.org\/10.1109\/HOST45689.2020.9300261","DOI":"10.1109\/HOST45689.2020.9300261"},{"key":"14_CR22","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1090\/S0025-5718-1987-0866113-7","volume":"48","author":"PL Montgomery","year":"1987","unstructured":"Montgomery, P.L.: Speeding the Pollard and elliptic curve methods of factorization. Math. Comput. 48, 243\u2013264 (1987). https:\/\/doi.org\/10.1090\/S0025-5718-1987-0866113-7","journal-title":"Math. Comput."},{"key":"14_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-319-69453-5_6","volume-title":"Selected Areas in Cryptography \u2013 SAC 2016","author":"E Nascimento","year":"2017","unstructured":"Nascimento, E., Chmielewski, \u0141, Oswald, D., Schwabe, P.: Attacking embedded ECC implementations through cmov side channels. In: Avanzi, R., Heys, H. (eds.) SAC 2016. LNCS, vol. 10532, pp. 99\u2013119. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-69453-5_6"},{"key":"14_CR24","unstructured":"National Institute of Standards and Technology: FIPS PUB 186\u20134 Digital Signature Standard (DSS) (2013)"},{"issue":"2","key":"14_CR25","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1023\/A:1025436905711","volume":"30","author":"PQ Nguyen","year":"2003","unstructured":"Nguyen, P.Q., Shparlinski, I.E.: The insecurity of the elliptic curve digital signature algorithm with partially known nonces. Des. Codes Cryptogr. 30(2), 201\u2013217 (2003). https:\/\/doi.org\/10.1023\/A:1025436905711","journal-title":"Des. Codes Cryptogr."},{"key":"14_CR26","doi-asserted-by":"publisher","unstructured":"Poddebniak, D., Somorovsky, J., Schinzel, S., Lochter, M., R\u00f6sler, P.: Attacking deterministic signature schemes using fault attacks. In: EuroS&P 2018, pp. 338\u2013352. IEEE (2018). https:\/\/doi.org\/10.1109\/EuroSP.2018.00031","DOI":"10.1109\/EuroSP.2018.00031"},{"key":"14_CR27","first-page":"918","volume":"32","author":"JM Pollard","year":"1978","unstructured":"Pollard, J.M.: Monte Carlo methods for index computation (mod $$p$$). Math. Comput. 32, 918\u2013924 (1978)","journal-title":"Math. Comput."},{"key":"14_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-662-49890-3_16","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"J Renes","year":"2016","unstructured":"Renes, J., Costello, C., Batina, L.: Complete addition formulas for prime order elliptic curves. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9665, pp. 403\u2013428. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49890-3_16"},{"key":"14_CR29","doi-asserted-by":"publisher","unstructured":"Romailler, Y., Pelissier, S.: Practical fault attack against the Ed25519 and EdDSA signature schemes. In: FDTC 2017, pp. 17\u201324. IEEE Computer Society (2017). https:\/\/doi.org\/10.1109\/FDTC.2017.12","DOI":"10.1109\/FDTC.2017.12"},{"key":"14_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/978-3-319-89339-6_17","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2018","author":"N Samwel","year":"2018","unstructured":"Samwel, N., Batina, L.: Practical fault injection on deterministic signatures: the case of EdDSA. In: Joux, A., Nitaj, A., Rachidi, T. (eds.) AFRICACRYPT 2018. LNCS, vol. 10831, pp. 306\u2013321. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89339-6_17"},{"key":"14_CR31","doi-asserted-by":"publisher","unstructured":"Schmidt, J., Herbst, C.: A practical fault attack on square and multiply. In: Breveglieri, L., Gueron, S., Koren, I., Naccache, D., Seifert, J. (eds.) FDTC 2008, pp. 53\u201358. IEEE Computer Society (2008). https:\/\/doi.org\/10.1109\/FDTC.2008.10","DOI":"10.1109\/FDTC.2008.10"},{"key":"14_CR32","doi-asserted-by":"publisher","unstructured":"Schmidt, J., Medwed, M.: A fault attack on ECDSA. In: Breveglieri, L., Koren, I., Naccache, D., Oswald, E., Seifert, J. (eds.) FDTC 2009, pp. 93\u201399. IEEE Computer Society (2009). https:\/\/doi.org\/10.1109\/FDTC.2009.38","DOI":"10.1109\/FDTC.2009.38"},{"key":"14_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/978-3-642-24209-0_26","volume-title":"Information Security and Cryptology - ICISC 2010","author":"J-M Schmidt","year":"2011","unstructured":"Schmidt, J.-M., Medwed, M.: Fault attacks on the Montgomery powering ladder. In: Rhee, K.-H., Nyang, D.H. (eds.) ICISC 2010. LNCS, vol. 6829, pp. 396\u2013406. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24209-0_26"},{"key":"14_CR34","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01581144","volume":"66","author":"C Schnorr","year":"1994","unstructured":"Schnorr, C., Euchner, M.: Lattice basis reduction: improved practical algorithms and solving subset sum problems. Math. Program. 66, 181\u2013199 (1994). https:\/\/doi.org\/10.1007\/BF01581144","journal-title":"Math. Program."},{"key":"14_CR35","doi-asserted-by":"publisher","unstructured":"Shanks, D.: Class number, a theory of factorization, and genera. In: Proceedings of Symposium Mathematical Society, vol. 20, pp. 415\u2013440 (1971). https:\/\/doi.org\/10.1090\/pspum\/020","DOI":"10.1090\/pspum\/020"},{"key":"14_CR36","doi-asserted-by":"publisher","unstructured":"Takahashi, A., Tibouchi, M.: Degenerate fault attacks on elliptic curve parameters in OpenSSL. In: EuroS&P 2019, pp. 371\u2013386. IEEE (2019). https:\/\/doi.org\/10.1109\/EuroSP.2019.00035","DOI":"10.1109\/EuroSP.2019.00035"},{"key":"14_CR37","unstructured":"The FPLLL development team: fpylll, a Python wraper for the fplll lattice reduction library, Version: 0.5.6 (2021). https:\/\/github.com\/fplll\/fpylll"},{"key":"14_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/3-540-36400-5_9","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2002","author":"E Trichina","year":"2003","unstructured":"Trichina, E., Bellezza, A.: Implementation of elliptic curve cryptography with built-in counter measures against side channel attacks. In: Kaliski, B.S., Ko\u00e7, K., Paar, C. (eds.) CHES 2002. LNCS, vol. 2523, pp. 98\u2013113. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36400-5_9"},{"issue":"1\u20132","key":"14_CR39","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/j.mcm.2011.06.017","volume":"55","author":"I Vasyltsov","year":"2012","unstructured":"Vasyltsov, I., Saldamli, G.: Fault detection and a differential fault analysis countermeasure for the Montgomery power ladder in elliptic curve cryptography. Math. Comput. Model. 55(1\u20132), 256\u2013267 (2012). https:\/\/doi.org\/10.1016\/j.mcm.2011.06.017","journal-title":"Math. Comput. Model."}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 INDOCRYPT 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-92518-5_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:37:01Z","timestamp":1710268621000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92518-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030925178","9783030925185"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92518-5_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"9 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"INDOCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in India","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jaipur","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"indocrypt2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/indocrypt2021.lnmiit.ac.in\/","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":"65","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":"27","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":"42% - 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.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":"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)"}}]}}