{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:31:32Z","timestamp":1743096692745,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319120867"},{"type":"electronic","value":"9783319120874"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-319-12087-4_11","type":"book-chapter","created":{"date-parts":[[2014,10,24]],"date-time":"2014-10-24T19:32:54Z","timestamp":1414179174000},"page":"167-184","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Omega Pairing on Hyperelliptic Curves"],"prefix":"10.1007","author":[{"given":"Shan","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kunpeng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongdai","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,10,25]]},"reference":[{"issue":"4","key":"11_CR1","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/s00145-004-0315-8","volume":"17","author":"VS Miller","year":"2004","unstructured":"Miller, V.S.: The Weil Pairing and its efficient calculation. J. Cryptol. 17(4), 235\u2013261 (2004)","journal-title":"J. Cryptol."},{"issue":"1","key":"11_CR2","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. Theory 56(1), 455\u2013461 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"11_CR3","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s10623-006-9033-6","volume":"42","author":"PSLM Barreto","year":"2007","unstructured":"Barreto, P.S.L.M., Galbraith, S., OhEigeartaigh, C., Scott, M.: Efficient pairing computation on supersingular abelian varieties. Des. Codes Crypt. 42(3), 239\u2013271 (2007)","journal-title":"Des. Codes Crypt."},{"issue":"10","key":"11_CR4","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. Theory 52(10), 4595\u20134602 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"11_CR5","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/s10207-008-0054-1","volume":"7","author":"CA Zhao","year":"2008","unstructured":"Zhao, C.A., Zhang, F., Huang, J.: A note on the Ate pairing. Int. J. Inf. Secur. Arch. 7(6), 379\u2013382 (2008)","journal-title":"Int. J. Inf. Secur. Arch."},{"issue":"4","key":"11_CR6","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 Trans. Inf. Theory 55(4), 1793\u20131803 (2009)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"11_CR7","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s10623-010-9383-y","volume":"58","author":"CA Zhao","year":"2011","unstructured":"Zhao, C.A., Xie, D., Zhang, F., Zhang, J., Chen, B.L.: Computing bilinear pairings on elliptic curves with automorphisms. Des. Codes Crypt. 58(1), 35\u201344 (2011)","journal-title":"Des. Codes Crypt."},{"key":"11_CR8","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. 5209, pp. 18\u201338. Springer, Heidelberg (2008)"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1007\/978-3-540-72540-4_25","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"R Granger","year":"2007","unstructured":"Granger, R., Hess, F., Oyono, R., Th\u00e9riault, N., Vercauteren, F.: Ate pairing on hyperelliptic curves. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 430\u2013447. Springer, Heidelberg (2007)"},{"issue":"8","key":"11_CR10","first-page":"1528","volume":"53","author":"F Zhang","year":"2010","unstructured":"Zhang, F.: Twisted Ate pairing on hyperelliptic curves and applications Sciece China. Inf. Sci. 53(8), 1528\u20131538 (2010)","journal-title":"Inf. Sci."},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-540-85538-5_17","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2008","author":"X Fan","year":"2008","unstructured":"Fan, X., Gong, G., Jao, D.: Speeding up pairing computations on genus 2 hyperelliptic curves with efficiently computable automorphisms. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol. 5209, pp. 243\u2013264. Springer, Heidelberg (2008)"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-642-04159-4_2","volume-title":"Selected Areas in Cryptography","author":"X Fan","year":"2009","unstructured":"Fan, X., Gong, G., Jao, D.: Efficient pairing computation on genus 2 curves in projective coordinates. In: Avanzi, R.M., Keliher, L., Sica, F. (eds.) SAC 2008. LNCS, vol. 5381, pp. 18\u201334. Springer, Heidelberg (2009)"},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1016\/j.ipl.2011.02.011","volume":"111","author":"C Tang","year":"2011","unstructured":"Tang, C., Xu, M., Qi, Y.: Faster pairing computation on genus 2 hyperelliptic curves. Inf. Process. Lett. 111, 494\u2013499 (2011)","journal-title":"Inf. Process. Lett."},{"key":"11_CR14","unstructured":"Balakrishnan, J., Belding, J., Chisholm, S., Eisentr\u00e4ger, K., Stange, K., Teske, E.: Pairings on hyperelliptic curves (2009). http:\/\/www.math.uwaterloo.ca\/~eteske\/teske\/pairings.pdf"},{"issue":"177","key":"11_CR15","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1090\/S0025-5718-1987-0866101-0","volume":"48","author":"DG Cantor","year":"1987","unstructured":"Cantor, D.G.: Computing in the Jacobian of a hyperelliptic curve. Math. Comp 48(177), 95\u2013101 (1987)","journal-title":"Math. Comp"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Mumford, D.: Tata Lectures on Theta I, II. Birkh\u00e4user, Boston (1983\/84)","DOI":"10.1007\/978-1-4899-2843-6"},{"key":"11_CR17","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/BF01444229","volume":"305","author":"EW Howe","year":"1996","unstructured":"Howe, E.W.: The Weil pairing and the Hilbert symbol. Math. Ann. 305, 387\u2013392 (1996)","journal-title":"Math. Ann."},{"key":"11_CR18","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. J. Cryptol. 17, 263\u2013276 (2004)","journal-title":"J. Cryptol."},{"key":"11_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-540-24691-6_9","volume-title":"Information Security and Cryptology - ICISC 2003","author":"Y Choie","year":"2004","unstructured":"Choie, Y., Lee, E.: Implementation of Tate pairing on hyperelliptic curves of genus 2. In: Lim, J.-I., Lee, D.-H. (eds.) ICISC 2003. LNCS, vol. 2971, pp. 97\u2013111. Springer, Heidelberg (2004)"},{"key":"11_CR20","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. 3152, pp. 140\u2013156. Springer, Heidelberg (2004)"},{"key":"11_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1007\/978-3-540-72540-4_25","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"R Granger","year":"2007","unstructured":"Granger, R., Hess, F., Oyono, R., Th\u00e9riault, N., Vercauteren, F.: Ate pairing on hyperelliptic curves. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 430\u2013447. Springer, Heidelberg (2007)"},{"key":"11_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/11792086_34","volume-title":"Algorithmic Number Theory","author":"R Granger","year":"2006","unstructured":"Granger, R., Page, D.L., Smart, N.P.: High security pairing-based cryptography revisited. In: Hess, F., Pauli, S., Pohst, M. (eds.) ANTS 2006. LNCS, vol. 4076, pp. 480\u2013494. Springer, Heidelberg (2006)"},{"key":"11_CR23","series-title":"GTM","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-09494-6","volume-title":"The Arithmetic of Elliptic Curves","author":"H Silverman","year":"2009","unstructured":"Silverman, H.: The Arithmetic of Elliptic Curves. GTM, vol. 106, 2nd edn. Springer, New York (2009)","edition":"2"},{"issue":"10","key":"11_CR24","doi-asserted-by":"publisher","first-page":"3084","DOI":"10.1093\/ietfec\/e91-a.10.3084","volume":"E91\u2013A","author":"CA Zhao","year":"2008","unstructured":"Zhao, C.A., Zhang, F., Huang, J.: All pairings are in a group. IEICE Trans. Fundam. E91\u2013A(10), 3084\u20133087 (2008)","journal-title":"IEICE Trans. Fundam."}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12087-4_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T14:43:08Z","timestamp":1676904188000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-12087-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319120867","9783319120874"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12087-4_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"25 October 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}