{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:44:51Z","timestamp":1743021891716,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642382352"},{"type":"electronic","value":"9783642382369"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38236-9_26","type":"book-chapter","created":{"date-parts":[[2013,4,15]],"date-time":"2013-04-15T02:38:02Z","timestamp":1365993482000},"page":"282-293","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Self-pairing on Ordinary Elliptic Curves"],"prefix":"10.1007","author":[{"given":"Hongfeng","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rongquan","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","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":"D.F. 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.\u00a06632, pp. 48\u201368. Springer, Heidelberg (2011)"},{"key":"26_CR2","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1016\/j.jnt.2010.05.013","volume":"131","author":"C. Arene","year":"2011","unstructured":"Arene, C., Lange, T., Naehrig, M., Ritzenthaler, C.: Faster Computation of the Tate Pairing. Journal of Number Theory\u00a0131, 842\u2013857 (2011)","journal-title":"Journal of Number Theory"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Avanzi, R., Cohen, H., Doche, C., Frey, G., Lange, T., Nguyen, K., Vercauteren, F.: Handbook of Elliptic and Hyperelliptic Curve Cryptography. CRC Press (2005)","DOI":"10.1201\/9781420034981"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Blake, I.F., Seroussi, G., Smart, N.P.: Advances in Elliptic Curve Cryptography. Cambridge University Press (2005)","DOI":"10.1017\/CBO9780511546570"},{"key":"26_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/978-3-642-17455-1_26","volume-title":"Pairing-Based Cryptography - Pairing 2010","author":"J. Boxall","year":"2010","unstructured":"Boxall, J., El Mrabet, N., Laguillaumie, F., Le, D.-P.: A Variant of Miller\u2019s Formula and Algorithm. In: Joye, M., Miyaji, A., Otsuka, A. (eds.) Pairing 2010. LNCS, vol.\u00a06487, pp. 417\u2013434. Springer, Heidelberg (2010)"},{"key":"26_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-642-13013-7_14","volume-title":"Public Key Cryptography \u2013 PKC 2010","author":"C. Costello","year":"2010","unstructured":"Costello, C., Lange, T., Naehrig, M.: Faster Pairing Computations on Curves with High-Degree Twists. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol.\u00a06056, pp. 224\u2013242. Springer, Heidelberg (2010)"},{"key":"26_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-540-40061-5_7","volume-title":"Advances in Cryptology - ASIACRYPT 2003","author":"I. Duursma","year":"2003","unstructured":"Duursma, I., Lee, H.-S.: Tate pairing implementation for hyperelliptic curves y\n                        2\u2009=\u2009x\n                        \n                  p\n                \u2009\u2212\u2009x\u2009+\u2009d. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol.\u00a02894, pp. 111\u2013123. Springer, Heidelberg (2003)"},{"issue":"206","key":"26_CR8","first-page":"865","volume":"62","author":"G. Frey","year":"1994","unstructured":"Frey, G., R\u00fcck, H.-G.: A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves. Math. Comp.\u00a062(206), 865\u2013874 (1994)","journal-title":"Math. Comp."},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"3113","DOI":"10.1016\/j.dam.2007.12.010","volume":"156","author":"S.D. Galbraith","year":"2008","unstructured":"Galbraith, S.D., Paterson, K., Smart, N.: Pairings for cryptographers. Discr. Appl. Math.\u00a0156, 3113\u20133121 (2008)","journal-title":"Discr. Appl. Math."},{"key":"26_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-642-17401-8_18","volume-title":"Progress in Cryptology - INDOCRYPT 2010","author":"F. Herbaut","year":"2010","unstructured":"Herbaut, F., Liardet, P.-Y., M\u00e9loni, N., T\u00e9glia, Y., V\u00e9ron, P.: Random Euclidean Addition Chain Generation and Its Application to Point Multiplication. In: Gong, G., Gupta, K.C. (eds.) INDOCRYPT 2010. LNCS, vol.\u00a06498, pp. 238\u2013261. Springer, Heidelberg (2010)"},{"key":"26_CR11","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. Infor. Theory\u00a052, 4595\u20134602 (2006)","journal-title":"IEEE Trans. Infor. Theory"},{"key":"26_CR12","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":"26_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-642-21518-6_8","volume-title":"Information Security and Cryptology","author":"Z. Hu","year":"2011","unstructured":"Hu, Z., Xu, M., Zhou, Z.: A Generalization of Verheul\u2019s Theorem for Some Ordinary Curves. In: Lai, X., Yung, M., Lin, D. (eds.) Inscrypt 2010. LNCS, vol.\u00a06584, pp. 105\u2013114. Springer, Heidelberg (2011)"},{"key":"26_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/11586821_2","volume-title":"Cryptography and Coding","author":"N. Koblitz","year":"2005","unstructured":"Koblitz, N., Menezes, A.: Pairing-based cryptography at high security levels. In: Smart, N.P. (ed.) Cryptography and Coding 2005. LNCS, vol.\u00a03796, pp. 13\u201336. Springer, Heidelberg (2005)"},{"issue":"4","key":"26_CR15","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.-S., Park, C.-M.: Efficient and generalized pairing computation on Abelian varieties. IEEE Trans. Inform. Theory\u00a055(4), 1793\u20131803 (2009)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"26_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/978-3-540-77272-9_18","volume-title":"Cryptography and Coding","author":"S. Matsuda","year":"2007","unstructured":"Matsuda, S., Kanayama, N., Hess, F., Okamoto, E.: Optimised Versions of the Ate and twisted Ate pairings. In: Galbraith, S.D. (ed.) Cryptography and Coding 2007. LNCS, vol.\u00a04887, pp. 302\u2013312. Springer, Heidelberg (2007)"},{"key":"26_CR17","unstructured":"Miller, V.S.: Short programs for functions on curves, \n                    http:\/\/crypto.stanford.edu\/miller\/miller.pdf"},{"issue":"44","key":"26_CR18","doi-asserted-by":"crossref","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. J. Cryptol.\u00a017(44), 235\u2013261 (2004)","journal-title":"J. Cryptol."},{"key":"26_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/11599548_27","volume-title":"Information Security and Cryptology","author":"C.M. Park","year":"2005","unstructured":"Park, C.M., Kim, M.H., Yung, M.: A Remark on Implementing the Weil Pairing. In: Feng, D., Lin, D., Yung, M. (eds.) CISC 2005. LNCS, vol.\u00a03822, pp. 313\u2013323. Springer, Heidelberg (2005)"},{"key":"26_CR20","doi-asserted-by":"crossref","unstructured":"Paterson, K.G.: Cryptography from Pairing - Advances in Elliptic Curve Cryptography. Cambridge University Press (2005)","DOI":"10.1017\/CBO9780511546570.012"},{"key":"26_CR21","volume-title":"The arithmetic of elliptic curves","author":"J.H. Silverman","year":"1992","unstructured":"Silverman, J.H.: The arithmetic of elliptic curves. Springer, New York (1992)"},{"issue":"2","key":"26_CR22","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s11227-010-0427-x","volume":"55","author":"R. Tso","year":"2011","unstructured":"Tso, R., Yi, X., Huang, X.: Efficient and short certificateless signatures secure against realistic adversaries. J. Supercomput.\u00a055(2), 173\u2013191 (2011)","journal-title":"J. Supercomput."},{"key":"26_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/3-540-44987-6_13","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"E.R. Verheul","year":"2001","unstructured":"Verheul, E.R.: Evidence that XTR is more secure than supersingular elliptic curve cryptosystems. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 195\u2013210. Springer, Heidelberg (2001)"},{"key":"26_CR24","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\u00a056, 455\u2013461 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"26_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/11958239_5","volume-title":"Progress in Cryptology - VIETCRYPT 2006","author":"F. Zhang","year":"2006","unstructured":"Zhang, F., Chen, X., Susilo, W., Mu, Y.: A New Signature Scheme Without Random Oracles from Bilinear Pairings. In: Nguy\u00ean, P.Q. (ed.) VIETCRYPT 2006. LNCS, vol.\u00a04341, pp. 67\u201380. Springer, Heidelberg (2006)"},{"key":"26_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-540-24632-9_20","volume-title":"Public Key Cryptography \u2013 PKC 2004","author":"F. Zhang","year":"2004","unstructured":"Zhang, F., Safavi-Naini, R., Susilo, W.: An efficient signature scheme from bilinear pairings and its applications. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol.\u00a02947, pp. 277\u2013290. Springer, Heidelberg (2004)"},{"key":"26_CR27","unstructured":"Zhang, F., Safavi-Naini, R., Susilo, W.: ID-Based Chameleon Hashes from Bilinear Pairings, Cryptology ePrint Archive, Report 2003\/208"},{"issue":"1","key":"26_CR28","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s10623-010-9383-y","volume":"58","author":"C.-A. Zhao","year":"2011","unstructured":"Zhao, C.-A., Xie, D.Q., Zhang, F., Zhang, J., Chen, B.-L.: Computing Bilinear Pairings on Elliptic Curves with Automorphisms. Designs, Codes and Cryptography\u00a058(1), 35\u201344 (2011)","journal-title":"Designs, Codes and Cryptography"},{"issue":"5","key":"26_CR29","doi-asserted-by":"publisher","first-page":"3266","DOI":"10.1109\/TIT.2012.2184850","volume":"58","author":"C.-A. Zhao","year":"2012","unstructured":"Zhao, C.-A., Zhang, F., Xie, D.Q.: Faster Computation of Self-Pairings. IEEE Transactions on Information Theory\u00a058(5), 3266\u20133272 (2012)","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38236-9_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,19]],"date-time":"2023-01-19T10:22:22Z","timestamp":1674123742000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-38236-9_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642382352","9783642382369"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38236-9_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}