{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T21:40:10Z","timestamp":1748814010458,"version":"3.41.0"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319313009"},{"type":"electronic","value":"9783319313016"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-31301-6_25","type":"book-chapter","created":{"date-parts":[[2016,3,18]],"date-time":"2016-03-18T21:11:22Z","timestamp":1458335482000},"page":"441-461","source":"Crossref","is-referenced-by-count":1,"title":["Bit Security of the CDH Problems over Finite Fields"],"prefix":"10.1007","author":[{"given":"Mingqiang","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tao","family":"Zhan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haibin","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Akavia, A., Goldwasser, S., Safra, S.: Proving hard-core predicates using list decoding. In: FOCS, pp. 146\u2013157. IEEE Computer Society (2003)","DOI":"10.1109\/SFCS.2003.1238189"},{"issue":"2","key":"25_CR2","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1137\/0217013","volume":"17","author":"W Alexi","year":"1988","unstructured":"Alexi, W., Chor, B., Goldreich, O., Schnorr, C.: RSA and Rabin functions: certain parts are as hard as the whole. SIAM J. Comput. 17(2), 194\u2013209 (1988)","journal-title":"SIAM J. Comput."},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Ben-Or, M.: Probabilistic algorithms in finite fields. In: FOCS 1981, vol. 11, pp. 394\u2013398 (1981)","DOI":"10.1109\/SFCS.1981.37"},{"issue":"4","key":"25_CR4","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M Blum","year":"1984","unstructured":"Blum, M., Micali, S.: How to generate cryptographically strong sequences of pseudorandom bits. SIAM J. Comput. 13(4), 850\u2013864 (1984)","journal-title":"SIAM J. Comput."},{"key":"25_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-Hellman scheme. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 201\u2013212. Springer, Heidelberg (2001)"},{"key":"25_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-Hellman and related schemes. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 129\u2013142. Springer, Heidelberg (1996)"},{"issue":"6","key":"25_CR7","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.: New directions in cryptography. IEEE Trans. Inf. Theor. 22(6), 644\u2013654 (1976)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"25_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1007\/978-3-642-32009-5_48","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"A Duc","year":"2012","unstructured":"Duc, A., Jetchev, D.: Hardness of computing individual bits for one-way functions on elliptic curves. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 832\u2013849. Springer, Heidelberg (2012)"},{"issue":"4","key":"25_CR9","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"IT\u201331","author":"T ElGamal","year":"1985","unstructured":"ElGamal, T.: A public-key cryptosystem, a signature scheme based on discrete logarithms. IEEE Trans. Inf. Theor. IT\u201331(4), 469\u2013472 (1985)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"25_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-642-40084-1_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"N Fazio","year":"2013","unstructured":"Fazio, N., Gennaro, R., Perera, I.M., Skeith III, W.E.: Hard-core predicates for a Diffie-Hellman problem over finite fields. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part II. LNCS, vol. 8043, pp. 148\u2013165. Springer, Heidelberg (2013)"},{"key":"25_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1007\/978-3-319-17470-9_15","volume-title":"Information Theoretic Security","author":"SD Galbraith","year":"2015","unstructured":"Galbraith, S.D., Shani, B.: The multivariate hidden number problem. In: Lehmann, A., Wolf, S. (eds.) ICITS 2015. LNCS, vol. 9063, pp. 250\u2013268. Springer, Heidelberg (2015)"},{"key":"25_CR12","volume-title":"Modern Computer Algebra","author":"J Zur Gathen von","year":"1999","unstructured":"von Zur Gathen, J., Gerhard, J.: Modern Computer Algebra. Cambridge University Press, Cambridge (1999)"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: STOC, pp. 25\u201332. ACM Press (1989)","DOI":"10.1145\/73007.73010"},{"issue":"2","key":"25_CR14","first-page":"270","volume":"28","author":"S Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. JCSS 28(2), 270\u2013299 (1984)","journal-title":"JCSS"},{"key":"25_CR15","unstructured":"H\u00e5stad, J., N\u00e4slund, M.: The security of individual RSA bits. In: FOCS, pp. 510\u2013521 (1998)"},{"key":"25_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-3-662-43414-7_18","volume-title":"Selected Areas in Cryptography \u2013 SAC 2013","author":"A Joux","year":"2014","unstructured":"Joux, A.: A new index calculus algorithm with complexity L(1\/4 + o(1)) in small characteristic. In: Lange, T., Lauter, K., Lison\u011bk, P. (eds.) SAC 2013. LNCS, vol. 8282, pp. 355\u2013380. Springer, Heidelberg (2014)"},{"key":"25_CR17","volume-title":"Finite Fields","author":"R Lidl","year":"1983","unstructured":"Lidl, R., Niederreiter, H.: Finite Fields. Addison-Wesley, Reading (1983)"},{"key":"25_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-642-00468-1_2","volume-title":"Public Key Cryptography \u2013 PKC 2009","author":"P Morillo","year":"2009","unstructured":"Morillo, P., R\u00e0fols, C.: The security of all bits using list decoding. In: Jarecki, S., Tsudik, G. (eds.) PKC 2009. LNCS, vol. 5443, pp. 15\u201333. Springer, Heidelberg (2009)"},{"key":"25_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1007\/3-540-68697-5_10","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"M N\u00e4slund","year":"1996","unstructured":"N\u00e4slund, M.: All bits in $$ax+b$$ a x + b mod $$p$$ p are hard. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 114\u2013128. Springer, Heidelberg (1996)"},{"issue":"1","key":"25_CR20","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S1071-5797(03)00048-0","volume":"10","author":"IE Shparlinski","year":"2014","unstructured":"Shparlinski, I.E.: Security of polynomial transformations of the Diffie-Hellman key. Finite Fields Appl. 10(1), 123\u2013131 (2014)","journal-title":"Finite Fields Appl."},{"issue":"1","key":"25_CR21","first-page":"81","volume":"30","author":"A Slinko","year":"2001","unstructured":"Slinko, A.: A generalization of Koml\u00f3s\u2019s theorem on random matrices. N. Z. J. Math. 30(1), 81\u201386 (2001)","journal-title":"N. Z. J. Math."},{"key":"25_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-540-46588-1_18","volume-title":"Public Key Cryptography","author":"ER Verheul","year":"2000","unstructured":"Verheul, E.R.: Certificates of recoverability with scalable recovery agent security. In: Imai, H., Zheng, Y. (eds.) PKC 2000. LNCS, vol. 1751, pp. 258\u2013275. Springer, Heidelberg (2000)"},{"key":"25_CR23","unstructured":"Wang, M., Zhan, T., Zhang, H.: Bit security of the CDH problems over finite fields. Full version, Cryptology ePrint Archive: Report 2014\/685. http:\/\/eprint.iacr.org"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography \u2013 SAC 2015"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-31301-6_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T21:09:07Z","timestamp":1748812147000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-31301-6_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319313009","9783319313016"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-31301-6_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}