{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T13:03:31Z","timestamp":1725714211579},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642363337"},{"type":"electronic","value":"9783642363344"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36334-4_3","type":"book-chapter","created":{"date-parts":[[2013,1,30]],"date-time":"2013-01-30T19:55:13Z","timestamp":1359575713000},"page":"35-45","source":"Crossref","is-referenced-by-count":0,"title":["An Improved Twisted Ate Pairing over KSS Curves with k\u2009=\u200918"],"prefix":"10.1007","author":[{"given":"Shan","family":"Chen","sequence":"first","affiliation":[]},{"given":"Kunpeng","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Dongdai","family":"Lin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-642-25516-8_17","volume-title":"Cryptography and Coding","author":"D.F. Aranha","year":"2011","unstructured":"Aranha, D.F., Knapp, E., Menezes, A., Rodr\u00edguez-Henr\u00edquez, F.: Parallelizing the Weil and Tate Pairings. In: Chen, L. (ed.) Cryptography and Coding 2011. LNCS, vol.\u00a07089, pp. 275\u2013295. Springer, Heidelberg (2011)"},{"issue":"3","key":"3_CR2","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s10623-006-9033-6","volume":"42","author":"P.S.L.M. Barreto","year":"2007","unstructured":"Barreto, P.S.L.M., Galbraith, S., h\u00c9igeartaigh, C.\u00d3., Scott, M.: Efficient pairing computation on supersingular abelian varieties. Designs, Codes and Cryptography\u00a042(3), 239\u2013271 (2007)","journal-title":"Designs, Codes and Cryptography"},{"key":"3_CR3","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 - CRYPTO 2002","author":"P.S.L.M. 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.\u00a02442, pp. 354\u2013368. Springer, Heidelberg (2002)"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-540-24654-1_2","volume-title":"Selected Areas in Cryptography","author":"P.S.L.M. Barreto","year":"2004","unstructured":"Barreto, P.S.L.M., Lynn, B., Scott, M.: On the Selection of Pairing-Friendly Groups. In: Matsui, M., Zuccherato, R.J. (eds.) SAC 2003. LNCS, vol.\u00a03006, pp. 17\u201325. Springer, Heidelberg (2004)"},{"key":"3_CR5","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.\u00a02248, pp. 514\u2013532. Springer, Heidelberg (2001)"},{"issue":"1","key":"3_CR6","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s10623-004-3808-4","volume":"37","author":"A.W. Brezing","year":"2005","unstructured":"Brezing, A.W.: Elliptic curves suitable for pairing-based cryptography. Designs, Codes and Cryptography\u00a037(1), 133\u2013141 (2005)","journal-title":"Designs, Codes and Cryptography"},{"key":"3_CR7","unstructured":"Granger, R., Smart, N.P.: On computing products of pairings. Cryptology ePrint Archive: Report 2006\/172"},{"key":"3_CR8","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":"3_CR9","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":"E.J. 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.\u00a05209, pp. 126\u2013135. Springer, Heidelberg (2008)"},{"issue":"4","key":"3_CR10","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 Abelien varieties. IEEE Transactions on Information Theory\u00a055(4), 1793\u20131803 (2009)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"3_CR11","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00145-004-0315-8","volume":"17","author":"V.S. Miller","year":"2004","unstructured":"Miller, V.S.: The Weil Pairing and its efficient calculation. Journal of Cryptology\u00a017(4), 235\u2013261 (2004)","journal-title":"Journal of Cryptology"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/11593447_29","volume-title":"Advances in Cryptology - ASIACRYPT 2005","author":"T. Nakanishi","year":"2005","unstructured":"Nakanishi, T., Funabiki, N.: Verifier-Local Revocation Group Signature Schemes with Backward Unlinkability from Bilinear Maps. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol.\u00a03788, pp. 533\u2013548. Springer, Heidelberg (2005)"},{"issue":"10","key":"3_CR13","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)","journal-title":"IEEE Transactions on Information Theory"},{"key":"3_CR14","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":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-642-14423-3_4","volume-title":"Information, Security and Cryptology \u2013 ICISC 2009","author":"Y. Sakemi","year":"2010","unstructured":"Sakemi, Y., Takeuchi, S., Nogami, Y., Morikawa, Y.: Accelerating Twisted Ate Pairing with Frobenius Map, Small Scalar Multiplication, and Multi-pairing. In: Lee, D., Hong, S. (eds.) ICISC 2009. LNCS, vol.\u00a05984, pp. 47\u201364. Springer, Heidelberg (2010)"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-540-89641-8_16","volume-title":"Cryptology and Network Security","author":"Y. Sakemi","year":"2008","unstructured":"Sakemi, Y., Nogami, Y., Okeya, K., Kato, H., Morikawa, Y.: Skew Frobenius Map and Efficient Scalar Multiplication for Pairing\u2013Based Cryptography. In: Franklin, M.K., Hui, L.C.K., Wong, D.S. (eds.) CANS 2008. LNCS, vol.\u00a05339, pp. 226\u2013239. Springer, Heidelberg (2008)"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Silverman, J.H.: The arithmetic of elliptic curves, 2nd edn. GTM 106 (2009)","DOI":"10.1007\/978-0-387-09494-6"},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/11596219_21","volume-title":"Progress in Cryptology - INDOCRYPT 2005","author":"M. Scott","year":"2005","unstructured":"Scott, M.: Faster Pairings Using an Elliptic Curve with an Efficient Endomorphism. In: Maitra, S., Veni Madhavan, C.E., Venkatesan, R. (eds.) INDOCRYPT 2005. LNCS, vol.\u00a03797, pp. 258\u2013269. Springer, Heidelberg (2005)"},{"key":"3_CR19","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)"},{"issue":"1","key":"3_CR20","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 Transactions on Information Theory\u00a056(1), 455\u2013461 (2010)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"6","key":"3_CR21","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/s10207-008-0054-1","volume":"7","author":"C.-A. Zhao","year":"2008","unstructured":"Zhao, C.-A., Zhang, F., Huang, J.: A note on the Ate pairing. Int. J. Inf. Security Arch.\u00a07(6), 379\u2013382 (2008)","journal-title":"Int. J. Inf. Security Arch."},{"issue":"10","key":"3_CR22","doi-asserted-by":"publisher","first-page":"3084","DOI":"10.1093\/ietfec\/e91-a.10.3084","volume":"E91-A","author":"C.-A. Zhao","year":"2008","unstructured":"Zhao, C.-A., Zhang, F., Huang, J.: All pairings are in a group. IEICE Trans. Fundam.\u00a0E91-A(10), 3084\u20133087 (2008)","journal-title":"IEICE Trans. Fundam."}],"container-title":["Lecture Notes in Computer Science","Pairing-Based Cryptography \u2013 Pairing 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36334-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T20:02:31Z","timestamp":1557518551000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36334-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642363337","9783642363344"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36334-4_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}