{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:32:46Z","timestamp":1759638766279,"version":"3.40.3"},"publisher-location":"Cham","reference-count":54,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319221731"},{"type":"electronic","value":"9783319221748"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-22174-8_14","type":"book-chapter","created":{"date-parts":[[2015,8,14]],"date-time":"2015-08-14T16:28:06Z","timestamp":1439569686000},"page":"245-265","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":28,"title":["Subgroup Security in Pairing-Based Cryptography"],"prefix":"10.1007","author":[{"given":"Paulo S. L. M.","family":"Barreto","sequence":"first","affiliation":[]},{"given":"Craig","family":"Costello","sequence":"additional","affiliation":[]},{"given":"Rafael","family":"Misoczki","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Naehrig","sequence":"additional","affiliation":[]},{"given":"Geovandro C. C. F.","family":"Pereira","sequence":"additional","affiliation":[]},{"given":"Gustavo","family":"Zanon","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,15]]},"reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-36334-4_11","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2012","author":"DF Aranha","year":"2013","unstructured":"Aranha, D.F., Fuentes-Casta\u00f1eda, L., Knapp, E., Menezes, A., Rodr\u00edguez-Henr\u00edquez, F.: Implementing pairings at the 192-bit security level. In: Abdalla, M., Lange, T. (eds.) Pairing 2012. LNCS, vol. 7708, pp. 177\u2013195. Springer, Heidelberg (2013)"},{"key":"14_CR2","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)"},{"key":"14_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. 8441, pp. 1\u201316. Springer, Heidelberg (2014)"},{"key":"14_CR4","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., Galdi, C., Persiano, G. (eds.) SCN 2002. LNCS, vol. 2576, pp. 257\u2013267. Springer, Heidelberg (2003)"},{"issue":"4","key":"14_CR5","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s00145-004-0311-z","volume":"17","author":"PSLM Barreto","year":"2004","unstructured":"Barreto, P.S.L.M., Lynn, B., Scott, M.: Efficient implementation of pairing-based cryptosystems. J. Cryptol. 17(4), 321\u2013334 (2004)","journal-title":"J. Cryptol."},{"key":"14_CR6","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)"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-642-13797-6_13","volume-title":"Arithmetic of Finite Fields","author":"N Benger","year":"2010","unstructured":"Benger, N., Scott, M.: Constructing tower extensions of finite fields for implementation of pairing-based cryptography. In: Hasan, M.A., Helleseth, T. (eds.) WAIFI 2010. LNCS, vol. 6087, pp. 180\u2013195. Springer, Heidelberg (2010)"},{"key":"14_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107360211","volume-title":"Elliptic Curves in Cryptography","author":"IF Blake","year":"1999","unstructured":"Blake, I.F., Seroussi, G., Smart, N.: Elliptic Curves in Cryptography, vol. 265. Cambridge University Press, Cambridge (1999)"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/3-540-36288-6_3","volume-title":"Public Key Cryptography - PKC 2003, 6th International Workshop on Theory and Practice in Public Key Cryptography","author":"A Boldyreva","year":"2003","unstructured":"Boldyreva, A.: Threshold signatures, multisignatures and blind signatures based on the Gap-Diffie-Hellman-group signature scheme. In: Desmedt, Y. (ed.) PKC 2003. Lecture Notes in Computer Science, vol. 2567, pp. 31\u201346. Springer, Heidelberg (2003)"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-45682-1_30","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"D Boneh","year":"2001","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, p. 514. Springer, Heidelberg (2001)"},{"key":"14_CR11","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 - 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)"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/978-3-662-43414-7_22","volume-title":"Selected Areas in Cryptography \u2013 SAC 2013","author":"JW Bos","year":"2014","unstructured":"Bos, J.W., Costello, C., Naehrig, M.: Exponentiating in pairing groups. In: Lange, T., Lauter, K., Lison\u011bk, P. (eds.) SAC 2013. LNCS, vol. 8282, pp. 438\u2013455. Springer, Heidelberg (2014)"},{"issue":"3\u20134","key":"14_CR13","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W Bosma","year":"1997","unstructured":"Bosma, W., Cannon, J., Playoust, C.: The magma algebra system I: the user language. J. Symbolic Comput. 24(3\u20134), 235\u2013265 (1997). Computational algebra and number theory (London, 1993)","journal-title":"J. Symbolic Comput."},{"issue":"2\u20133","key":"14_CR14","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10623-009-9334-7","volume":"55","author":"S Chatterjee","year":"2010","unstructured":"Chatterjee, S., Hankerson, D., Knapp, E., Menezes, A.: Comparing two pairing-based aggregate signature schemes. Des. Codes Crypt. 55(2\u20133), 141\u2013167 (2010)","journal-title":"Des. Codes Crypt."},{"key":"14_CR15","unstructured":"Chatterjee, S., Menezes, A.: Type 2 structure-preserving signature schemes revisited. Cryptology ePrint Archive, Report 2014\/635 (2014). http:\/\/eprint.iacr.org\/"},{"issue":"4","key":"14_CR16","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/s10207-006-0011-9","volume":"6","author":"L Chen","year":"2007","unstructured":"Chen, L., Cheng, Z., Smart, N.P.: Identity-based key agreement protocols from pairings. Int. J. Inf. Sec. 6(4), 213\u2013241 (2007)","journal-title":"Int. J. Inf. Sec."},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/978-3-642-25578-6_23","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2011","author":"C Costello","year":"2011","unstructured":"Costello, C., Lauter, K., Naehrig, M.: Attractive subfamilies of BLS curves for implementing high-security pairings. In: Bernstein, D.J., Chatterjee, S. (eds.) INDOCRYPT 2011. LNCS, vol. 7107, pp. 320\u2013342. Springer, Heidelberg (2011)"},{"issue":"3","key":"14_CR18","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. Am. Math. Soc. 44(3), 393\u2013422 (2007)","journal-title":"Bull. Am. Math. Soc."},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1007\/11792086_32","volume-title":"Algorithmic Number Theory","author":"D Freeman","year":"2006","unstructured":"Freeman, D.: Constructing pairing-friendly elliptic curves with embedding degree 10. In: Hess, F., Pauli, S., Pohst, M. (eds.) ANTS 2006. LNCS, vol. 4076, pp. 452\u2013465. Springer, Heidelberg (2006)"},{"issue":"2","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. Crypt. 23(2), 224\u2013280 (2010)","journal-title":"J. Crypt."},{"key":"14_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/978-3-642-28496-0_25","volume-title":"Selected Areas in Cryptography","author":"L Fuentes-Casta\u00f1eda","year":"2012","unstructured":"Fuentes-Casta\u00f1eda, L., Knapp, E., Rodr\u00edguez-Henr\u00edquez, F.: Faster hashing to $${\\mathbb{G}}_2$$. In: Miri, A., Vaudenay, S. (eds.) SAC 2011. LNCS, vol. 7118, pp. 412\u2013430. Springer, Heidelberg (2012)"},{"key":"14_CR22","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, p. 324. Springer, Heidelberg (2002)"},{"issue":"3","key":"14_CR23","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/s00145-010-9065-y","volume":"24","author":"SD Galbraith","year":"2011","unstructured":"Galbraith, S.D., Lin, X., Scott, M.: Endomorphisms for faster elliptic curve cryptography on a large class of curves. J. Crypt. 24(3), 446\u2013469 (2011)","journal-title":"J. Crypt."},{"key":"14_CR24","series-title":"Lecture Notes in Computer Science","volume-title":"Pairing-Based Cryptography - Pairing 2008","year":"2008","unstructured":"Galbraith, S.D., Paterson, K.G. (eds.): Pairing 2008. Lecture Notes in Computer Science, vol. 5209. Springer, Heidelberg (2008)"},{"issue":"16","key":"14_CR25","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. Discrete Appl. Math. 156(16), 3113\u20133121 (2008)","journal-title":"Discrete Appl. Math."},{"key":"14_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-540-85538-5_15","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2008","author":"SD Galbraith","year":"2008","unstructured":"Galbraith, S.D., Scott, M.: Exponentiation in pairing-friendly groups using homomorphisms. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol. 5209, pp. 211\u2013224. Springer, Heidelberg (2008)"},{"key":"14_CR27","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 - CRYPTO 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)"},{"key":"14_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-642-13013-7_13","volume-title":"Public Key Cryptography \u2013 PKC 2010","author":"R Granger","year":"2010","unstructured":"Granger, R., Scott, M.: Faster squaring in the cyclotomic subgroup of sixth degree extensions. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol. 6056, pp. 209\u2013223. Springer, Heidelberg (2010)"},{"issue":"10","key":"14_CR29","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.P., Vercauteren, F.: The eta pairing revisited. IEEE Trans. Inf. Theo. 52(10), 4595\u20134602 (2006)","journal-title":"IEEE Trans. Inf. Theo."},{"key":"14_CR30","unstructured":"IEEE P1363 Working Group. Standard Specifications for Public-Key Cryptography - IEEE Std 1363\u20132000 (2000)"},{"issue":"4","key":"14_CR31","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. Crypt. 17(4), 263\u2013276 (2004)","journal-title":"J. Crypt."},{"key":"14_CR32","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)"},{"key":"14_CR33","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - CRYPTO 2001","year":"2001","unstructured":"Kilian, J. (ed.): CRYPTO 2001. Lecture Notes in Computer Science, vol. 2139. Springer, Heidelberg (2001)"},{"key":"14_CR34","doi-asserted-by":"crossref","unstructured":"Lenstra Jr., H.W.: Factoring integers with elliptic curves. Ann. Math. 126, 649\u2013673 (1987)","DOI":"10.2307\/1971363"},{"key":"14_CR35","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1145\/872035.872061","volume-title":"Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing","author":"N Li","year":"2003","unstructured":"Li, N., Du, W., Boneh, D.: Oblivious signature-based envelope. In: Borowsky, E., Rajsbaum, S. (eds.) PODC 2003, pp. 182\u2013189. ACM, New York (2003)"},{"key":"14_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BFb0052240","volume-title":"Advances in Cryptology - CRYPTO 1997","author":"CH Lim","year":"1997","unstructured":"Lim, C.H., Lee, P.J.: A key recovery attack on discrete log-based schemes using a prime order subgroup. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 249\u2013263. Springer, Heidelberg (1997)"},{"key":"14_CR37","unstructured":"Menezes, A.: Asymmetric pairings. Talk at ECC 2009. Slides at http:\/\/math.ucalgary.ca\/ecc\/files\/ecc\/u5\/Menezes_ECC2009.pdf"},{"issue":"5","key":"14_CR38","first-page":"1234","volume":"84","author":"A Miyaji","year":"2001","unstructured":"Miyaji, A., Nakabayashi, M., Takano, S.: New explicit conditions of elliptic curve traces for FR-reduction. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 84(5), 1234\u20131243 (2001)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"issue":"177","key":"14_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)","journal-title":"Math. Comput."},{"key":"14_CR40","unstructured":"Naehrig, M.: Constructive and computational aspects of cryptographic pairings. Ph.D. thesis, Eindhoven University of Technology, May 2009"},{"key":"14_CR41","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)"},{"key":"14_CR42","doi-asserted-by":"crossref","unstructured":"Nogami, Y., Akane, M., Sakemi, Y., Katou, H., Morikawa, Y.: Integer variable chi-based ate pairing. In: Galbraith and Paterson [24], pp. 178\u2013191","DOI":"10.1007\/978-3-540-85538-5_13"},{"key":"14_CR43","unstructured":"Page, D., Smart, N.P., Vercauteren, F.: A comparison of MNT curves and supersingular curves. IACR Cryptology ePrint Archive, vol. 2004, p. 165 (2004)"},{"key":"14_CR44","doi-asserted-by":"crossref","unstructured":"Pereira, G.C.C.F., Simpl\u00edcio Jr., M.A., Naehrig, M., Barreto, P.S.L.M.: A family of implementation-friendly BN elliptic curves. J. Syst. Softw. 84(8), 1319\u20131326 (2011)","DOI":"10.1016\/j.jss.2011.03.083"},{"issue":"1","key":"14_CR45","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","volume":"24","author":"SC Pohlig","year":"1978","unstructured":"Pohlig, S.C., Hellman, M.E.: An improved algorithm for computing logarithms over GF(p) and its cryptographic significance. IEEE Trans. Inf. Theo. 24(1), 106\u2013110 (1978)","journal-title":"IEEE Trans. Inf. Theo."},{"key":"14_CR46","unstructured":"Sakai, R., Ohgishi, K., Kasahara, M.: Cryptosystems based on pairing. In: The 2000 Symposium on Cryptography and Information Security, Okinawa, Japan, pp. 135\u2013148 (2000)"},{"key":"14_CR47","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. 3376, pp. 293\u2013304. Springer, Heidelberg (2005)"},{"key":"14_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-642-25516-8_18","volume-title":"Cryptography and Coding","author":"M Scott","year":"2011","unstructured":"Scott, M.: On the efficient implementation of pairing-based protocols. In: Chen, L. (ed.) IMACC 2011. LNCS, vol. 7089, pp. 296\u2013308. Springer, Heidelberg (2011)"},{"key":"14_CR49","unstructured":"Scott, M.: Unbalancing pairing-based key exchange protocols. Cryptology ePrint Archive, Report 2013\/688 (2013). http:\/\/eprint.iacr.org\/2013\/688"},{"key":"14_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-642-03298-1_8","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.: Fast hashing to G\n                                        $$_{2}$$ on pairing-friendly curves. In: Shacham, H., Waters, B. (eds.) Pairing 2009. LNCS, vol. 5671, pp. 102\u2013113. Springer, Heidelberg (2009)"},{"key":"14_CR51","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. 5671, pp. 78\u201388. Springer, Heidelberg (2009)"},{"key":"14_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/3-540-68697-5_7","volume-title":"Advances in Cryptology - CRYPTO 1996","author":"S Vaudenay","year":"1996","unstructured":"Vaudenay, S.: Hidden collisions on DSS. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 83\u201388. Springer, Heidelberg (1996)"},{"issue":"1","key":"14_CR53","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. Theo. 56(1), 455\u2013461 (2010)","journal-title":"IEEE Trans. Inf. Theo."},{"key":"14_CR54","doi-asserted-by":"crossref","unstructured":"Zavattoni, aE., Dominguez Perez, L.J., Mitsunari, S., S\u00e1nchez-Ram\u00edrez, A.H., Teruya, T., Rodr\u00edguez-Henr\u00edquez, F.: Software implementation of an attribute-based encryption scheme (2015)","DOI":"10.1109\/TC.2014.2329681"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology -- LATINCRYPT 2015"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-22174-8_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T13:38:08Z","timestamp":1674567488000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-22174-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319221731","9783319221748"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-22174-8_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"15 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}