{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T23:19:19Z","timestamp":1773962359246,"version":"3.50.1"},"publisher-location":"Cham","reference-count":46,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030354220","type":"print"},{"value":"9783030354237","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-35423-7_19","type":"book-chapter","created":{"date-parts":[[2019,12,9]],"date-time":"2019-12-09T00:02:46Z","timestamp":1575849766000},"page":"375-397","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["The Complete Cost of Cofactor $$h=1$$"],"prefix":"10.1007","author":[{"given":"Peter","family":"Schwabe","sequence":"first","affiliation":[]},{"given":"Amber","family":"Sprenkels","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,19]]},"reference":[{"key":"19_CR1","unstructured":"Arcieri, T., de Valence, H., Lovecruft, I.: The Ristretto Group. https:\/\/ristretto.group\/ristretto.html. Accessed 31 July 2019"},{"key":"19_CR2","volume-title":"Serious Cryptography: A Practical Introduction to Modern Encryption","author":"JP Aumasson","year":"2017","unstructured":"Aumasson, J.P.: Serious Cryptography: A Practical Introduction to Modern Encryption. No Starch Press, San Francisco (2017)"},{"key":"19_CR3","unstructured":"Barreto, P.S.L.M.: Tweet (2017). https:\/\/twitter.com\/pbarreto\/status\/869103226276134912"},{"key":"19_CR4","unstructured":"Bernstein, D.J.: A software implementation of NIST P-224. In: Talk at the Workshop on Elliptic Curve Cryptography - ECC 2001 (2001). http:\/\/cr.yp.to\/talks.html#2001.10.29"},{"key":"19_CR5","unstructured":"Bernstein, D.J.: Floating-point arithmetic and message authentication (2004). http:\/\/cr.yp.to\/papers.html#hash127"},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/11745853_14","volume-title":"Public Key Cryptography - PKC 2006","author":"DJ Bernstein","year":"2006","unstructured":"Bernstein, D.J.: Curve25519: new Diffie-Hellman speed records. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T. (eds.) PKC 2006. LNCS, vol. 3958, pp. 207\u2013228. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11745853_14. http:\/\/cr.yp.to\/papers.html#curve25519"},{"key":"19_CR7","unstructured":"Bernstein, D.J.: 25519 naming. Posting to the CFRG mailing list (2014). https:\/\/www.ietf.org\/mail-archive\/web\/cfrg\/current\/msg04996.html"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-540-68164-9_26","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2008","author":"DJ Bernstein","year":"2008","unstructured":"Bernstein, D.J., Birkner, P., Joye, M., Lange, T., Peters, C.: Twisted Edwards curves. In: Vaudenay, S. (ed.) AFRICACRYPT 2008. LNCS, vol. 5023, pp. 389\u2013405. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68164-9_26. http:\/\/cr.yp.to\/papers.html#twisted"},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-642-23951-9_9","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2011","author":"DJ Bernstein","year":"2011","unstructured":"Bernstein, D.J., Duif, N., Lange, T., Schwabe, P., Yang, B.-Y.: High-speed high-security signatures. In: Preneel, B., Takagi, T. (eds.) CHES 2011. LNCS, vol. 6917, pp. 124\u2013142. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23951-9_9. See also full version [10]"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., Duif, N., Lange, T., Schwabe, P., Yang, B.Y.: High-speed high-security signatures. J. Cryptogr. Eng. 2(2), 77\u201389 (2012). http:\/\/cryptojedi.org\/papers\/#ed25519. See also short version [9]","DOI":"10.1007\/s13389-012-0027-1"},{"key":"19_CR11","unstructured":"Bernstein, D.J., Lange, T.: eBACS: ECRYPT Benchmarking of Cryptographic Systems. https:\/\/bench.cr.yp.to\/results-sign.html. Accessed 03 Oct 2019"},{"key":"19_CR12","unstructured":"Bernstein, D.J., Lange, T.: SafeCurves: choosing safe curves for elliptic-curve cryptography. https:\/\/safecurves.cr.yp.to. Accessed 31 July 2019"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-540-76900-2_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2007","author":"DJ Bernstein","year":"2007","unstructured":"Bernstein, D.J., Lange, T.: Faster addition and doubling on elliptic curves. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol. 4833, pp. 29\u201350. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-76900-2_3. https:\/\/cr.yp.to\/papers.html#newelliptic"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/978-3-642-19379-8_8","volume-title":"Public Key Cryptography \u2013 PKC 2011","author":"DJ Bernstein","year":"2011","unstructured":"Bernstein, D.J., Lange, T., Schwabe, P.: On the correct use of the negation map in the Pollard rho method. In: Catalano, D., Fazio, N., Gennaro, R., Nicolosi, A. (eds.) PKC 2011. LNCS, vol. 6571, pp. 128\u2013146. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19379-8_8. https:\/\/cryptojedi.org\/papers\/#negation"},{"key":"19_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/978-3-642-33027-8_19","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2012","author":"DJ Bernstein","year":"2012","unstructured":"Bernstein, D.J., Schwabe, P.: NEON crypto. In: Prouff, E., Schaumont, P. (eds.) CHES 2012. LNCS, vol. 7428, pp. 320\u2013339. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33027-8_19. https:\/\/cryptojedi.org\/papers\/#neoncypto"},{"issue":"3","key":"19_CR16","doi-asserted-by":"publisher","first-page":"340","DOI":"10.46586\/tches.v2019.i3.340-398","volume":"2019","author":"DJ Bernstein","year":"2019","unstructured":"Bernstein, D.J., Yang, B.Y.: Fast constant-time GCD computation and modular inversion. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2019(3), 340\u2013398 (2019). https:\/\/tches.iacr.org\/index.php\/TCHES\/article\/view\/8298","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst."},{"issue":"4","key":"19_CR17","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s13389-015-0097-y","volume":"6","author":"JW Bos","year":"2016","unstructured":"Bos, J.W., Costello, C., Longa, P., Naehrig, M.: Selecting elliptic curves for cryptography: an efficiency and security analysis. J. Cryptogr. Eng. 6(4), 259\u2013286 (2016). https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2016\/02\/selecting.pdf","journal-title":"J. Cryptogr. Eng."},{"issue":"2","key":"19_CR18","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1006\/jnth.1995.1088","volume":"53","author":"W Bosma","year":"1995","unstructured":"Bosma, W., Lenstra, H.W.: Complete systems of two addition laws for elliptic curves. J. Number Theory 53(2), 229\u2013240 (1995). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0022314X85710888","journal-title":"J. Number Theory"},{"key":"19_CR19","doi-asserted-by":"publisher","unstructured":"Chou, T.: Sandy2x: new Curve25519 speed records. In: Dunkelman, O., Keliher, L. (eds.) SAC 2015. LNCS, vol. 9566, pp. 145\u2013160. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-31301-6_8. https:\/\/www.win.tue.nl\/~tchou\/papers\/sandy2x.pdf","DOI":"10.1007\/978-3-319-31301-6_8"},{"key":"19_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/3-540-49649-1_6","volume-title":"Advances in Cryptology \u2014 ASIACRYPT\u201998","author":"H Cohen","year":"1998","unstructured":"Cohen, H., Miyaji, A., Ono, T.: Efficient elliptic curve exponentiation using mixed coordinates. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol. 1514, pp. 51\u201365. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-49649-1_6"},{"key":"19_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-662-48797-6_10","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"C Costello","year":"2015","unstructured":"Costello, C., Longa, P.: Four$$\\mathbb{Q}$$: four-dimensional decompositions on a $$\\mathbb{Q}$$-curve over the Mersenne prime. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9452, pp. 214\u2013235. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48797-6_10. https:\/\/eprint.iacr.org\/2015\/565.pdf"},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"Cremers, C., Jackson, D.: Prime, order please! Revisiting small subgroup and invalid curve attacks on protocols using Diffie-Hellman. Cryptology ePrint Archive, Report 2019\/526 (2019). https:\/\/eprint.iacr.org\/2019\/526","DOI":"10.1109\/CSF.2019.00013"},{"issue":"3","key":"19_CR23","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1090\/S0273-0979-07-01153-6","volume":"44","author":"HM Edwards","year":"2007","unstructured":"Edwards, H.M.: A normal form for elliptic curves. Bull. (New Series) Am. Math. Soc. 44(3), 393\u2013422 (2007). https:\/\/www.ams.org\/journals\/bull\/2007-44-03\/S0273-0979-07-01153-6\/S0273-0979-07-01153-6.pdf","journal-title":"Bull. (New Series) Am. Math. Soc."},{"key":"19_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/978-3-319-22174-8_18","volume-title":"Progress in Cryptology \u2013 LATINCRYPT 2015","author":"A Faz-Hern\u00e1ndez","year":"2015","unstructured":"Faz-Hern\u00e1ndez, A., L\u00f3pez, J.: Fast implementation of Curve25519 using AVX2. In: Lauter, K., Rodr\u00edguez-Henr\u00edquez, F. (eds.) LATINCRYPT 2015. LNCS, vol. 9230, pp. 329\u2013345. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-22174-8_18"},{"key":"19_CR25","unstructured":"Fujii, H.: Efficient Curve25519 implementation for ARM microcontrollers. Master\u2019s thesis, Universidade Estadual de Campinas (2018). http:\/\/taurus.unicamp.br\/bitstream\/REPOSIP\/332957\/1\/Fujii_Hayato_M.pdf"},{"key":"19_CR26","doi-asserted-by":"publisher","unstructured":"Fujii, H., Aranha, D.F.: Curve25519 for the Cortex-M4 and beyond. In: Lange, T., Dunkelman, O. (eds.) LATINCRYPT 2017. LNCS, vol. 11368, pp. 109\u2013127. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25283-0_6. http:\/\/www.cs.haifa.ac.il\/~orrd\/LC17\/paper39.pdf","DOI":"10.1007\/978-3-030-25283-0_6"},{"key":"19_CR27","doi-asserted-by":"crossref","unstructured":"Haase, B., Labrique, B.: AuCPace: Efficient verifier-based PAKE protocol tailored for the IIoT. IACR Trans. Cryptogr. Hardw. Embed. Syst. 1\u201348 (2019). https:\/\/tches.iacr.org\/index.php\/TCHES\/article\/view\/7384","DOI":"10.46586\/tches.v2019.i2.1-48"},{"key":"19_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1007\/978-3-662-47989-6_34","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"M Hamburg","year":"2015","unstructured":"Hamburg, M.: Decaf: eliminating cofactors through point compression. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9215, pp. 705\u2013723. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47989-6_34. https:\/\/www.shiftleft.org\/papers\/decaf\/"},{"key":"19_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-540-89255-7_20","volume-title":"Advances in Cryptology - ASIACRYPT 2008","author":"H Hisil","year":"2008","unstructured":"Hisil, H., Wong, K.K.-H., Carter, G., Dawson, E.: Twisted Edwards curves revisited. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol. 5350, pp. 326\u2013343. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-89255-7_20. http:\/\/eprint.iacr.org\/2008\/522\/"},{"issue":"3","key":"19_CR30","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s13389-015-0093-2","volume":"5","author":"M Hutter","year":"2015","unstructured":"Hutter, M., Schwabe, P.: Multiprecision multiplication on AVR revisited. J. Cryptogr. Eng. 5(3), 201\u2013214 (2015). http:\/\/cryptojedi.org\/papers\/#avrmul","journal-title":"J. Cryptogr. Eng."},{"key":"19_CR31","unstructured":"Karatsuba, A., Ofman, Y.: Multiplication of multidigit numbers on automata. Soviet Physics Doklady 7, 595\u2013596 (1963). Translated from Doklady Akademii Nauk SSSR, 145(2), 293\u2013294, July 1962"},{"key":"19_CR32","unstructured":"Kerry, C.F., Director, C.R.: FIPS PUB 186\u20134 federal information processing standards publication digital signature standard (DSS) (2013). http:\/\/nvlpubs.nist.gov\/nistpubs\/FIPS\/NIST.FIPS.186-4.pdf"},{"key":"19_CR33","unstructured":"Kim, K.H., Choe, J., Kim, S.Y., Kim, N., Hong, S.: Speeding up elliptic curve scalar multiplication without precomputation. Cryptology ePrint Archive, Report 2017\/669 (2017). https:\/\/eprint.iacr.org\/2017\/669.pdf"},{"key":"19_CR34","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1090\/S0025-5718-1987-0866109-5","volume":"48","author":"N Koblitz","year":"1987","unstructured":"Koblitz, N.: Elliptic curve cryptosystems. Math. Comput. 48, 209\u2013209 (1987). https:\/\/www.ams.org\/journals\/mcom\/1987-48-177\/S0025-5718-1987-0866109-5\/S0025-5718-1987-0866109-5.pdf","journal-title":"Math. Comput."},{"key":"19_CR35","unstructured":"Ladd, W., Longa, P., Barnes, R.: Curve4Q. IETF CFRG Internet Draft (2017). https:\/\/tools.ietf.org\/html\/draft-ladd-cfrg-4q-00. Accessed 18 Aug 2019"},{"key":"19_CR36","unstructured":"luigi1111, Spagni, R. (\u201cfluffypony\u201d): Disclosure of a major bug in CryptoNote based currencies. Post on the Monero website (2017). https:\/\/www.getmonero.org\/2017\/05\/17\/disclosure-of-a-major-bug-in-cryptonote-based-currencies.html. Accessed 31 Aug 2019"},{"key":"19_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-319-49445-6_5","volume-title":"Security, Privacy, and Applied Cryptography Engineering","author":"PMC Massolino","year":"2016","unstructured":"Massolino, P.M.C., Renes, J., Batina, L.: Implementing complete formulas on\u00a0Weierstrass curves in hardware. In: Carlet, C., Hasan, M.A., Saraswat, V. (eds.) SPACE 2016. LNCS, vol. 10076, pp. 89\u2013108. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-49445-6_5. https:\/\/eprint.iacr.org\/2016\/1133.pdf"},{"key":"19_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-39799-X_31","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201985 Proceedings","author":"VS Miller","year":"1986","unstructured":"Miller, V.S.: Use of elliptic curves in cryptography. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 417\u2013426. Springer, Heidelberg (1986). https:\/\/doi.org\/10.1007\/3-540-39799-X_31"},{"issue":"177","key":"19_CR39","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(177), 243\u2013264 (1987). http:\/\/www.ams.org\/journals\/mcom\/1987-48-177\/S0025-5718-1987-0866113-7\/S0025-5718-1987-0866113-7.pdf","journal-title":"Math. Comput."},{"key":"19_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/978-3-319-72565-9_9","volume-title":"Selected Areas in Cryptography \u2013 SAC 2017","author":"T Oliveira","year":"2018","unstructured":"Oliveira, T., L\u00f3pez, J., H\u0131\u015f\u0131l, H., Faz-Hern\u00e1ndez, A., Rodr\u00edguez-Henr\u00edquez, F.: How to (pre-)compute a ladder. In: Adams, C., Camenisch, J. (eds.) SAC 2017. LNCS, vol. 10719, pp. 172\u2013191. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-72565-9_9. https:\/\/eprint.iacr.org\/2017\/264.pdf"},{"key":"19_CR41","unstructured":"OpenSSL: Cryptography and SSL\/TLS toolkit. http:\/\/www.openssl.org\/. Accessed 18 Aug 2019"},{"key":"19_CR42","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. http:\/\/eprint.iacr.org\/2015\/1060"},{"key":"19_CR43","unstructured":"Santis, F.D., Sigl, G.: Towards side-channel protected X25519 on ARM Cortex-M4 processors. In: SPEED-B \u2013 Software performance enhancement for encryption and decryption, and benchmarking (2016). https:\/\/ccccspeed.win.tue.nl\/papers\/SPEED-B_Final.pdf"},{"key":"19_CR44","unstructured":"STMicroelelectronics: RM0090 reference manual (2019). https:\/\/www.st.com\/content\/ccc\/resource\/technical\/document\/reference_manual\/3d\/6d\/5a\/66\/b4\/99\/40\/d4\/DM00031020.pdf\/files\/DM00031020.pdf\/jcr:content\/translations\/en.DM00031020.pdf"},{"key":"19_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-319-54669-8_10","volume-title":"Smart Card Research and Advanced Applications","author":"R Susella","year":"2017","unstructured":"Susella, R., Montrasio, S.: A compact and exception-free ladder for all short Weierstrass elliptic curves. In: Lemke-Rust, K., Tunstall, M. (eds.) CARDIS 2016. LNCS, vol. 10146, pp. 156\u2013173. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-54669-8_10"},{"key":"19_CR46","unstructured":"de Valence, H., Grigg, J., Tankersley, G., Valsorda, F., Lovecruft, I.: The ristretto255 group. IETF CFRG Internet Draft (2019). https:\/\/tools.ietf.org\/html\/draft-hdevalence-cfrg-ristretto-01. Accessed 31 July 2019"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 INDOCRYPT 2019"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-35423-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T17:46:13Z","timestamp":1709833573000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-35423-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030354220","9783030354237"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-35423-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"19 November 2019","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":"Hyderabad","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"indocrypt2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.isical.ac.in\/~indocrypt2019\/#\/","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":"90","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":"28","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":"31% - 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.67","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":"6","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":"Please note that there were 110 submissions, but 20 were not peer-reviewed because they were withdrawn before the deadline or they violated the submission policy.","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)"}}]}}