{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T01:58:42Z","timestamp":1783562322636,"version":"3.55.0"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030654108","type":"print"},{"value":"9783030654115","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-65411-5_14","type":"book-chapter","created":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T02:22:57Z","timestamp":1607480577000},"page":"280-298","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Curves with Fast Computations in the First Pairing Group"],"prefix":"10.1007","author":[{"given":"R\u00e9mi","family":"Clarisse","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sylvain","family":"Duquesne","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Olivier","family":"Sanders","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,12,9]]},"reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-662-53015-3_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"M Abe","year":"2016","unstructured":"Abe, M., Hoshino, F., Ohkubo, M.: Design in type-I, run in type-III: fast and scalable bilinear-type conversion using integer programming. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9816, pp. 387\u2013415. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53015-3_14"},{"key":"14_CR2","unstructured":"AlLee, G.: EPID for IoT Identity (2016). https:\/\/img.en25.com\/Web\/McAfeeE10BuildProduction\/a6dd7393-63f8-4c08-b3aa-89923182a7e5_EPID_Overview_Public_2016-02-08.pdf"},{"key":"14_CR3","unstructured":"Aranha, D.F., Gouv\u00eaa, C.P.L.: RELIC is an Efficient LIbrary for Cryptography. https:\/\/github.com\/relic-toolkit\/relic"},{"key":"14_CR4","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":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-662-46800-5_6","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"R Barbulescu","year":"2015","unstructured":"Barbulescu, R., Gaudry, P., Guillevic, A., Morain, F.: Improving NFS for the discrete logarithm problem in non-prime finite fields. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 129\u2013155. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_6"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Barki, A., Desmoulins, N., Gharout, S., Traor\u00e9, J.: Anonymous attestations made practical. In: ACM WiSec 2017, pp. 87\u201398. ACM (2017)","DOI":"10.1145\/3098243.3098258"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/3-540-36413-7_19","volume-title":"Security in Communication Networks","author":"PSLM Barreto","year":"2003","unstructured":"Barreto, P.S.L.M., Lynn, B., Scott, M.: Constructing elliptic curves with prescribed embedding degrees. In: Cimato, S., Persiano, G., Galdi, C. (eds.) SCN 2002. LNCS, vol. 2576, pp. 257\u2013267. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36413-7_19"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/11693383_22","volume-title":"Selected Areas in Cryptography","author":"PSLM Barreto","year":"2006","unstructured":"Barreto, P.S.L.M., Naehrig, M.: Pairing-friendly elliptic curves of prime order. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol. 3897, pp. 319\u2013331. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11693383_22"},{"key":"14_CR9","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"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/978-3-642-15317-4_24","volume-title":"Security and Cryptography for Networks","author":"P Bichsel","year":"2010","unstructured":"Bichsel, P., Camenisch, J., Neven, G., Smart, N.P., Warinschi, B.: Get shorty via group signatures without encryption. In: Garay, J.A., De Prisco, R. (eds.) SCN 2010. LNCS, vol. 6280, pp. 381\u2013398. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15317-4_24"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s10623-004-3808-4","volume":"37","author":"F Brezing","year":"2005","unstructured":"Brezing, F., Weng, A.: Elliptic curves suitable for pairing based cryptography. Des. Codes Cryptogr. 37, 133\u2013141 (2005)","journal-title":"Des. Codes Cryptogr."},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Brickell, E.F., Camenisch, J., Chen, L.: Direct anonymous attestation. In: ACM CCS 2004, pp. 132\u2013145. ACM (2004)","DOI":"10.1145\/1030083.1030103"},{"key":"14_CR13","first-page":"3","volume":"1","author":"E Brickell","year":"2011","unstructured":"Brickell, E., Li, J.: Enhanced privacy ID from bilinear pairing for hardware authentication and attestation. Int. J. Inf. Priv. Secur. Integr. 2 1, 3\u201333 (2011). IEEE Computer Society, In IEEE SocialCom","journal-title":"Int. J. Inf. Priv. Secur. Integr. 2"},{"issue":"3","key":"14_CR14","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1109\/TDSC.2011.63","volume":"9","author":"E Brickell","year":"2012","unstructured":"Brickell, E., Li, J.: Enhanced privacy ID: a direct anonymous attestation scheme with enhanced revocation capabilities. IEEE Trans. Dependable Secur. Comput. 9(3), 345\u2013360 (2012)","journal-title":"IEEE Trans. Dependable Secur. Comput."},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/978-3-642-00468-1_27","volume-title":"Public Key Cryptography \u2013 PKC 2009","author":"J Camenisch","year":"2009","unstructured":"Camenisch, J., Kohlweiss, M., Soriente, C.: An accumulator based on bilinear maps and efficient revocation for anonymous credentials. In: Jarecki, S., Tsudik, G. (eds.) PKC 2009. LNCS, vol. 5443, pp. 481\u2013500. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00468-1_27"},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-662-48797-6_13","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"S Chatterjee","year":"2015","unstructured":"Chatterjee, S., Menezes, A.: Type 2 structure-preserving signature schemes revisited. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9452, pp. 286\u2013310. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48797-6_13"},{"key":"14_CR17","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/s00145-018-9307-y","volume":"32","author":"JH Cheon","year":"2019","unstructured":"Cheon, J.H., Han, K., Lee, C., Ryu, H., Stehl\u00e9, D.: Cryptanalysis of the CLT13 multilinear map. J. Cryptol. 32, 547\u2013565 (2019)","journal-title":"J. Cryptol."},{"key":"14_CR18","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1587\/transfun.E101.A.12","volume":"101","author":"JH Cheon","year":"2018","unstructured":"Cheon, J.H., Lee, C., Ryu, H.: Cryptographic multilinear maps and their cryptanalysis. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101, 12\u201318 (2018)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/978-3-642-40041-4_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"J-S Coron","year":"2013","unstructured":"Coron, J.-S., Lepoint, T., Tibouchi, M.: Practical multilinear maps over the integers. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 476\u2013493. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_26"},{"key":"14_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, 224\u2013280 (2010)","journal-title":"J. Cryptol."},{"key":"14_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-642-13190-5_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"DM Freeman","year":"2010","unstructured":"Freeman, D.M.: Converting pairing-based cryptosystems from composite-order groups to prime-order groups. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 44\u201361. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_3"},{"issue":"2","key":"14_CR22","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1007\/s00145-018-9281-4","volume":"32","author":"G Fuchsbauer","year":"2019","unstructured":"Fuchsbauer, G., Hanser, C., Slamanig, D.: Structure-preserving signatures on equivalence classes and constant-size anonymous credentials. J. Cryptol. 32(2), 498\u2013546 (2019)","journal-title":"J. Cryptol."},{"key":"14_CR23","doi-asserted-by":"publisher","first-page":"3113","DOI":"10.1016\/j.dam.2007.12.010","volume":"156","author":"SD Galbraith","year":"2008","unstructured":"Galbraith, S.D., Paterson, K.G., Smart, N.P.: Pairings for cryptographers. Discret. Appl. Math. 156, 3113\u20133121 (2008)","journal-title":"Discret. Appl. Math."},{"key":"14_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/3-540-44647-8_11","volume-title":"Advances in Cryptology\u2014CRYPTO 2001","author":"RP Gallant","year":"2001","unstructured":"Gallant, R.P., Lambert, R.J., Vanstone, S.A.: Faster point multiplication on elliptic curves with efficient endomorphisms. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 190\u2013200. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_11"},{"key":"14_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-38348-9_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"S Garg","year":"2013","unstructured":"Garg, S., Gentry, C., Halevi, S.: Candidate multilinear maps from ideal lattices. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 1\u201317. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_1"},{"key":"14_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/978-3-642-38980-1_22","volume-title":"Applied Cryptography and Network Security","author":"A Guillevic","year":"2013","unstructured":"Guillevic, A.: Comparing the pairing efficiency over composite-order and prime-order elliptic curves. In: Jacobson, M., Locasto, M., Mohassel, P., Safavi-Naini, R. (eds.) ACNS 2013. LNCS, vol. 7954, pp. 357\u2013372. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38980-1_22"},{"key":"14_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/978-3-030-45388-6_19","volume-title":"Public-Key Cryptography \u2013 PKC 2020","author":"A Guillevic","year":"2020","unstructured":"Guillevic, A.: A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level. In: Kiayias, A., Kohlweiss, M., Wallden, P., Zikas, V. (eds.) PKC 2020. LNCS, vol. 12111, pp. 535\u2013564. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45388-6_19"},{"issue":"6","key":"14_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10623-020-00727-w","volume":"88","author":"A Guillevic","year":"2020","unstructured":"Guillevic, A., Masson, S., Thom\u00e9, E.: Cocks-pinch curves of embedding degrees five to eight and optimal ate pairing computation. Des. Codes Cryptogr. 88(6), 1\u201335 (2020)","journal-title":"Des. Codes Cryptogr."},{"key":"14_CR29","doi-asserted-by":"crossref","unstructured":"Guillevic, A., Morain, F.: Discrete Logarithms. In: Guide to Pairing-Based Cryptography. CRC Press - Taylor and Francis Group (2016)","DOI":"10.1201\/9781315370170-9"},{"key":"14_CR30","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s00145-004-0312-y","volume":"17","author":"A Joux","year":"2004","unstructured":"Joux, A.: A one round protocol for tripartite Diffie-Hellman. J. Cryptol. 17, 263\u2013276 (2004)","journal-title":"J. Cryptol."},{"key":"14_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-540-85538-5_9","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2008","author":"EJ Kachisa","year":"2008","unstructured":"Kachisa, E.J., Schaefer, E.F., Scott, M.: Constructing Brezing-Weng pairing-friendly elliptic curves using elements in the cyclotomic field. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol. 5209, pp. 126\u2013135. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85538-5_9"},{"key":"14_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/978-3-662-53018-4_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"T Kim","year":"2016","unstructured":"Kim, T., Barbulescu, R.: Extended tower number field sieve: a new complexity for the medium prime case. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9814, pp. 543\u2013571. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4_20"},{"key":"14_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/978-3-662-54365-8_16","volume-title":"Public-Key Cryptography \u2013 PKC 2017","author":"T Kim","year":"2017","unstructured":"Kim, T., Jeong, J.: Extended tower number field sieve with application to finite fields of arbitrary composite extension degree. In: Fehr, S. (ed.) PKC 2017. LNCS, vol. 10174, pp. 388\u2013408. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54365-8_16"},{"issue":"6","key":"14_CR34","doi-asserted-by":"publisher","first-page":"4033","DOI":"10.1109\/TIT.2013.2240763","volume":"59","author":"T Kim","year":"2013","unstructured":"Kim, T., Kim, S., Cheon, J.H.: On the final exponentiation in Tate pairing computations. IEEE Trans. Inf. Theory 59(6), 4033\u20134041 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"14_CR35","doi-asserted-by":"crossref","unstructured":"Menezes, A., Vanstone, S.A., Okamoto, T.: Reducing elliptic curve logarithms to logarithms in a finite field. In: ACM STOC (1991)","DOI":"10.1145\/103418.103434"},{"key":"14_CR36","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","volume":"24","author":"S Pohlig","year":"1978","unstructured":"Pohlig, S., Hellman, M.: An improved algorithm for computing logarithms over GF (p) and its cryptographic significance (Corresp.). IEEE Trans. Inf. Theory 24, 106\u2013110 (1978)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"14_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-319-29485-8_7","volume-title":"Topics in Cryptology - CT-RSA 2016","author":"D Pointcheval","year":"2016","unstructured":"Pointcheval, D., Sanders, O.: Short randomizable signatures. In: Sako, K. (ed.) CT-RSA 2016. LNCS, vol. 9610, pp. 111\u2013126. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-29485-8_7"},{"key":"14_CR38","first-page":"918","volume":"32","author":"JM Pollard","year":"1978","unstructured":"Pollard, J.M.: Monte Carlo methods for index computation $$(\\text{ mod }~p)$$. Math. Comput. 32, 918\u2013924 (1978)","journal-title":"Math. Comput."},{"key":"14_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/978-3-662-49890-3_17","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"P Sarkar","year":"2016","unstructured":"Sarkar, P., Singh, S.: New complexity trade-offs for the (multiple) number field sieve algorithm in non-prime fields. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9665, pp. 429\u2013458. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49890-3_17"},{"key":"14_CR40","doi-asserted-by":"crossref","unstructured":"Shanks, D.: Class number, a theory of factorization, and genera. In: 1969 Number Theory Institute, pp. 415\u2013440. American Mathematical Society (1971)","DOI":"10.1090\/pspum\/020\/0316385"},{"key":"14_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/3-540-69053-0_18","volume-title":"Advances in Cryptology\u2014EUROCRYPT 1997","author":"V Shoup","year":"1997","unstructured":"Shoup, V.: Lower bounds for discrete logarithms and related problems. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 256\u2013266. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-69053-0_18"},{"key":"14_CR42","unstructured":"Smart, N.P.: Algorithms, key size and protocols report, ECRYPT - CSA (2018). http:\/\/www.ecrypt.eu.org\/csa\/documents\/D5.4-FinalAlgKeySizeProt.pdf"},{"key":"14_CR43","unstructured":"TCG (2015). https:\/\/trustedcomputinggroup.org\/authentication\/"},{"key":"14_CR44","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, 455\u2013461 (2010)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Lecture Notes in Computer Science","Cryptology and Network Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-65411-5_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,21]],"date-time":"2022-12-21T19:12:59Z","timestamp":1671649979000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-65411-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030654108","9783030654115"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-65411-5_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"9 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CANS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology and Network Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vienna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cans2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cans2020.at","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":"118","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":"30","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":"25% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9","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":"The conference was held virtually due to the COVID-19 pandemic.","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)"}}]}}