{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:36:59Z","timestamp":1759639019821},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642137969"},{"type":"electronic","value":"9783642137976"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13797-6_9","type":"book-chapter","created":{"date-parts":[[2010,6,24]],"date-time":"2010-06-24T10:49:56Z","timestamp":1277376596000},"page":"114-134","source":"Crossref","is-referenced-by-count":26,"title":["On the Efficiency and Security of Pairing-Based Protocols in the Type\u00a01 and Type\u00a04 Settings"],"prefix":"10.1007","author":[{"given":"Sanjit","family":"Chatterjee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Darrel","family":"Hankerson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alfred","family":"Menezes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-642-11925-5_7","volume-title":"RSA Cryptographers\u2019 Track (CT-RSA 2010)","author":"D. Aranha","year":"2010","unstructured":"Aranha, D., L\u00f3pez, J., Hankerson, D.: High-speed parallel software implementation of the \u03b7\n                  \n                    T\n                   pairing. In: Pieprzyk, J. (ed.) CT-RSA 2010. LNCS, vol.\u00a05985, pp. 89\u2013105. Springer, Heidelberg (2010)"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s10623-006-9033-6","volume":"42","author":"P. Barreto","year":"2007","unstructured":"Barreto, P., Galbraith, S., h\u00c9igeartaigh, C.\u00d3., Scott, M.: Efficient pairing computation on supersingular abelian varieties. Designs, Codes and Cryptography\u00a042, 239\u2013271 (2007)","journal-title":"Designs, Codes and Cryptography"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/978-3-642-10433-6_28","volume-title":"Cryptology and Network Security (CANS 2009)","author":"J.-L. Beuchat","year":"2009","unstructured":"Beuchat, J.-L., L\u00f3pez-Trejo, E., Mart\u00ednez-Ramos, L., Mitsunari, S., Rodr\u00edguez-Henr\u00edquez, F.: Multi-core implementation of the Tate pairing over supersingular elliptic curves. In: Miyaji, A., Echizen, I., Okamoto, T. (eds.) CANS 2009. LNCS, vol.\u00a05888, pp. 413\u2013432. Springer, Heidelberg (2009)"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/978-3-540-28628-8_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"D. Boneh","year":"2004","unstructured":"Boneh, D., Boyen, X., Shacham, H.: Short group signatures. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 41\u201355. Springer, Heidelberg (2004)"},{"key":"9_CR5","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 Journal on Computing\u00a032, 586\u2013615 (2003)","journal-title":"SIAM Journal on Computing"},{"key":"9_CR6","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, 297\u2013319 (2004)","journal-title":"Journal of Cryptology"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Boneh, D., Shacham, H.: Group signatures with verifier-local revocation. In: 11th ACM Conference on Computer and Communications Security \u2013 CCS 2004, pp. 168\u2013177 (2004)","DOI":"10.1145\/1030083.1030106"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-540-89598-5_15","volume-title":"Advances in Information and Computer Security","author":"J. Bringer","year":"2008","unstructured":"Bringer, J., Chabanne, H., Pointcheval, D., Zimmer, S.: An application of the Boneh and Shacham group signature scheme to biometric authentication. In: Matsuura, K., Fujisaki, E. (eds.) IWSEC 2008. LNCS, vol.\u00a05312, pp. 219\u2013230. Springer, Heidelberg (2008)"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1007\/11426639_18","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"J. Camenisch","year":"2005","unstructured":"Camenisch, J., Hohenberger, S., Lysyanskaya, A.: Compact E-cash. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 302\u2013321. Springer, Heidelberg (2005)"},{"key":"9_CR10","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. Designs, Codes and Cryptography\u00a055, 141\u2013167 (2010)","journal-title":"Designs, Codes and Cryptography"},{"key":"9_CR11","unstructured":"Chatterjee, S., Menezes, A.: On cryptographic protocols employing asymmetric pairings \u2013 the role of \u03c8 revisited. Cryptology ePrint Archive, Report 2009\/480 (2009)"},{"key":"9_CR12","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.: Identity-based key agreement protocols from pairings. International Journal of Information Security\u00a06, 213\u2013241 (2007)","journal-title":"International Journal of Information Security"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/11958239_13","volume-title":"Progress in Cryptology - VIETCRYPT 2006","author":"C. Delerabl\u00e9e","year":"2006","unstructured":"Delerabl\u00e9e, C., Pointcheval, D.: Dynamic fully anonymous short group signatures. In: Nguy\u00ean, P.Q. (ed.) VIETCRYPT 2006. LNCS, vol.\u00a04341, pp. 193\u2013210. Springer, Heidelberg (2006)"},{"key":"9_CR14","unstructured":"Fog, A.: Instruction Tables: Lists of instruction latencies, throughputs and micro-operation breakdowns for Intel, AMD and VIA CPUs (2009), \n                    \n                      http:\/\/www.agner.org\/optimize\/"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/11792086_33","volume-title":"Algorithmic Number Theory","author":"G. Frey","year":"2006","unstructured":"Frey, G., Lange, T.: Fast bilinear maps from the Tate-Lichtenbaum pairing on hyperelliptic curves. In: Hess, F., Pauli, S., Pohst, M. (eds.) ANTS 2006. LNCS, vol.\u00a04076, pp. 466\u2013479. Springer, Heidelberg (2006)"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-540-73489-5_7","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2007","author":"S. Galbraith","year":"2007","unstructured":"Galbraith, S., Hess, F., Vercauteren, F.: Hyperelliptic pairings. In: Takagi, T., Okamoto, T., Okamoto, E., Okamoto, T. (eds.) Pairing 2007. LNCS, vol.\u00a04575, pp. 108\u2013131. Springer, Heidelberg (2007)"},{"key":"9_CR17","doi-asserted-by":"publisher","first-page":"3113","DOI":"10.1016\/j.dam.2007.12.010","volume":"156","author":"S. Galbraith","year":"2008","unstructured":"Galbraith, S., Paterson, K., Smart, N.: Pairings for cryptographers. Discrete Applied Mathematics\u00a0156, 3113\u20133121 (2008)","journal-title":"Discrete Applied Mathematics"},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-540-77360-3_12","volume-title":"Selected Areas in Cryptography","author":"E. Gorla","year":"2007","unstructured":"Gorla, E., Puttmann, C., Shokrollahi, J.: Explicit formulas for efficient multiplication in \n                    \n                      \n                    \n                    $\\mathcal{F}[3^{6m}]$\n                  . In: Adams, C., Miri, A., Wiener, M. (eds.) SAC 2007. LNCS, vol.\u00a04876, pp. 173\u2013183. Springer, Heidelberg (2007)"},{"key":"9_CR19","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1112\/S1461157000001194","volume":"9","author":"R. Granger","year":"2006","unstructured":"Granger, R., Page, D., Stam, M.: On small characteristic algebraic tori in pairing-based cryptography. LMS Journal of Computation and Mathematics\u00a09, 64\u201385 (2006)","journal-title":"LMS Journal of Computation and Mathematics"},{"key":"9_CR20","volume-title":"Identity-Based Cryptography","author":"D. Hankerson","year":"2008","unstructured":"Hankerson, D., Menezes, A., Scott, M.: Software implementation of pairings. In: Joye, M., Neven, G. (eds.) Identity-Based Cryptography. IOS Press, Amsterdam (2008)"},{"key":"9_CR21","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1112\/S1461157000000747","volume":"5","author":"K. Harrison","year":"2000","unstructured":"Harrison, K., Page, D., Smart, N.P.: Software implementation of finite fields of characteristic three, for use in pairing-based cryptosystems. LMS Journal of Computation and Mathematics\u00a05, 181\u2013193 (2000)","journal-title":"LMS Journal of Computation and Mathematics"},{"key":"9_CR22","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 Trans. Information Theory\u00a052, 4595\u20134602 (2006)","journal-title":"IEEE Trans. Information Theory"},{"key":"9_CR23","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. Journal of Cryptology\u00a017, 263\u2013276 (2004)","journal-title":"Journal of Cryptology"},{"key":"9_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-540-85538-5_19","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2008","author":"Y. Kawahara","year":"2008","unstructured":"Kawahara, Y., Aoki, K., Takagi, T.: Faster implementation of \u03b7\n                  \n                    T\n                   pairing over GF(3\n                    m\n                  ) using minimum number of logical instructions for GF(3)-addition. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol.\u00a05209, pp. 282\u2013296. Springer, Heidelberg (2008)"},{"key":"9_CR25","doi-asserted-by":"publisher","first-page":"1793","DOI":"10.1109\/TIT.2009.2013048","volume":"55","author":"E. Lee","year":"2009","unstructured":"Lee, E., Lee, H., Park, C.: Efficient and generalized pairing computation on abelian varieties. IEEE Trans. Information Theory\u00a055, 1793\u20131803 (2009)","journal-title":"IEEE Trans. Information Theory"},{"key":"9_CR26","doi-asserted-by":"publisher","first-page":"1057","DOI":"10.4134\/JKMS.2008.45.4.1057","volume":"45","author":"E. Lee","year":"2008","unstructured":"Lee, E., Lee, Y.: Tate pairing computation on the divisors of hyperelliptic curves of genus 2. Journal of the Korean Mathematical Society\u00a045, 1057\u20131073 (2008)","journal-title":"Journal of the Korean Mathematical Society"},{"key":"9_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/3-540-45682-1_5","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"A. Lenstra","year":"2001","unstructured":"Lenstra, A.: Unbelievable security: Matching AES security using public key systems. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 67\u201386. Springer, Heidelberg (2001)"},{"key":"9_CR28","volume-title":"An elementary introduction to hyperelliptic curves. Appendix in Algebraic Aspects of Cryptography","author":"A. Menezes","year":"1998","unstructured":"Menezes, A., Wu, Y., Zuccherato, R.: An elementary introduction to hyperelliptic curves. Appendix in Algebraic Aspects of Cryptography. Springer, Heidelberg (1998)"},{"key":"9_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/11908739_2","volume-title":"Advances in Information and Computer Security","author":"T. Nakanishi","year":"2006","unstructured":"Nakanishi, T., Funabiki, N.: A short verifier-local revocation group signature scheme with backward unlinkability. In: Yoshiura, H., Sakurai, K., Rannenberg, K., Murayama, Y., Kawamura, S.-i. (eds.) IWSEC 2006. LNCS, vol.\u00a04266, pp. 17\u201332. Springer, Heidelberg (2006)"},{"key":"9_CR30","unstructured":"\u00d3 h\u00c9igeartaigh, C.: Pairing computation on hyperelliptic curves of genus 2. PhD thesis, Dublin City University (2006)"},{"key":"9_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/978-3-540-74462-7_21","volume-title":"Selected Areas in Cryptography","author":"C.. \u00d3 h\u00c9igeartaigh","year":"2007","unstructured":"\u00d3 h\u00c9igeartaigh, C., Scott, M.: Pairing calculation on supersingular genus\u00a02 curves. In: Biham, E., Youssef, A.M. (eds.) SAC 2006. LNCS, vol.\u00a04356, pp. 302\u2013316. Springer, Heidelberg (2007)"},{"key":"9_CR32","unstructured":"Shacham, H.: New paradigms in signature schemes, PhD thesis, Stanford University (2005)"},{"key":"9_CR33","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1016\/j.dam.2006.07.004","volume":"155","author":"N. Smart","year":"2007","unstructured":"Smart, N., Vercauteren, F.: On computable isomorphisms in efficient pairing-based systems. Discrete Applied Mathematics\u00a0155, 538\u2013547 (2007)","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Arithmetic of Finite Fields"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13797-6_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:13:07Z","timestamp":1619784787000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13797-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642137969","9783642137976"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13797-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}