{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T22:22:04Z","timestamp":1743114124930,"version":"3.40.3"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030110383"},{"type":"electronic","value":"9783030110390"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-11039-0_8","type":"book-chapter","created":{"date-parts":[[2019,1,17]],"date-time":"2019-01-17T08:20:25Z","timestamp":1547713225000},"page":"150-172","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Resistance of the Point Randomisation Countermeasure for Pairings Against Side-Channel Attack"],"prefix":"10.1007","author":[{"given":"Damien","family":"Jauvart","sequence":"first","affiliation":[]},{"given":"Nadia","family":"El Mrabet","sequence":"additional","affiliation":[]},{"given":"Jacques J. A.","family":"Fournier","sequence":"additional","affiliation":[]},{"given":"Louis","family":"Goubin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,1,18]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-642-20465-4_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"DF Aranha","year":"2011","unstructured":"Aranha, D.F., Karabina, K., Longa, P., Gebotys, C.H., L\u00f3pez, J.: Faster explicit formulas for computing pairings over ordinary curves. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 48\u201368. Springer, Heidelberg (2011). \n                  https:\/\/doi.org\/10.1007\/978-3-642-20465-4_5"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Bajard, J.C., El Mrabet, N.: Pairing in cryptography: an arithmetic point of view. In: Proceedings of SPIE: ASPAAI (2007)","DOI":"10.1117\/12.733789"},{"key":"8_CR3","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, Part I. LNCS, vol. 9056, pp. 129\u2013155. Springer, Heidelberg (2015). \n                  https:\/\/doi.org\/10.1007\/978-3-662-46800-5_6"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-662-48800-3_2","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"R Barbulescu","year":"2015","unstructured":"Barbulescu, R., Gaudry, P., Kleinjung, T.: The tower number field sieve. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015, Part II. LNCS, vol. 9453, pp. 31\u201355. Springer, Heidelberg (2015). \n                  https:\/\/doi.org\/10.1007\/978-3-662-48800-3_2"},{"key":"8_CR5","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). \n                  https:\/\/doi.org\/10.1007\/11693383_22"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/3-540-45708-9_23","volume-title":"Advances in Cryptology \u2014 CRYPTO 2002","author":"PSLM Barreto","year":"2002","unstructured":"Barreto, P.S.L.M., Kim, H.Y., Lynn, B., Scott, M.: Efficient algorithms for pairing-based cryptosystems. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 354\u2013369. Springer, Heidelberg (2002). \n                  https:\/\/doi.org\/10.1007\/3-540-45708-9_23"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/978-3-662-43414-7_28","volume-title":"Selected Areas in Cryptography \u2013 SAC 2013","author":"A Bauer","year":"2014","unstructured":"Bauer, A., Jaulmes, E., Prouff, E., Wild, J.: Horizontal collision correlation attack on elliptic curves. In: Lange, T., Lauter, K., Lison\u011bk, P. (eds.) SAC 2013. LNCS, vol. 8282, pp. 553\u2013570. Springer, Heidelberg (2014). \n                  https:\/\/doi.org\/10.1007\/978-3-662-43414-7_28"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-642-17455-1_2","volume-title":"Pairing-Based Cryptography - Pairing 2010","author":"J-L Beuchat","year":"2010","unstructured":"Beuchat, J.-L., Gonz\u00e1lez-D\u00edaz, J.E., Mitsunari, S., Okamoto, E., Rodr\u00edguez-Henr\u00edquez, F., Teruya, T.: High-speed software implementation of the optimal ate pairing over barreto\u2013naehrig curves. In: Joye, M., Miyaji, A., Otsuka, A. (eds.) Pairing 2010. LNCS, vol. 6487, pp. 21\u201339. Springer, Heidelberg (2010). \n                  https:\/\/doi.org\/10.1007\/978-3-642-17455-1_2"},{"key":"8_CR9","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). \n                  https:\/\/doi.org\/10.1007\/978-3-642-40026-1_10"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-44647-8_13","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"D Boneh","year":"2001","unstructured":"Boneh, D., Franklin, M.: Identity-based encryption from the weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213\u2013229. Springer, Heidelberg (2001). \n                  https:\/\/doi.org\/10.1007\/3-540-44647-8_13"},{"key":"8_CR11","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). \n                  https:\/\/doi.org\/10.1007\/3-540-48059-5_25"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-540-40061-5_7","volume-title":"Advances in Cryptology - ASIACRYPT 2003","author":"I Duursma","year":"2003","unstructured":"Duursma, I., Lee, H.-S.: Tate Pairing Implementation for Hyperelliptic Curves y2 = xp \u2013 x + d. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol. 2894, pp. 111\u2013123. Springer, Heidelberg (2003). \n                  https:\/\/doi.org\/10.1007\/978-3-540-40061-5_7"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-540-24847-7_12","volume-title":"Algorithmic Number Theory","author":"K Eisentr\u00e4ger","year":"2004","unstructured":"Eisentr\u00e4ger, K., Lauter, K., Montgomery, P.L.: Improved weil and tate pairings for elliptic and hyperelliptic curves. In: Buell, D. (ed.) ANTS 2004. LNCS, vol. 3076, pp. 169\u2013183. Springer, Heidelberg (2004). \n                  https:\/\/doi.org\/10.1007\/978-3-540-24847-7_12"},{"key":"8_CR14","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, pp. 308\u2013311, July 2009","DOI":"10.1109\/RME.2009.5201339"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-540-45238-6_22","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2003","author":"P-A Fouque","year":"2003","unstructured":"Fouque, P.-A., Valette, F.: The doubling attack \u2013 why upwards is better than downwards. In: Walter, C.D., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2003. LNCS, vol. 2779, pp. 269\u2013280. Springer, Heidelberg (2003). \n                  https:\/\/doi.org\/10.1007\/978-3-540-45238-6_22"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/3-540-45455-1_26","volume-title":"Algorithmic Number Theory","author":"SD Galbraith","year":"2002","unstructured":"Galbraith, S.D., Harrison, K., Soldera, D.: Implementing the tate pairing. In: Fieker, C., Kohel, D.R. (eds.) ANTS 2002. LNCS, vol. 2369, pp. 324\u2013337. Springer, Heidelberg (2002). \n                  https:\/\/doi.org\/10.1007\/3-540-45455-1_26"},{"key":"8_CR17","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). \n                  https:\/\/doi.org\/10.1007\/978-3-642-24586-2_4"},{"key":"8_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/978-3-642-01957-9_32","volume-title":"Applied Cryptography and Network Security","author":"M Hutter","year":"2009","unstructured":"Hutter, M., Medwed, M., Hein, D., Wolkerstorfer, J.: Attacking ECDSA-enabled RFID devices. In: Abdalla, M., Pointcheval, D., Fouque, P.-A., Vergnaud, D. (eds.) ACNS 2009. LNCS, vol. 5536, pp. 519\u2013534. Springer, Heidelberg (2009). \n                  https:\/\/doi.org\/10.1007\/978-3-642-01957-9_32"},{"key":"8_CR19","unstructured":"Jauvart, D.: S\u00e9curisation des algorithmes de couplages contre les attaques physiques. Ph.D thesis, Universit\u00e9 Paris-Saclay (2017)"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Jauvart, D., Fournier, J.J.A., Goubin, L.: First practical side-channel attack to defeat point randomization in secure implementations of pairing-based cryptography. In: Proceedings of the 14th International Joint Conference on e-Business and Telecommunications - Volume 6: SECRYPT (ICETE 2017), pp. 104\u2013115. INSTICC, SciTePress (2017)","DOI":"10.5220\/0006425501040115"},{"key":"8_CR21","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). \n                  https:\/\/doi.org\/10.1007\/978-3-319-54876-0_16"},{"key":"8_CR22","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":"8_CR23","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/978-3-319-10683-0_2","volume-title":"Open Problems in Mathematics and Computational Science","author":"A Joux","year":"2014","unstructured":"Joux, A., Odlyzko, A., Pierrot, C.: The past, evolving present, and future of the discrete logarithm. In: Ko\u00e7, \u00c7.K. (ed.) Open Problems in Mathematics and Computational Science, pp. 5\u201336. Springer, Cham (2014). \n                  https:\/\/doi.org\/10.1007\/978-3-319-10683-0_2"},{"key":"8_CR24","unstructured":"Joye, M., Neven, G. (eds).: Identity-Based Cryptography. IOS Press (2008)"},{"key":"8_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/11935070_11","volume-title":"Cryptology and Network Security","author":"TH Kim","year":"2006","unstructured":"Kim, T.H., Takagi, T., Han, D.-G., Kim, H.W., Lim, J.: Side channel attacks and countermeasures on pairing based cryptosystems over binary fields. In: Pointcheval, D., Mu, Y., Chen, K. (eds.) CANS 2006. LNCS, vol. 4301, pp. 168\u2013181. Springer, Heidelberg (2006). \n                  https:\/\/doi.org\/10.1007\/11935070_11"},{"key":"8_CR26","doi-asserted-by":"crossref","unstructured":"Kim, T., Barbulescu, R.: Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case. Cryptology ePrint Archive (2015)","DOI":"10.1007\/978-3-662-53018-4_20"},{"key":"8_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/11586821_2","volume-title":"Cryptography and Coding","author":"N Koblitz","year":"2005","unstructured":"Koblitz, N., Menezes, A.: Pairing-based cryptography at high security levels. In: Smart, N.P. (ed.) Cryptography and Coding 2005. LNCS, vol. 3796, pp. 13\u201336. Springer, Heidelberg (2005). \n                  https:\/\/doi.org\/10.1007\/11586821_2"},{"issue":"3","key":"8_CR28","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1109\/40.502403","volume":"16","author":"CK Koc","year":"1996","unstructured":"Koc, C.K., Acar, T., Kaliski, B.S.: Analyzing and comparing montgomery multiplication algorithms. IEEE Micro 16(3), 26\u201333 (1996)","journal-title":"IEEE Micro"},{"key":"8_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/3-540-48405-1_25","volume-title":"Advances in Cryptology \u2014 CRYPTO 1999","author":"P Kocher","year":"1999","unstructured":"Kocher, P., Jaffe, J., Jun, B.: Differential power analysis. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 388\u2013397. Springer, Heidelberg (1999). \n                  https:\/\/doi.org\/10.1007\/3-540-48405-1_25"},{"key":"8_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-3-319-78556-1_13","volume-title":"Information Security and Cryptology \u2013 ICISC 2017","author":"T Kusaka","year":"2018","unstructured":"Kusaka, T., et al.: Solving 114-Bit ECDLP for a barreto-naehrig Curve. In: Kim, H., Kim, D.-C. (eds.) ICISC 2017. LNCS, vol. 10779, pp. 231\u2013244. Springer, Cham (2018). \n                  https:\/\/doi.org\/10.1007\/978-3-319-78556-1_13"},{"key":"8_CR31","doi-asserted-by":"crossref","unstructured":"Menezes, A., Sarkar, P., Singh, S.: Challenges with Assessing the Impact of NFS Advances on the Security of Pairing-based Cryptography. Cryptology ePrint Archive (2016)","DOI":"10.1007\/978-3-319-61273-7_5"},{"key":"8_CR32","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 1985","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). \n                  https:\/\/doi.org\/10.1007\/3-540-39799-X_31"},{"key":"8_CR33","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1090\/S0025-5718-1985-0777282-X","volume":"44","author":"PL Montgomery","year":"1985","unstructured":"Montgomery, P.L.: Modular multiplication without trial division. Math. Comput. 44, 519\u2013519 (1985)","journal-title":"Math. Comput."},{"key":"8_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-642-15031-9_9","volume-title":"Cryptographic Hardware and Embedded Systems, CHES 2010","author":"A Moradi","year":"2010","unstructured":"Moradi, A., Mischke, O., Eisenbarth, T.: Correlation-enhanced power analysis collision attack. In: Mangard, S., Standaert, F.-X. (eds.) CHES 2010. LNCS, vol. 6225, pp. 125\u2013139. Springer, Heidelberg (2010). \n                  https:\/\/doi.org\/10.1007\/978-3-642-15031-9_9"},{"key":"8_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-642-14712-8_7","volume-title":"Progress in Cryptology \u2013 LATINCRYPT 2010","author":"M Naehrig","year":"2010","unstructured":"Naehrig, M., Niederhagen, R., Schwabe, P.: New software speed records for cryptographic pairings. In: Abdalla, M., Barreto, P.S.L.M. (eds.) LATINCRYPT 2010. LNCS, vol. 6212, pp. 109\u2013123. Springer, Heidelberg (2010). \n                  https:\/\/doi.org\/10.1007\/978-3-642-14712-8_7"},{"key":"8_CR36","unstructured":"Page, D., Vercauteren, F.: Fault and Side-Channel Attacks on Pairing Based Cryptography. IEEE Trans. Comput. (2004)"},{"key":"8_CR37","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). \n                  https:\/\/doi.org\/10.1007\/978-3-642-19475-7_36"},{"key":"8_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-540-39887-5_16","volume-title":"Fast Software Encryption","author":"K Schramm","year":"2003","unstructured":"Schramm, K., Wollinger, T., Paar, C.: A new class of collision attacks and its application to DES. In: Johansson, T. (ed.) FSE 2003. LNCS, vol. 2887, pp. 206\u2013222. Springer, Heidelberg (2003). \n                  https:\/\/doi.org\/10.1007\/978-3-540-39887-5_16"},{"key":"8_CR39","first-page":"293","volume-title":"Lecture Notes in Computer Science","author":"Michael Scott","year":"2005","unstructured":"Scott, M.: Computing the Tate pairing. CT-RSA, pp. 293\u2013304 (2005)"},{"key":"8_CR40","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-09494-6","volume-title":"The Arithmetic of Elliptic Curves","author":"JH Silverman","year":"2009","unstructured":"Silverman, J.H.: The Arithmetic of Elliptic Curves. GTM, vol. 106. Springer, New York (2009). \n                  https:\/\/doi.org\/10.1007\/978-0-387-09494-6"},{"key":"8_CR41","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":"8_CR42","doi-asserted-by":"crossref","unstructured":"Varchola, M., Drutarovsky, M., Repka, M., Zajac, P.: Side channel attack on multiprecision multiplier used in protected ECDSA implementation. In: ReConFig, pp. 1\u20136, December 2015","DOI":"10.1109\/ReConFig.2015.7393359"},{"key":"8_CR43","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). \n                  https:\/\/doi.org\/10.1007\/11958239_7"}],"container-title":["Communications in Computer and Information Science","E-Business and Telecommunications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-11039-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T23:55:22Z","timestamp":1558396522000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-11039-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030110383","9783030110390"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-11039-0_8","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"18 January 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICETE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on E-Business and Telecommunications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 July 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 July 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icete2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.icete.org\/?y=2017","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"}},{"value":"Primoris","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"195","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"35","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"41","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"18% - 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"}},{"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"}},{"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"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}