{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:49:27Z","timestamp":1743151767843,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319027258"},{"type":"electronic","value":"9783319027265"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-02726-5_28","type":"book-chapter","created":{"date-parts":[[2013,10,30]],"date-time":"2013-10-30T13:39:17Z","timestamp":1383140357000},"page":"393-403","source":"Crossref","is-referenced-by-count":1,"title":["Generation and Tate Pairing Computation of Ordinary Elliptic Curves with Embedding Degree One"],"prefix":"10.1007","author":[{"given":"Zhi","family":"Hu","sequence":"first","affiliation":[]},{"given":"Lin","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Maozhi","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Guoliang","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1090\/S0025-5718-1993-1199989-X","volume":"61","author":"A.O.L. Atkin","year":"1993","unstructured":"Atkin, A.O.L., Morain, F.: Elliptic Curves and Primality Proving. Math. Comput.\u00a061, 29\u201368 (1993)","journal-title":"Math. Comput."},{"key":"28_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-540-30576-7_18","volume-title":"Theory of Cryptography","author":"D. Boneh","year":"2005","unstructured":"Boneh, D., Goh, E.J., Nissim, K.: Evaluating 2-DNF Formulas on Ciphertexts. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 325\u2013341. Springer, Heidelberg (2005)"},{"issue":"5","key":"28_CR3","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1016\/j.jnt.2010.05.001","volume":"131","author":"D. Boneh","year":"2011","unstructured":"Boneh, D., Rubin, K., Silverberg, A.: Finding Composite Order Ordinary Elliptic Curves Using the Cocks-Pinch Method. J. Number Theor.\u00a0131(5), 832\u2013841 (2011)","journal-title":"J. Number Theor."},{"key":"28_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/11761679_34","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"D. Boneh","year":"2006","unstructured":"Boneh, D., Sahai, A., Waters, B.: Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 573\u2013592. Springer, Heidelberg (2006)"},{"key":"28_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/11761679_26","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"X. Boyen","year":"2006","unstructured":"Boyen, X., Waters, B.: Compact Group Signatures without Random Oracles. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 427\u2013444. Springer, Heidelberg (2006)"},{"key":"28_CR6","unstructured":"Charles, D.: On the Existence of Distortion Maps on Ordinary Elliptic Curves. Cryptology ePrint Archive Report 2006\/128, http:\/\/eprint.iacr.org\/2006\/128\/"},{"key":"28_CR7","first-page":"865","volume":"62","author":"G. Frey","year":"1994","unstructured":"Frey, G., R\u00fcck, H.: A Remark Concerning m-divisibility and The Discrete Logarithm in The Divisor Class Group of Curves. Math. Comp.\u00a062, 865\u2013874 (1994)","journal-title":"Math. Comp."},{"key":"28_CR8","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. J. Cryptol.\u00a023, 224\u2013280 (2010)","journal-title":"J. Cryptol."},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Galbraith, S.D.: Pairings-Advanced in Elliptic Curve Cryptography. In: Blake, I.F., Seroussi, G., Smart, N.P. (eds.) Cambridge Univ. Press, Cambridge (2005)","DOI":"10.1017\/CBO9780511546570.011"},{"key":"28_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-540-78967-3_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"J. Groth","year":"2008","unstructured":"Groth, J., Sahai, A.: Efficient Non-interactive Proof Systems for Bilinear Groups. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 415\u2013432. Springer, Heidelberg (2008)"},{"key":"28_CR11","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.H.: 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":"28_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/978-3-540-89754-5_31","volume-title":"Progress in Cryptology - INDOCRYPT 2008","author":"S. Ionica","year":"2008","unstructured":"Ionica, S., Joux, A.: Another Approach to Pairing Computation in Edwards Coordinates. In: Chowdhury, D.R., Rijmen, V., Das, A. (eds.) INDOCRYPT 2008. LNCS, vol.\u00a05365, pp. 400\u2013413. Springer, Heidelberg (2008)"},{"key":"28_CR13","unstructured":"Ionica, S.: Algorithmique des couplages et cryptographie. PhD thesis of the Versailles Saint-Quentin-en-Yvelines University (2010)"},{"key":"28_CR14","unstructured":"Keller, S.: The RSA Validation System (November 9, 2004)"},{"key":"28_CR15","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.J.: 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)"},{"key":"28_CR16","unstructured":"Koblitz N.: A Security Weakness in Composite Order Pairing Based Protocols with Embedding Degree k\u2009>\u20092. Cryptology ePrint Archive Report 2010\/227, http:\/\/eprint.iacr.org\/2010\/227\/"},{"key":"28_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/978-3-642-29011-4_20","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"A. Lewko","year":"2012","unstructured":"Lewko, A.: Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol.\u00a07237, pp. 318\u2013335. Springer, Heidelberg (2012)"},{"issue":"5","key":"28_CR18","doi-asserted-by":"publisher","first-page":"1639","DOI":"10.1109\/18.259647","volume":"39","author":"A.J. Menezes","year":"1993","unstructured":"Menezes, A.J., Okamoto, T., Vanstone, S.A.: Reducing Elliptic Curve Logarithms to Logarithms in a Finite Field. IEEE Trans. Inf. Theory.\u00a039(5), 1639\u20131646 (1993)","journal-title":"IEEE Trans. Inf. Theory."},{"key":"28_CR19","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. J. Cryptol.\u00a017, 235\u2013261 (2004)","journal-title":"J. Cryptol."},{"key":"28_CR20","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/s10623-009-9287-x","volume":"52","author":"D. Moody","year":"2009","unstructured":"Moody, D.: The Diffie-Hellman Problem and Generalization of Verheuls Theorem. Des. Codes Cryptogr.\u00a052, 381\u2013390 (2009)","journal-title":"Des. Codes Cryptogr."},{"key":"28_CR21","unstructured":"The RSA Challenge Numbers, http:\/\/www.rsa.com\/rsalabs\/node.asp?id=2093"},{"key":"28_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-642-34961-4_6","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"J.H. Seo","year":"2012","unstructured":"Seo, J.H.: On the (Im)possibility of Projecting Property in Prime-Order Setting. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol.\u00a07658, pp. 61\u201379. Springer, Heidelberg (2012)"},{"key":"28_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-540-71677-8_12","volume-title":"Public Key Cryptography \u2013 PKC 2007","author":"H. Shacham","year":"2007","unstructured":"Shacham, H., Waters, B.: Efficient Ring Signatures without Random Oracles. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol.\u00a04450, pp. 166\u2013180. Springer, Heidelberg (2007)"},{"key":"28_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-1920-8","volume-title":"The Arithmetic of Elliptic Curves","author":"J. Silverman","year":"1986","unstructured":"Silverman, J.: The Arithmetic of Elliptic Curves. Springer, New York (1986)"},{"key":"28_CR25","series-title":"Lecture Notes in Math.","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-540-38509-7_5","volume-title":"Modular Functions of One Variable I","author":"H.M. Stark","year":"1973","unstructured":"Stark, H.M.: Class Numbers of Complex Quadratic Fields. In: Kuyk, W. (ed.) Modular Functions of One Variable I. Lecture Notes in Math., vol.\u00a0320, pp. 153\u2013174. Springer, New York (1973)"},{"issue":"273","key":"28_CR26","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1090\/S0025-5718-2010-02373-7","volume":"80","author":"A. Sutherland","year":"2011","unstructured":"Sutherland, A.: Computing Hilbert class polynomials with the Chinese Remainder Theorem. Math. Comput.\u00a080(273), 501\u2013538 (2011)","journal-title":"Math. Comput."},{"key":"28_CR27","first-page":"238","volume":"273","author":"J. V\u00e9lu","year":"1971","unstructured":"V\u00e9lu, J.: Isog\u00e9nies entre courbes elliptiques. C.R. Acad. Sc. Paris, S\u00e9rie A\u00a0273, 238\u2013241 (1971)","journal-title":"C.R. Acad. Sc. Paris, S\u00e9rie A"},{"key":"28_CR28","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s00145-004-0313-x","volume":"17","author":"R. Verheul","year":"2004","unstructured":"Verheul, R.: Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems. J. Cryptol.\u00a017, 277\u2013296 (2004)","journal-title":"J. Cryptol."},{"key":"28_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-642-38236-9_26","volume-title":"Theory and Applications of Models of Computation","author":"H. Wu","year":"2013","unstructured":"Wu, H., Feng, R.: Efficient Self-pairing on Ordinary Elliptic Curves. In: Chan, T.-H.H., Lau, L.C., Trevisan, L. (eds.) TAMC 2013. LNCS, vol.\u00a07876, pp. 282\u2013293. Springer, Heidelberg (2013)"},{"key":"28_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-642-25516-8_19","volume-title":"Cryptography and Coding","author":"X.S. Zhang","year":"2011","unstructured":"Zhang, X.S., Lin, D.D.: Efficient Pairing Computation on Ordinary Elliptic Curves of Embedding Degree 1 and 2. In: Chen, L. (ed.) IMACC 2011. LNCS, vol.\u00a07089, pp. 309\u2013326. Springer, Heidelberg (2011)"},{"issue":"5","key":"28_CR31","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.G., Xie, D.Q.: Fast Computation of Self-pairings. IEEE Trans. Inf. Theory\u00a058(5), 3266\u20133272 (2012)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Lecture Notes in Computer Science","Information and Communications Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-02726-5_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,11]],"date-time":"2022-03-11T02:22:30Z","timestamp":1646965350000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-02726-5_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319027258","9783319027265"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-02726-5_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}