{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T18:10:11Z","timestamp":1746123011402,"version":"3.40.4"},"publisher-location":"Cham","reference-count":61,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319048727"},{"type":"electronic","value":"9783319048734"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-04873-4_14","type":"book-chapter","created":{"date-parts":[[2014,1,27]],"date-time":"2014-01-27T03:49:57Z","timestamp":1390794597000},"page":"229-250","source":"Crossref","is-referenced-by-count":7,"title":["PandA: Pairings and Arithmetic"],"prefix":"10.1007","author":[{"given":"Chitchanok","family":"Chuengsatiansup","sequence":"first","affiliation":[]},{"given":"Michael","family":"Naehrig","sequence":"additional","affiliation":[]},{"given":"Pance","family":"Ribarski","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Schwabe","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Adj, G., Menezes, A., Oliveira, T., Rodr\u00edguez-Henr\u00edquez, F.: Weakness of $\\mbox{${\\mathbb F}$}_{3^{6 \\cdot 509}}$ for discrete logarithm cryptography (2013), http:\/\/eprint.iacr.org\/2013\/446\/","DOI":"10.1007\/978-3-319-04873-4_2"},{"key":"14_CR2","unstructured":"Adj, G., Rodr\u00edguez-Henr\u00edquez, F.: Square root computation over even extension fields (2012), http:\/\/eprint.iacr.org\/"},{"issue":"2","key":"14_CR3","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/s13389-013-0057-3","volume":"3","author":"J.A. Akinyele","year":"2013","unstructured":"Akinyele, J.A., Garman, C., Miers, I., Pagano, M.W., Rushanan, M., Green, M., Rubin, A.D.: Charm: a framework for rapidly prototyping cryptosystems. Journal of Cryptographic Engineering, 3(2):111\u2013128 (2013), http:\/\/eprint.iacr.org\/2011\/617\/","journal-title":"Journal of Cryptographic Engineering"},{"key":"14_CR4","unstructured":"Aranha, D.F., Gouv\u00eaa, C.P.L.: RELIC is an Efficient LIbrary for Cryptography, http:\/\/code.google.com\/p\/relic-toolkit\/ (accessed November 5, 2013)."},{"key":"14_CR5","doi-asserted-by":"crossref","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.\u00a06632, pp. 48\u201368. Springer, Heidelberg (2011), http:\/\/eprint.iacr.org\/2010\/526\/","DOI":"10.1007\/978-3-642-20465-4_5"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Barbulescu, R., Gaudry, P., Joux, A., Thom\u00e9, E.: A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic (2013), http:\/\/eprint.iacr.org\/2013\/400\/","DOI":"10.1007\/978-3-642-55220-5_1"},{"key":"14_CR7","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.\u00a02442, pp. 354\u2013368. Springer, Heidelberg (2002), http:\/\/eprint.iacr.org\/2002\/008"},{"key":"14_CR8","doi-asserted-by":"crossref","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.\u00a03897, pp. 319\u2013331. Springer, Heidelberg (2006), http:\/\/cryptosith.org\/papers\/#bn","DOI":"10.1007\/11693383_22"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/3-540-47721-7_24","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"P. Barrett","year":"1987","unstructured":"Barrett, P.: Implementing the Rivest Shamir and Adleman Public Key Encryption Algorithm on a Standard Digital Signal Processor. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 311\u2013323. Springer, Heidelberg (1987)"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Belenkiy, M., Camenisch, J., Chase, M., Kohlweiss, M., Lysyanskaya, A., Shacham, H.: Randomizable Proofs and Delegatable Anonymous Credentials. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.\u00a05677, pp. 108\u2013125. Springer, Heidelberg (2009), http:\/\/research.microsoft.com\/pubs\/122759\/anoncred.pdf","DOI":"10.1007\/978-3-642-03356-8_7"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., Birkner, P., Joye, M., Lange, T., Peters, C.: Twisted Edwards Curves. In: Vaudenay, S. (ed.) AFRICACRYPT 2008. LNCS, vol.\u00a05023, pp. 389\u2013405. Springer, Heidelberg (2008), http:\/\/cr.yp.to\/papers.html#twisted","DOI":"10.1007\/978-3-540-68164-9_26"},{"key":"14_CR12","doi-asserted-by":"crossref","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.\u00a06917, pp. 124\u2013142. Springer, Heidelberg (2011) see also full version [13]","DOI":"10.1007\/978-3-642-23951-9_9"},{"issue":"2","key":"14_CR13","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/s13389-012-0027-1","volume":"2","author":"D.J. Bernstein","year":"2012","unstructured":"Bernstein, D.J., Duif, N., Lange, T., Schwabe, P., Yang, B.-Y.: High-speed high-security signatures. Journal of Cryptographic Engineering\u00a02(2), 77\u201389 (2012), http:\/\/cryptojedi.org\/papers\/#ed25519 , see also short version [12]","journal-title":"Journal of Cryptographic Engineering"},{"key":"14_CR14","unstructured":"Bernstein, D.J., Lange, T.: eBACS: ECRYPT benchmarking of cryptographic systems, http:\/\/bench.cr.yp.to (accessed August 15, 2013)"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., Lange, T.: Faster Addition and Doubling on Elliptic Curves. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol.\u00a04833, pp. 29\u201350. Springer, Heidelberg (2007), http:\/\/cr.yp.to\/papers.html#newelliptic","DOI":"10.1007\/978-3-540-76900-2_3"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., Lange, T., Schwabe, P.: The Security Impact of a New Cryptographic Library. In: Hevia, A., Neven, G. (eds.) LatinCrypt 2012. LNCS, vol.\u00a07533, pp. 159\u2013176. Springer, Heidelberg (2012), http:\/\/cryptojedi.org\/papers\/#coolnacl","DOI":"10.1007\/978-3-642-33481-8_9"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Beuchat, J.-L., D\u00edaz, J.E.G., Mitsunari, S., Okamoto, E., Rodr\u00edguez-Henr\u00edquez, F., Teruya, T.: High-speed software implementation of the optimal ate pairing over Barreto-Naehrig curves (2010), http:\/\/eprint.iacr.org\/2010\/354\/","DOI":"10.1007\/978-3-642-17455-1_2"},{"key":"14_CR18","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.\u00a02139, pp. 213\u2013229. Springer, Heidelberg (2001), http:\/\/www.iacr.org\/archive\/crypto2001\/21390212.pdf"},{"issue":"4","key":"14_CR19","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s00145-004-0314-9","volume":"17","author":"D. Boneh","year":"2004","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. Journal of Cryptology\u00a017(4), 297\u2013319 (2004), http:\/\/crypto.stanford.edu\/~dabo\/pubs\/papers\/weilsigs.ps","journal-title":"Journal of Cryptology"},{"key":"14_CR20","unstructured":"Bos, J.W., Costello, C., Naehrig, M.: Exponentiating in pairing groups. In: Selected Areas in Cryptography \u2013 SAC 2013. LNCS (to appear, 2013), http:\/\/cryptosith.org\/papers\/#exppair"},{"key":"14_CR21","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. Journal of Number Theory\u00a053, 229\u2013240 (1995), http:\/\/www.math.ru.nl\/~bosma\/pubs\/JNT1995.pdf","journal-title":"Journal of Number Theory"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Brumley, B.B., Tuveri, N.: Remote timing attacks are still practical. In: Atluri, V., Diaz, C. (eds.) ESORICS 2011. LNCS, vol.\u00a06879, pp. 355\u2013371. Springer, Heidelberg (2011), http:\/\/eprint.iacr.org\/2011\/232\/","DOI":"10.1007\/978-3-642-23822-2_20"},{"key":"14_CR23","unstructured":"Certivox. MIRACL Cryptographic SDK, http:\/\/www.certivox.com\/miracl"},{"key":"14_CR24","doi-asserted-by":"publisher","first-page":"1311","DOI":"10.1016\/j.dam.2011.04.021","volume":"159","author":"S. Chatterjee","year":"2011","unstructured":"Chatterjee, S., Menezes, A.: On cryptographic protocols employing asymmetric pairings \u2013 the role of \u03c8 revisited. Discrete Applied Mathematics\u00a0159, 1311\u20131322 (2011), http:\/\/eprint.iacr.org\/2009\/480\/","journal-title":"Discrete Applied Mathematics"},{"key":"14_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/BFb0053453","volume-title":"Advances in Cryptology - EUROCRYPT \u201994","author":"P. Rooij de","year":"1995","unstructured":"de Rooij, P.: Efficient exponentiation using precomputation and vector addition chains. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol.\u00a0950, pp. 389\u2013399. Springer, Heidelberg (1995)"},{"key":"14_CR26","doi-asserted-by":"crossref","unstructured":"Fardan, N.J.A., Paterson, K.G.: Lucky thirteen: Breaking the TLS and DTLS record protocols. In: 2013 IEEE Symposium on Security and Privacy, pp. 526\u2013540. IEEE Computer Society (2013), www.isg.rhul.ac.uk\/tls\/TLStiming.pdf","DOI":"10.1109\/SP.2013.42"},{"key":"14_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-33481-8_1","volume-title":"Progress in Cryptology \u2013 LATINCRYPT 2012","author":"P.-A. Fouque","year":"2012","unstructured":"Fouque, P.-A., Tibouchi, M.: Indifferentiable hashing to barreto\u2013naehrig curves. In: Hevia, A., Neven, G. (eds.) LatinCrypt 2012. LNCS, vol.\u00a07533, pp. 1\u201317. Springer, Heidelberg (2012), www.di.ens.fr\/~fouque\/pub\/latincrypt12.pdf"},{"issue":"2","key":"14_CR28","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. Journal of Cryptology\u00a023(2), 224\u2013280 (2010), http:\/\/eprint.iacr.org\/2006\/372\/","journal-title":"Journal of Cryptology"},{"key":"14_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1007\/3-540-36178-2_34","volume-title":"Advances in Cryptology - ASIACRYPT 2002","author":"C. Gentry","year":"2002","unstructured":"Gentry, C., Silverberg, A.: Hierarchical ID-Based Cryptography. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol.\u00a02501, pp. 548\u2013566. Springer, Heidelberg (2002), http:\/\/www.cs.ucdavis.edu\/~franklin\/ecs228\/pubs\/extra_pubs\/hibe.pdf"},{"key":"14_CR30","unstructured":"The GNU MP library, http:\/\/gmplib.org\/ (accessed November 02, 2013)"},{"key":"14_CR31","unstructured":"G\u00f6lo\u011flu, F., Granger, R., McGuire, G., Zumbr\u00e4gel, J.: Solving a 6120-bit DLP on a desktop computer. In: Selected Areas in Cryptography. LNCS. Springer (to appear, 2013), http:\/\/eprint.iacr.org\/2013\/306"},{"key":"14_CR32","unstructured":"Granger, R., Page, D., Stam, M.: On small characteristic algebraic tori in pairing-based cryptography, p. 132 (2004), http:\/\/eprint.iacr.org\/2004\/132"},{"key":"14_CR33","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.\u00a06056, pp. 209\u2013223. Springer, Heidelberg (2010)"},{"key":"14_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-642-17373-8_19","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"J. Groth","year":"2010","unstructured":"Groth, J.: Short Pairing-Based Non-interactive Zero-Knowledge Arguments. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol.\u00a06477, pp. 321\u2013340. Springer, Heidelberg (2010), http:\/\/www.cs.ucl.ac.uk\/staff\/J.Groth\/ShortNIZK.pdf"},{"issue":"5","key":"14_CR35","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.1137\/080725386","volume":"41","author":"J. Groth","year":"2012","unstructured":"Groth, J., Sahai, A.: Efficient noninteractive proof systems for bilinear groups. SIAM J. Comput.\u00a041(5), 1193\u20131232 (2012), http:\/\/www0.cs.ucl.ac.uk\/staff\/J.Groth\/WImoduleFull.pdf","journal-title":"SIAM J. Comput."},{"issue":"10","key":"14_CR36","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 Transactions on Information Theory\u00a052(10), 4595\u20134602 (2006), http:\/\/eprint.iacr.org\/2006\/110","journal-title":"IEEE Transactions on Information Theory"},{"key":"14_CR37","unstructured":"H\u0131\u015f\u0131l, H.: Elliptic Curves, Group Law, and Efficient Computation. PhD thesis, Queensland University of Technology (2010), http:\/\/eprints.qut.edu.au\/33233\/"},{"key":"14_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/3-540-46035-7_31","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"J. Horwitz","year":"2002","unstructured":"Horwitz, J., Lynn, B.: Toward Hierarchical Identity-Based Encryption. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 466\u2013481. Springer, Heidelberg (2002), http:\/\/theory.stanford.edu\/~horwitz\/pubs\/hibe.pdf"},{"key":"14_CR39","doi-asserted-by":"crossref","unstructured":"Joux, A.: A one round protocol for tripartite Diffie-Hellman. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol.\u00a01838, pp. 385\u2013393. Springer, Heidelberg (2000), cgi.di.uoa.gr\/~aggelos\/crypto\/page4\/assets\/joux-tripartite.pdf","DOI":"10.1007\/10722028_23"},{"issue":"4","key":"14_CR40","doi-asserted-by":"crossref","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. Journal of Cryptology, 17(4):263\u2013276 (2004)","journal-title":"Journal of Cryptology"},{"key":"14_CR41","doi-asserted-by":"crossref","unstructured":"Joux, A.: A new index calculus algorithm with complexity L(1\/4 + o(1)) in very small characteristic. In: SAC 2013. LNCS. Springer (invited paper) (to appear, 2013), http:\/\/eprint.iacr.org\/2013\/095\/","DOI":"10.1007\/978-3-662-43414-7_18"},{"key":"14_CR42","unstructured":"Lynn, B.: PBC library \u2013 the pairing-based cryptography library, http:\/\/crypto.stanford.edu\/pbc\/ (accessed November 05, 2013)."},{"key":"14_CR43","unstructured":"Mitsunari, S.: A fast implementation of the optimal ate pairing over BN curve on Intel Haswell processor (2013), http:\/\/eprint.iacr.org\/2013\/362\/"},{"key":"14_CR44","doi-asserted-by":"crossref","unstructured":"Naehrig, M., Barreto, P.S.L.M., Schwabe, P.: On Compressible Pairings and Their Computation. In: Vaudenay, S. (ed.) AFRICACRYPT 2008. LNCS, vol.\u00a05023, pp. 371\u2013388. Springer, Heidelberg (2008), http:\/\/eprint.iacr.org\/2007\/429\/","DOI":"10.1007\/978-3-540-68164-9_25"},{"key":"14_CR45","doi-asserted-by":"crossref","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.\u00a06212, pp. 109\u2013123. Springer, Heidelberg (2010), http:\/\/cryptojedi.org\/users\/peter\/#dclxvi","DOI":"10.1007\/978-3-642-14712-8_7"},{"key":"14_CR46","unstructured":"Ohgishi, K., Sakai, R., Kasahara, M.: Notes on ID-based key sharing systems over elliptic curve (in Japanese). Technical Report ISEC99-57, IEICE (1999)"},{"key":"14_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11605805_1","volume-title":"Topics in Cryptology \u2013 CT-RSA 2006","author":"D.A. Osvik","year":"2006","unstructured":"Osvik, D.A., Shamir, A., Tromer, E.: Cache attacks and countermeasures: the case of AES. In: Pointcheval, D. (ed.) CT-RSA 2006. LNCS, vol.\u00a03860, pp. 1\u201320. Springer, Heidelberg (2006), http:\/\/eprint.iacr.org\/2005\/271\/"},{"key":"14_CR48","unstructured":"Parno, B., Gentry, C., Howell, J., Raykova, M.: Pinocchio: Nearly practical verifiable computation. In: Proceedings of the IEEE Symposium on Security and Privacy. IEEE (2013), http:\/\/eprint.iacr.org\/2013\/279"},{"issue":"8","key":"14_CR49","doi-asserted-by":"publisher","first-page":"1319","DOI":"10.1016\/j.jss.2011.03.083","volume":"84","author":"G.C.C.F. Pereira","year":"2011","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. Journal of Systems and Software\u00a084(8), 1319\u20131326 (2011), http:\/\/cryptojedi.org\/papers\/#fast-bn","journal-title":"Journal of Systems and Software"},{"key":"14_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/11426639_27","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"A. Sahai","year":"2005","unstructured":"Sahai, A., Waters, B.: Fuzzy Identity-Based Encryption. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 457\u2013473. Springer, Heidelberg (2005), http:\/\/eprint.iacr.org\/2004\/086\/"},{"key":"14_CR51","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_CR52","unstructured":"Sakai, R., Ohgishi, K., Kasahara, M.: Cryptosystems based on pairing over elliptic curve (in Japanese). In: The 2001 Symposium on Cryptography and Information Security, Oiso, Japan, pp. 23\u201326 (2001)"},{"key":"14_CR53","doi-asserted-by":"crossref","unstructured":"S\u00e1nchez, A.H., Rodr\u00edguez-Henr\u00edquez, F.: NEON Implementation of an Attribute-Based Encryption Scheme. In: Jacobson, M., Locasto, M., Mohassel, P., Safavi-Naini, R. (eds.) ACNS 2013. LNCS, vol.\u00a07954, pp. 322\u2013338. Springer, Heidelberg (2013), http:\/\/cacr.uwaterloo.ca\/techreports\/2013\/cacr2013-07.pdf","DOI":"10.1007\/978-3-642-38980-1_20"},{"key":"14_CR54","doi-asserted-by":"crossref","unstructured":"Scott, M.: On the efficient implementation of pairing-based protocols. In: Chen, L. (ed.) IMACC 2011. LNCS, vol.\u00a07089, pp. 296\u2013308. Springer, Heidelberg (2011), http:\/\/eprint.iacr.org\/2011\/334\/","DOI":"10.1007\/978-3-642-25516-8_18"},{"key":"14_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-540-28628-8_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"M. Scott","year":"2004","unstructured":"Scott, M., Barreto, P.S.L.M.: Compressed Pairings. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 140\u2013156. Springer, Heidelberg (2004)"},{"key":"14_CR56","doi-asserted-by":"crossref","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), eprint.iacr.org\/2008\/490\/","DOI":"10.1007\/978-3-642-03298-1_6"},{"key":"14_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1007\/11792086_36","volume-title":"Algorithmic Number Theory","author":"A. Shallue","year":"2006","unstructured":"Shallue, A., van de Woestijne, C.E.: Construction of Rational Points on Elliptic Curves over Finite Fields. In: Hess, F., Pauli, S., Pohst, M. (eds.) ANTS 2006. LNCS, vol.\u00a04076, pp. 510\u2013524. Springer, Heidelberg (2006)"},{"key":"14_CR58","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/3-540-36400-5_24","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2002","author":"M. Stam","year":"2003","unstructured":"Stam, M., Lenstra, A.K.: Efficient subgroup exponentiation in quadratic and sixth degree extensions. In: Kaliski Jr., B.S., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2002. LNCS, vol.\u00a02523, pp. 318\u2013332. Springer, Heidelberg (2003)"},{"issue":"1","key":"14_CR59","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s00145-009-9049-y","volume":"23","author":"E. Tromer","year":"2010","unstructured":"Tromer, E., Osvik, D.A., Shamir, A.: Efficient cache attacks on AES, and countermeasures. Journal of Cryptology\u00a023(1), 37\u201371 (2010), http:\/\/people.csail.mit.edu\/tromer\/papers\/cache-joc-official.pdf","journal-title":"Journal of Cryptology"},{"key":"14_CR60","doi-asserted-by":"crossref","unstructured":"Vercauteren, F.: Optimal pairings. IEEE Transactions on Information Theory 56(1) (2010), http:\/\/www.cosic.esat.kuleuven.be\/publications\/article-1039.pdf","DOI":"10.1109\/TIT.2009.2034881"},{"key":"14_CR61","unstructured":"Yarom, Y., Falkner, K.: Flush+reload: a high resolution, low noise, L3 cache side-channel attack (2013), http:\/\/eprint.iacr.org\/2013\/448\/"}],"container-title":["Lecture Notes in Computer Science","Pairing-Based Cryptography \u2013 Pairing 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-04873-4_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T17:30:21Z","timestamp":1746120621000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-04873-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319048727","9783319048734"],"references-count":61,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-04873-4_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}