{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T03:19:46Z","timestamp":1776827986933,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540223795","type":"print"},{"value":"9783540278009","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27800-9_32","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T23:00:38Z","timestamp":1283727638000},"page":"370-378","source":"Crossref","is-referenced-by-count":8,"title":["Secure Bilinear Diffie-Hellman Bits"],"prefix":"10.1007","author":[{"given":"Steven D.","family":"Galbraith","sequence":"first","affiliation":[]},{"given":"Herbie J.","family":"Hopkins","sequence":"additional","affiliation":[]},{"given":"Igor E.","family":"Shparlinski","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/978-3-540-40974-8_27","volume-title":"Cryptography and Coding","author":"S. Al-Riyami","year":"2003","unstructured":"Al-Riyami, S., Paterson, K.G.: Tripartite Authenticated Key Agreement Protocols from Pairings. In: Paterson, K.G. (ed.) Cryptography and Coding 2003. LNCS, vol.\u00a02898, pp. 332\u2013359. Springer, Heidelberg (2003)"},{"key":"32_CR2","doi-asserted-by":"crossref","first-page":"331","DOI":"10.4064\/aa-83-4-331-361","volume":"83","author":"R.C. Baker","year":"1998","unstructured":"Baker, R.C., Harman, G.: Shifted primes without large prime factors. Acta Arithm.\u00a083, 331\u2013361 (1998)","journal-title":"Acta Arithm."},{"key":"32_CR3","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/S0097539701398521","volume":"32","author":"D. Boneh","year":"2003","unstructured":"Boneh, D., Franklin, M.: Identity-based encryption from theWeil pairing. SIAM J. Comp.\u00a032, 586\u2013615 (2003)","journal-title":"SIAM J. Comp."},{"key":"32_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/3-540-45682-1_3","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"D. Boneh","year":"2001","unstructured":"Boneh, D., Halevi, S., Howgrave-Graham, N.A.: The modular inversion hidden number problem. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 36\u201351. Springer, Heidelberg (2001)"},{"key":"32_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/3-540-44647-8_12","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"D. Boneh","year":"2001","unstructured":"Boneh, D., Shparlinski, I.E.: On the unpredictability of bits of the elliptic curve Diffie\u2013Hellman scheme. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 201\u2013212. Springer, Heidelberg (2001)"},{"key":"32_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/3-540-68697-5_11","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"D. Boneh","year":"1996","unstructured":"Boneh, D., Venkatesan, R.: Hardness of computing the most significant bits of secret keys in Diffie\u2013Hellman and related schemes. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 129\u2013142. Springer, Heidelberg (1996)"},{"key":"32_CR7","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, 865\u2013874 (1994)","journal-title":"Math. Comp."},{"key":"32_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/3-540-45682-1_29","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"S.D. Galbraith","year":"2001","unstructured":"Galbraith, S.D.: Supersingular curves in cryptography. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 495\u2013513. Springer, Heidelberg (2001)"},{"key":"32_CR9","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s00145-001-0007-6","volume":"14","author":"M. Goldman","year":"2001","unstructured":"Goldman, M., N\u00e4slund, M., Russell, A.: Complexity bounds on general hard-core predicates. J. Cryptology\u00a014, 177\u2013195 (2001)","journal-title":"J. Cryptology"},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"Gonz\u00e1lez Vasco, M.I., N\u00e4slund, M.: A survey of hard core functions. In: Proc. Workshop on Cryptography and Computational Number Theory, Singapore, Birkh\u00e4user, pp. 227\u2013256 (1999)","DOI":"10.1007\/978-3-0348-8295-8_18"},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"Gonz\u00e1lez Vasco, M.I., Shparlinski, I.E.: On the security of Diffie\u2013Hellman bits. In: Proc. Workshop on Cryptography and Computational Number Theory, Singapore, Birkh\u00e4user, pp. 257\u2013268 (1999)","DOI":"10.1007\/978-3-0348-8295-8_19"},{"key":"32_CR12","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1090\/S0025-5718-01-01358-8","volume":"71","author":"M.I. Gonz\u00e1lez Vasco","year":"2002","unstructured":"Gonz\u00e1lez Vasco, M.I., Shparlinski, I.E.: Security of the most significant bits of the Shamir message passing scheme. Math. Comp.\u00a071, 333\u2013342 (2002)","journal-title":"Math. Comp."},{"key":"32_CR13","unstructured":"H\u00e5stad, J., N\u00e4slund, M.: The security of individual RSA and discrete log bits. J. of the ACM (to appear)"},{"key":"32_CR14","doi-asserted-by":"publisher","first-page":"1473","DOI":"10.1090\/S0025-5718-03-01495-9","volume":"72","author":"N.A. Howgrave-Graham","year":"2003","unstructured":"Howgrave-Graham, N.A., Nguyen, P.Q., Shparlinski, I.E.: Hidden number problem with hidden multipliers, timed-release crypto and noisy exponentiation. Math. Comp.\u00a072, 1473\u20131485 (2003)","journal-title":"Math. Comp."},{"key":"32_CR15","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\u2013Hellman. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol.\u00a01838, pp. 385\u2013393. Springer, Heidelberg (2000)"},{"key":"32_CR16","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. In: Fieker, C., Kohel, D.R. (eds.) ANTS 2002. LNCS, vol.\u00a02369, pp. 20\u201332. Springer, Heidelberg (2002)"},{"key":"32_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/3-540-45708-9_28","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"W.-C.W. Li","year":"2002","unstructured":"Li, W.-C.W., N\u00e4slund, M., Shparlinski, I.E.: The hidden number problem with the trace and bit security of XTR and LUC. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 433\u2013448. Springer, Heidelberg (2002)"},{"key":"32_CR18","volume-title":"Finite fields","author":"R. Lidl","year":"1997","unstructured":"Lidl, R., Niederreiter, H.: Finite fields. Cambridge University Press, Cambridge (1997)"},{"key":"32_CR19","unstructured":"Miller, V.: Short programs for functions on curves (1986) (preprint)"},{"key":"32_CR20","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.: \u2018Reducing elliptic curve logarithms to logarithms in a finite field\u2019. IEEE Trans. Inf. Theory\u00a039, 1639\u20131646 (1993)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"32_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/3-540-45708-9_22","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"K. Rubin","year":"2002","unstructured":"Rubin, K., Silverberg, A.: Supersingular abelian varieties in cryptology. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 336\u2013353. Springer, Heidelberg (2002)"},{"key":"32_CR22","unstructured":"Sakai, R., Ohgishi, K., Kasahara, M.: Cryptosystems based on pairing. In: Proc. of SCIS 2000, Okinawa, Japan (2000)"},{"key":"32_CR23","unstructured":"Schnorr, C.P.: Security of almost all discrete log bits. Electronic Colloq. on Comp. Compl., Univ. of Trier, TR98-033, 1\u201313 (1998)"},{"key":"32_CR24","doi-asserted-by":"crossref","unstructured":"Scott, M., Barreto, P.S.L.M.: Compressed pairings. Cryptology ePrint Archive, Report 2004\/032","DOI":"10.1007\/978-3-540-28628-8_9"},{"key":"32_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/3-540-45624-4_28","volume-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","author":"I.E. Shparlinski","year":"2001","unstructured":"Shparlinski, I.E.: On the generalized hidden number problem and bit security of XTR. In: Bozta, S., Sphparlinski, I. (eds.) AAECC 2001. LNCS, vol.\u00a02227, pp. 268\u2013277. Springer, Heidelberg (2001)"},{"key":"32_CR26","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1049\/el:20020387","volume":"38","author":"N.P. Smart","year":"2002","unstructured":"Smart, N.P.: An identity based authenticated key agreement protocol based on the Weil pairing. Electronics Letters\u00a038, 630\u2013632 (2002)","journal-title":"Electronics Letters"},{"key":"32_CR27","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)"}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27800-9_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:21:21Z","timestamp":1605759681000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27800-9_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540223795","9783540278009"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27800-9_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}