{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:05:12Z","timestamp":1725552312101},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540302766"},{"type":"electronic","value":"9783540324188"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11586821_26","type":"book-chapter","created":{"date-parts":[[2005,11,3]],"date-time":"2005-11-03T09:48:40Z","timestamp":1131011320000},"page":"392-409","source":"Crossref","is-referenced-by-count":9,"title":["Pairings on Elliptic Curves over Finite Commutative Rings"],"prefix":"10.1007","author":[{"given":"Steven D.","family":"Galbraith","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James F.","family":"McKee","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":"213","DOI":"10.1007\/3-540-44647-8_13","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"D. Boneh","year":"2001","unstructured":"Boneh, D., Franklin, M.: Identity-based encryption from the Weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 213\u2013229. Springer, Heidelberg (2001)"},{"issue":"4","key":"26_CR2","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s00145-004-0314-9","volume":"17","author":"D. Boneh","year":"2004","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. J. Crypt\u00a017(4), 297\u2013319 (2004)","journal-title":"J. Crypt"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Cassels, J.W.S.: Lectures on Elliptic Curves. LMS Student Texts, Cambridge, vol.\u00a024 (1991)","DOI":"10.1017\/CBO9781139172530"},{"key":"26_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1007\/3-540-48285-7_4","volume-title":"Advances in Cryptology - EUROCRYPT \u201993","author":"N. Demytko","year":"1994","unstructured":"Demytko, N.: A new elliptic curve based analogue of RSA. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol.\u00a0765, pp. 40\u201349. Springer, Heidelberg (1994)"},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"865","DOI":"10.2307\/2153546","volume":"52","author":"G. Frey","year":"1994","unstructured":"Frey, G., R\u00fcck, H.-G.: A remark concerning m-divisibility and the discrete logarithm problem in the divisor class group of curves. Math. Comp.\u00a052, 865\u2013874 (1994)","journal-title":"Math. Comp."},{"key":"26_CR6","doi-asserted-by":"publisher","first-page":"1717","DOI":"10.1109\/18.771254","volume":"45","author":"G. Frey","year":"1999","unstructured":"Frey, G., M\u00fcller, M., R\u00fcck, H.-G.: The Tate pairing and the discrete logarithm applied to elliptic curve cryptosystems. IEEE Trans. Inf. Th.\u00a045, 1717\u20131719 (1999)","journal-title":"IEEE Trans. Inf. Th."},{"issue":"2","key":"26_CR7","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/s00145-001-0015-6","volume":"15","author":"S.D. Galbraith","year":"2002","unstructured":"Galbraith, S.D.: Elliptic curve Paillier schemes. J. Crypt.\u00a015(2), 129\u2013138 (2002)","journal-title":"J. Crypt."},{"key":"26_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/3-540-45455-1_26","volume-title":"Algorithmic Number Theory","author":"S.D. Galbraith","year":"2002","unstructured":"Galbraith, S.D., Harrison, K., Soldera, D.: Implementing the Tate pairing. In: Fieker, C., Kohel, D.R. (eds.) ANTS 2002. LNCS, vol.\u00a02369, pp. 324\u2013337. Springer, Heidelberg (2002)"},{"key":"26_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1007\/3-540-46877-3_44","volume-title":"Advances in Cryptology - EUROCRYPT \u201990","author":"M. Girault","year":"1991","unstructured":"Girault, M.: An Identity-Based Identification Scheme Based on Discrete Logarithms Modulo a Composite Number. In: Damg\u00e5rd, I.B. (ed.) EUROCRYPT 1990. LNCS, vol.\u00a0473, pp. 481\u2013486. Springer, Heidelberg (1991)"},{"key":"26_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/10722028_23","volume-title":"Algorithmic Number Theory","author":"A. Joux","year":"2000","unstructured":"Joux, A.: A One Round Protocol for Tripartite Diffie-Hellman. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol.\u00a01838, pp. 385\u2013394. Springer, Heidelberg (2000)"},{"key":"26_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/BFb0054116","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"N. Kunihiro","year":"1998","unstructured":"Kunihiro, N., Koyama, K.: Equivalence of counting the number of points on elliptic curve over the ring Z_n and factoring n. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 47\u201358. Springer, Heidelberg (1998)"},{"key":"26_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1007\/3-540-46766-1_20","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"K. Koyama","year":"1992","unstructured":"Koyama, K., Maurer, U.M., Okamoto, T., Vanstone, S.A.: New public-key schemes based on elliptic curves over the ring Z\n                           \n                    n\n                  . In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 252\u2013266. Springer, Heidelberg (1992)"},{"key":"26_CR13","doi-asserted-by":"publisher","first-page":"649","DOI":"10.2307\/1971363","volume":"126","author":"H.W. Lenstra Jr.","year":"1987","unstructured":"Lenstra Jr., H.W.: Factoring integers with elliptic curves. Annals of Mathematics\u00a0126, 649\u2013673 (1987)","journal-title":"Annals of Mathematics"},{"key":"26_CR14","unstructured":"Lenstra Jr., H.W.: Elliptic curves and number theoretic algorithms. In: Proc. International Congr. Math., pp. 99\u2013120. AMS, Berkeley (1986\/1988)"},{"key":"26_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1007\/3-540-44750-4_6","volume-title":"Advances in Cryptology - CRYPTO \u201995","author":"C.H. Lim","year":"1995","unstructured":"Lim, C.H., Lee, P.J.: Security and performance of server-aided RSA computation protocols. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol.\u00a0963, pp. 70\u201383. Springer, Heidelberg (1995)"},{"key":"26_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/3-540-48892-8_8","volume-title":"Selected Areas in Cryptography","author":"W. Mao","year":"1999","unstructured":"Mao, W.: Verifiable partial sharing of integer factors. In: Tavares, S., Meijer, H. (eds.) SAC 1998. LNCS, vol.\u00a01556, pp. 94\u2013105. Springer, Heidelberg (1999)"},{"key":"26_CR17","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/S0893-9659(00)00159-2","volume":"14","author":"S. Martin","year":"2001","unstructured":"Martin, S., Morillo, P., Villar, J.L.: Computing the order of points on an elliptic curve modulo N is as difficult as factoring N. Applied Math. Letters\u00a014, 341\u2013346 (2001)","journal-title":"Applied Math. Letters"},{"issue":"2","key":"26_CR18","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1112\/S0024610799007334","volume":"59","author":"J.F. McKee","year":"1999","unstructured":"McKee, J.F.: Subtleties in the distribution of the numbers of points on elliptic curves over a finite prime field. J. London Math. Soc. (2)\u00a059, 448\u2013460 (1999)","journal-title":"J. London Math. Soc"},{"key":"26_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/3-540-61581-4_57","volume-title":"Algorithmic Number Theory","author":"J.F. McKee","year":"1996","unstructured":"McKee, J.F., Pinch, R.G.E.: Old and new deterministic factoring algorithms. In: Cohen, H. (ed.) ANTS 1996. LNCS, vol.\u00a01122, pp. 217\u2013224. Springer, Heidelberg (1996)"},{"key":"26_CR20","unstructured":"McKee, J.F., Pinch, R.G.E.: Further attacks on server-aided RSA cryptosystems (1998) (unpublished manuscript)"},{"key":"26_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/3-540-68339-9_5","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"B. Meyer","year":"1996","unstructured":"Meyer, B., Mueller, V.: A public key cryptosystem based on elliptic curves over Z \/n\n                           Z equivalent to factoring. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 49\u201359. Springer, Heidelberg (1996)"},{"key":"26_CR22","unstructured":"Miller, V.S.: Short programs for functions on curves (1986) (unpublished manuscript)"},{"issue":"4","key":"26_CR23","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. Crypt.\u00a017(4), 235\u2013261 (2004)","journal-title":"J. Crypt."},{"key":"26_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1007\/BFb0054153","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"T. Okamoto","year":"1998","unstructured":"Okamoto, T., Uchiyama, S.: Security of an identity-based cryptosystem and the related reductions. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 546\u2013560. Springer, Heidelberg (1998)"},{"key":"26_CR25","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/BF01933667","volume":"15","author":"J.M. Pollard","year":"1975","unstructured":"Pollard, J.M.: A Monte Carlo method for factorisation. BIT\u00a015, 331\u2013334 (1975)","journal-title":"BIT"},{"key":"26_CR26","doi-asserted-by":"publisher","first-page":"918","DOI":"10.2307\/2006496","volume":"32","author":"J.M. Pollard","year":"1978","unstructured":"Pollard, J.M.: Monte Carlo methods for index computations (mod p). Math. Comp.\u00a032, 918\u2013924 (1978)","journal-title":"Math. Comp."},{"key":"26_CR27","unstructured":"Rabin, M.O.: Digitalized signatures and public-key functions as intractable as factorization, Technical report TR-212. MIT Laboratory for Computer Science (1979)"},{"key":"26_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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.\u00a03152, pp. 140\u2013156. Springer, Heidelberg (2004)"},{"key":"26_CR29","doi-asserted-by":"crossref","unstructured":"Shanks, D.: Class number, a theory of factorisation and genera. In: Lewis, D.J. (ed.) Number theory institute 1969, Proceedings of symposia in pure mathematics, Providence RI, vol.\u00a020, pp. 415\u2013440. AMS (1971)","DOI":"10.1090\/pspum\/020\/0316385"},{"key":"26_CR30","unstructured":"Turk, J.W.M.: Fast arithmetic operations on numbers and polynomials. In: Lenstra Jr., H.W., Tijdeman, R. (eds.) Computational methods in number theory, Part 1, Mathematical Centre Tracts, vol.\u00a0154, Amsterdam (1984)"},{"issue":"4","key":"26_CR31","doi-asserted-by":"publisher","first-page":"1231","DOI":"10.1109\/18.605586","volume":"43","author":"S.A. Vanstone","year":"1997","unstructured":"Vanstone, S.A., Zuccherato, R.J.: Elliptic curve cryptosystems using curves of smooth order over the ring Z\n                           \n                    n\n                  . IEEE Trans. Inform. Theory\u00a043(4), 1231\u20131237 (1997)","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Lecture Notes in Computer Science","Cryptography and Coding"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11586821_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:47:18Z","timestamp":1619506038000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11586821_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540302766","9783540324188"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/11586821_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}