{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:12:56Z","timestamp":1725491576863},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540734888"},{"type":"electronic","value":"9783540734895"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73489-5_18","type":"book-chapter","created":{"date-parts":[[2007,9,11]],"date-time":"2007-09-11T08:58:06Z","timestamp":1189501086000},"page":"317-328","source":"Crossref","is-referenced-by-count":8,"title":["On Pairing Inversion Problems"],"prefix":"10.1007","author":[{"given":"Takakazu","family":"Satoh","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s001459900040","volume":"11","author":"R. Balasubramanian","year":"1998","unstructured":"Balasubramanian, R., Koblitz, N.: The improbability that an elliptic curve has subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm. J. Cryptology\u00a011, 141\u2013145 (1998)","journal-title":"J. Cryptology"},{"key":"18_CR2","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. Barreto","year":"2002","unstructured":"Barreto, P., Kim, H.Y., Lynn, B., Scott, M.: Efficient algorithm for pairing-based cryptosystems. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 354\u2013368. Springer, Heidelberg (2002)"},{"key":"18_CR3","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.D., \u00d3\u2019h\u00c9igeartaigh, C., Scott, M.: Efficient pairing computation on supersingular Abelian varieties. Des. Codes Crypt.\u00a042, 239\u2013271 (2007)","journal-title":"Des. Codes Crypt."},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/11693383_22","volume-title":"Selected Areas in Cryptography","author":"P.S.L.M. Barreto","year":"2006","unstructured":"Barreto, P.S.L.M., Naehrig, M.: Pairing-friendly elliptic curves of prime order. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol.\u00a03897, pp. 319\u2013331. Springer, Heidelberg (2006)"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s10623-004-3808-4","volume":"37","author":"F. Brezing","year":"2005","unstructured":"Brezing, F., Weng, A.: Elliptic curves suitable for pairing based cryptography. Des. Codes Crypt.\u00a037, 133\u2013141 (2005)","journal-title":"Des. Codes Crypt."},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/3-540-45325-3_32","volume-title":"Cryptography and Coding","author":"C. Cocks","year":"2001","unstructured":"Cocks, C.: Identity based encryption scheme based on quadratic residues. In: Honary, B. (ed.) Cryptography and Coding. LNCS, vol.\u00a02260, pp. 360\u2013363. Springer, Heidelberg (2001)"},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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.: Tate pairing implementation for hyperellipitc curves y 2\u2009=\u2009x p \u2212\u2009x\u2009+\u2009d. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol.\u00a02894, pp. 111\u2013123. Springer, Heidelberg (2003)"},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T. ElGamal","year":"1985","unstructured":"ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inform. Theory\u00a031, 469\u2013472 (1985)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1007\/11792086_32","volume-title":"Algorithmic Number Theory","author":"D. Freeman","year":"2006","unstructured":"Freeman, D.: Constructing pairing-friendly elliptic curves with embedding degree 10. In: Hess, F., Pauli, S., Pohst, M. (eds.) Algorithmic Number Theory. LNCS, vol.\u00a04076, pp. 452\u2013465. Springer, Heidelberg (2006)"},{"key":"18_CR10","unstructured":"Freeman, D., Scott, M., Teske, E.: A taxonomy of pairing-friendly elliptic curves. IACR e-print 2006\/372 (2006)"},{"key":"18_CR11","volume-title":"London math. soc. lect. note series","author":"S. Galbraith","year":"2005","unstructured":"Galbraith, S.: Pairings. Advances in elliptic curve cryptography, Chap. 9. In: Blake, I.F., Seroussi, G., Smart, N.P. (eds.) London math. soc. lect. note series, vol.\u00a0317, Cambridge University Press, Cambridge (2005)"},{"key":"18_CR12","unstructured":"Galbraith, S., Hess, F., Vercautern, F.: Aspects of Pairing inversion (manuscript, 2007)"},{"key":"18_CR13","unstructured":"Galbraith, S.D.: \u00d3h\u00c9igeartaigh, C., Sheedy, C.: Simplified pairing computation and security implications. J. Math. Crypt. (to appear)"},{"key":"18_CR14","doi-asserted-by":"crossref","first-page":"4995","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. on IT\u00a052, 4995\u20134602 (2006)","journal-title":"IEEE trans. on IT"},{"key":"18_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1007\/978-3-540-73489-5_16","volume-title":"On the minimal embedding field","author":"L. Hitt","year":"2007","unstructured":"Hitt, L.: On the minimal embedding field. LNCS, vol.\u00a04575, pp. 294\u2013301. Springer, Heidelberg (2007)"},{"key":"18_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/10722028_23","volume-title":"Algorithmic Number Theory 4","author":"A. Joux","year":"2000","unstructured":"Joux, A.: A one round protocol for tripartite Diffie-Hellman. In: Bosma, W. (ed.) Algorithmic Number Theory 4. LNCS, vol.\u00a01838, pp. 385\u2013393. Springer, Heidelberg (2000)"},{"key":"18_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/3-540-45455-1_3","volume-title":"Algorithmic Number Theory","author":"A. Joux","year":"2002","unstructured":"Joux, A.: The Weil and Tate pairings as building blocks for public key cryptosystems (survey). In: Fieker, C., Kohel, D.R. (eds.) Algorithmic Number Theory. LNCS, vol.\u00a02369, pp. 20\u201332. Springer, Heidelberg (2002)"},{"key":"18_CR18","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1017\/S0004972700036042","volume":"69","author":"E. Kiltz","year":"2004","unstructured":"Kiltz, E., Winterhof, A.: On the interpolation of bivariate polynomials related to the Diffie-Hellman mapping. Bull. Austral. Math. Soc.\u00a069, 305\u2013315 (2004)","journal-title":"Bull. Austral. Math. Soc."},{"key":"18_CR19","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. LNCS, vol.\u00a03796, pp. 13\u201336. Springer, Heidelberg (2005)"},{"key":"18_CR20","unstructured":"Lange, T.: Open problems in pairing. In: Slides at IPAM workshop Number theory and cryptography \u2013 open problems (2006), available from https:\/\/www.ipam.ucla.edu\/programs\/scws1\/"},{"key":"18_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/3-540-45655-4_16","volume-title":"Computing and Combinatorics","author":"T. Lange","year":"2002","unstructured":"Lange, T., Winterhof, A.: Polynomial interpolation of the elliptic curve and XTR discrete logarithm. In: Ibarra, O.H., Zhang, L. (eds.) COCOON 2002. LNCS, vol.\u00a02387, pp. 137\u2013143. Springer, Heidelberg (2002)"},{"key":"18_CR22","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/S0166-218X(02)00445-6","volume":"128","author":"T. Lange","year":"2003","unstructured":"Lange, T., Winterhof, A.: Interpolation of the discrete logarithm in F q by boolean functions and by polynomials in several variables modulo a divisor of q\u2009\u2212\u20091. Discrete Appl. Math.\u00a0128, 193\u2013206 (2003)","journal-title":"Discrete Appl. Math."},{"key":"18_CR23","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/s00145-006-0544-0","volume":"19","author":"F. Luca","year":"2006","unstructured":"Luca, F., Shparlinski, I.: Elliptic curves with low embedding degree. J. Cryptology\u00a019, 553\u2013562 (2006)","journal-title":"J. Cryptology"},{"key":"18_CR24","doi-asserted-by":"publisher","first-page":"1689","DOI":"10.1137\/S0097539796302749","volume":"28","author":"U.M. Maurer","year":"1999","unstructured":"Maurer, U.M., Wolf, S.: The relationship between breaking the Diffie-Hellman protocol and computing discrete logarithms. SIAM J. Comput.\u00a028, 1689\u20131721 (1999)","journal-title":"SIAM J. Comput."},{"key":"18_CR25","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1023\/A:1008302122286","volume":"19","author":"U.M. Maurer","year":"2000","unstructured":"Maurer, U.M., Wolf, S.: The Diffie-Hellman protocol. Des. Codes Cryptogr.\u00a019, 147\u2013171 (2000)","journal-title":"Des. Codes Cryptogr."},{"key":"18_CR26","first-page":"80","volume-title":"Proc. 23rd annual ACM symp. on theory of computing","author":"A. Menezes","year":"1991","unstructured":"Menezes, A., Vanstone, S., Okamoto, T.: Reducing elliptic curve logarithms to logarithms in a finite field. In: Proc. 23rd annual ACM symp. on theory of computing, pp. 80\u201389. ACM press, New York (1991)"},{"key":"18_CR27","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. Info. Theory\u00a039, 1639\u20131646 (1993)","journal-title":"IEEE Trans. Info. Theory"},{"key":"18_CR28","unstructured":"Miller, V.: Short programs for functions on curves (1986), preprint available at http:\/\/crypto.stanford.edu\/miller\/miller.pdf"},{"key":"18_CR29","first-page":"1234","volume":"E84","author":"A. Miyaji","year":"2002","unstructured":"Miyaji, A., Nakabayashi, M., Takano, S.: New explicit conditions of elliptic curve traces for FR-reduction. IEICE Trans. Fundamentals\u00a0E84, 1234\u20131243 (2002)","journal-title":"IEICE Trans. Fundamentals"},{"key":"18_CR30","doi-asserted-by":"crossref","unstructured":"Satoh, T.: On degrees of polynomial interpolations releated to elliptic curves. In: Ytrehus, \u00d8 (ed.) WCC 2005. LNCS, vol.\u00a03969, pp. 155\u2013163. Springer, Heidelberg (2006)","DOI":"10.1007\/11779360_13"},{"key":"18_CR31","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1112\/S1461157000001224","volume":"9","author":"T. Satoh","year":"2006","unstructured":"Satoh, T.: On polynomial interpolations related to Verheul homomorphisms. LMS J. Comput. Math\u00a09, 135\u2013158 (2006)","journal-title":"LMS J. Comput. Math"},{"key":"18_CR32","unstructured":"Semaev, I.A.: Bystry\u012d algorytm bychisleniya sparivaniya A. Ve\u012dlya na \u00e8llipticheskikh kribykh (A fast algorithm for computing the Weil pairing on elliptic curves). Mezhdu narodnaya konferentsiya Sovremennye problemy teorii chisel, Rossiya, Tula, 20 sentyabrya \u2013 25 sentyabrya 1993 goda. In: International conference Modern Problems in Number Theory, Russia, Tula, September 20 \u2013 September 25, 1993, 142 (abstract, in russian) (1993)"},{"key":"18_CR33","doi-asserted-by":"crossref","unstructured":"Silverman, J.H.: The arithmetic of elliptic curves. GTM, p. 106. Springer, Heidelberg (1985)","DOI":"10.1007\/978-1-4757-1920-8"},{"key":"18_CR34","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 cryptosystem. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 195\u2013210. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Pairing-Based Cryptography \u2013 Pairing 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73489-5_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:15:40Z","timestamp":1605762940000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73489-5_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540734888","9783540734895"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73489-5_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}