{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:31:52Z","timestamp":1742913112269,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319186801"},{"type":"electronic","value":"9783319186818"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-18681-8_21","type":"book-chapter","created":{"date-parts":[[2015,5,6]],"date-time":"2015-05-06T13:17:19Z","timestamp":1430918239000},"page":"259-273","source":"Crossref","is-referenced-by-count":2,"title":["Failure of the Point Blinding Countermeasure Against Fault Attack in Pairing-Based Cryptography"],"prefix":"10.1007","author":[{"given":"Nadia","family":"El Mrabet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emmanuel","family":"Fouotsa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","unstructured":"Anderson, R., Kuhn, M.: Tamper resistance \u2013 a cautionary note. In: The Second USENIX Workshop on Electronic Commerce Proceedings, pp. 1\u201311 (1996)"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Bae, K., Moon, S., Ha, J.: Instruction fault attack on the Miller algorithm in a pairing-based cryptosystem. In: 2013 Seventh International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing (IMIS), pp. 167\u2013174 (July 2013)","DOI":"10.1109\/IMIS.2013.36"},{"key":"21_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-55220-5_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"R. Barbulescu","year":"2014","unstructured":"Barbulescu, R., Gaudry, P., Joux, A., Thom\u00e9, E.: A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol.\u00a08441, pp. 1\u201316. Springer, Heidelberg (2014)"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Bl\u00f6mer, J., da Silva, R.G., G\u00fcnther, P., Kr\u00e4mer, J., Seifert, J.-P.: A practical second-order fault attack against a real-world pairing implementation. In: Proceedings of Fault Tolerance and Diagnosis in Cryptography (FDTC) (2014) (to appear), Updated version at \n                        http:\/\/eprint.iacr.org\/2014\/543","DOI":"10.1109\/FDTC.2014.22"},{"key":"21_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-642-40026-1_10","volume-title":"Constructive Side-Channel Analysis and Secure Design","author":"J. Bl\u00f6mer","year":"2013","unstructured":"Bl\u00f6mer, J., G\u00fcnther, P., Liske, G.: Improved side channel attacks on pairing based cryptography. In: Prouff, E. (ed.) COSADE 2013. LNCS, vol.\u00a07864, pp. 154\u2013168. Springer, Heidelberg (2013)"},{"issue":"3","key":"21_CR6","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/S0097539701398521","volume":"32","author":"D. Boneh","year":"2003","unstructured":"Boneh, D., Franklin, M.: Identity-Based Encryption from the Weil pairing. SIAM J. of Computing\u00a032(3), 586\u2013615 (2003)","journal-title":"SIAM J. of Computing"},{"issue":"3-4","key":"21_CR7","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"J. Bosma","year":"1997","unstructured":"Bosma, J., Cannon, W., Playout, C.: The Magma algebra system I. the user language. J. Symbolic Comput.\u00a024(3-4), 235\u2013265 (1997)","journal-title":"J. Symbolic Comput."},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Buchberger, B.: An algorithm form finding the basis elements of the residue class ring of a zero dimensional polynomial ideal (phd thesis 1965). In: Elsevier (eds.) Journal of Symbolic Computation, vol. 41, pp. 475\u2013511. Elsevier (2006)","DOI":"10.1016\/j.jsc.2005.09.007"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Cohen, H., Frey, G. (eds.): Handbook of elliptic and hyperelliptic curve cryptography. Discrete Math. Appl. Chapman & Hall\/CRC (2006)","DOI":"10.1201\/9781420034981"},{"key":"21_CR10","unstructured":"Dutta, R., Barua, R., Sarkar, P.: Pairing-based cryptography: A survey. Cryptology ePrint Archive, Report 2004\/064 (2004)"},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-642-02617-1_13","volume-title":"Advances in Information Security and Assurance","author":"N. El Mrabet","year":"2009","unstructured":"El Mrabet, N.: What about vulnerability to a fault attack of the Miller algorithm during an Identity Based Protocol? In: Park, J.H., Chen, H.-H., Atiquzzaman, M., Lee, C., Kim, T.-h., Yeo, S.-S. (eds.) ISA 2009. LNCS, vol.\u00a05576, pp. 122\u2013134. Springer, Heidelberg (2009)"},{"key":"21_CR12","unstructured":"El Mrabet, N: Fault attack against Miller\u2019s algorithm. IACR Cryptology ePrint Archive, 2011:709 (2011)"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"El Mrabet, N., Di Natale, G., Flottes, M.-L., Rouzeyre, B., Bajard, J.-C.: Differential Power Analysis against the Miller algorithm. Technical report. Published in Prime 2009. IEEE Xplore (August 2008)","DOI":"10.1109\/RME.2009.5201339"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"El Mrabet, N., Page, D., Vercauteren, F.: Fault attacks on pairing-based cryptography. In: Joye, M., Tunstall, M. (eds.) Fault Analysis in Cryptography, Information Security and Cryptography, pp. 221\u2013236. Springer, Heidelberg (2012)","DOI":"10.1007\/978-3-642-29656-7_13"},{"issue":"2","key":"21_CR15","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. Cryptology\u00a023(2), 224\u2013280 (2010)","journal-title":"J. Cryptology"},{"issue":"1","key":"21_CR16","first-page":"21","volume":"12","author":"D.R. Chowdhury","year":"2011","unstructured":"Chowdhury, D.R., Santosh, G., Debdeep, M.: Fault attack and countermeasures on pairing based cryptography. International Journal of Network Security\u00a012(1), 21\u201328 (2011)","journal-title":"International Journal of Network Security"},{"key":"21_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-540-85538-5_2","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2008","author":"F. Hess","year":"2008","unstructured":"Hess, F.: Pairing lattices. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol.\u00a05209, pp. 18\u201338. Springer, Heidelberg (2008)"},{"key":"21_CR18","doi-asserted-by":"publisher","first-page":"4595","DOI":"10.1109\/TIT.2006.881709","volume":"52","author":"F. Hess","year":"2006","unstructured":"Hess, F., Smart, N., Vercauteren, F.: The Eta Pairing Revisited. IEEE Transactions on Information Theory\u00a052, 4595\u20134602 (2006)","journal-title":"IEEE Transactions on Information Theory"},{"key":"21_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-642-16825-3_22","volume-title":"Advances in Information and Computer Security","author":"T. Iyama","year":"2010","unstructured":"Iyama, T., Kiyomoto, S., Fukushima, K., Tanaka, T., Takagi, T.: Efficient implementation of pairing on brew mobile phones. In: Echizen, I., Kunihiro, N., Sasaki, R. (eds.) IWSEC 2010. LNCS, vol.\u00a06434, pp. 326\u2013336. Springer, Heidelberg (2010)"},{"key":"21_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/978-3-662-43414-7_18","volume-title":"Selected Areas in Cryptography \u2013 SAC 2013. 20th International Conference, Burnaby, BC, Canada, August 14-16, 2013, Revised Selected Papers","author":"A. Joux","year":"2014","unstructured":"Joux, A.: A new index calculus algorithm with complexity l(1\/4\u2009+\u2009o(1)) in small characteristic. In: Lange, T., Lauter, K., Lison\u011bk, P. (eds.) SAC 2013. LNCS, vol.\u00a08282, pp. 355\u2013379. Springer, Heidelberg (2014)"},{"key":"21_CR21","unstructured":"Joye, M., Neven, G.: Identity-based Cryptography. Cryptology and information security series. IOS Press (2009)"},{"key":"21_CR22","doi-asserted-by":"crossref","unstructured":"Kawahara, Y., Takagi, T., Okamoto, E.: Efficient implementation of Tate pairing on a mobile phone using java. In: 2006 International Conference on Computational Intelligence and Security, vol.\u00a02, pp. 1247\u20131252 (November 2006)","DOI":"10.1109\/ICCIAS.2006.295256"},{"key":"21_CR23","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.\u00a03796, pp. 13\u201336. Springer, Heidelberg (2005)"},{"key":"21_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/978-3-642-40349-1_21","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2013","author":"R. Lashermes","year":"2013","unstructured":"Lashermes, R., Fournier, J., Goubin, L.: Inverting the final exponentiation of Tate pairings on ordinary elliptic curves using faults. In: Bertoni, G., Coron, J.-S. (eds.) CHES 2013. LNCS, vol.\u00a08086, pp. 365\u2013382. Springer, Heidelberg (2013)"},{"key":"21_CR25","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00145-004-0315-8","volume":"17","author":"V. Miller","year":"2004","unstructured":"Miller, V.: The Weil pairing and its efficient calculation. Journal of Cryptology\u00a017, 235\u2013261 (2004)","journal-title":"Journal of Cryptology"},{"key":"21_CR26","volume-title":"Maple\u00a010 Programming Guide","author":"M.B. Monagan","year":"2005","unstructured":"Monagan, M.B., Geddes, K.O., Heal, K.M., Labahn, G., Vorkoetter, S.M., McCarron, J., DeMarco, P.: Maple\u00a010 Programming Guide. Maplesoft, Waterloo ON (2005)"},{"issue":"9","key":"21_CR27","doi-asserted-by":"publisher","first-page":"1075","DOI":"10.1109\/TC.2006.134","volume":"55","author":"D. Page","year":"2006","unstructured":"Page, D., Vercauteren, F.: A fault attack on Pairing-Based Cryptography. IEEE Transactions on Computers\u00a055(9), 1075\u20131080 (2006)","journal-title":"IEEE Transactions on Computers"},{"key":"21_CR28","doi-asserted-by":"crossref","unstructured":"Park, J., Sohn, G., Moon, S.: Fault attack on a point blinding countermeasure of pairing algorithms. ETRI Journal\u00a033(6) (2011)","DOI":"10.4218\/etrij.11.0210.0483"},{"key":"21_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-540-30574-3_20","volume-title":"Topics in Cryptology \u2013 CT-RSA 2005","author":"M. Scott","year":"2005","unstructured":"Scott, M.: Computing the Tate pairing. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol.\u00a03376, pp. 293\u2013304. Springer, Heidelberg (2005)"},{"key":"21_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-642-03298-1_6","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2009","author":"M. Scott","year":"2009","unstructured":"Scott, M., Benger, N., Charlemagne, M., Dominguez Perez, L.J., Kachisa, E.J.: On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves. In: Shacham, H., Waters, B. (eds.) Pairing 2009. LNCS, vol.\u00a05671, pp. 78\u201388. Springer, Heidelberg (2009)"},{"key":"21_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/11894063_11","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2006","author":"M. Scott","year":"2006","unstructured":"Scott, M., Costigan, N., Abdulwahab, W.: Implementing cryptographic pairings on smartcards. In: Goubin, L., Matsui, M. (eds.) CHES 2006. LNCS, vol.\u00a04249, pp. 134\u2013147. Springer, Heidelberg (2006)"},{"key":"21_CR32","unstructured":"Stein, W.: Sage mathematics software (version 4.8). The Sage Group (2012), \n                        http:\/\/www.sagemath.org"},{"key":"21_CR33","unstructured":"The PARI\u00a0Group, Bordeaux. PARI\/GP, version 2.7.0 (2014), \n                        http:\/\/pari.math.u-bordeaux.fr\/\n                      ."},{"key":"21_CR34","doi-asserted-by":"crossref","unstructured":"Trichina, E., Korkikyan, R.: Multi fault laser attacks on protected CRT-RSA. In: 2010 Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC), pp. 75\u201386. IEEE (2010)","DOI":"10.1109\/FDTC.2010.14"},{"issue":"1","key":"21_CR35","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. Theor.\u00a056(1), 455\u2013461 (2010)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"21_CR36","unstructured":"Washington, L.C.: Elliptic curves, number theory and cryptography. Discrete Math. Aplli., Chapman and Hall (2008)"},{"key":"21_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-540-73489-5_12","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2007","author":"C. Whelan","year":"2007","unstructured":"Whelan, C., Scott, M.: The importance of the final exponentiation in pairings when considering Fault Attacks. In: Takagi, T., Okamoto, T., Okamoto, E., Okamoto, T. (eds.) Pairing 2007. LNCS, vol.\u00a04575, pp. 225\u2013246. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Codes, Cryptology, and Information Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18681-8_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T01:07:02Z","timestamp":1676941622000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-18681-8_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319186801","9783319186818"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18681-8_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}