{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:59:25Z","timestamp":1742997565343,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319174693"},{"type":"electronic","value":"9783319174709"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-17470-9_15","type":"book-chapter","created":{"date-parts":[[2015,4,3]],"date-time":"2015-04-03T06:09:35Z","timestamp":1428041375000},"page":"250-268","source":"Crossref","is-referenced-by-count":3,"title":["The Multivariate Hidden Number Problem"],"prefix":"10.1007","author":[{"given":"Steven D.","family":"Galbraith","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barak","family":"Shani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","unstructured":"Akavia, A.: Learning Noisy Characters, Multiplication Codes and Hardcore Predicates. Ph.D. Thesis, Massachusetts Institute of Technology (2008)"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-642-03356-8_20","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"A. Akavia","year":"2009","unstructured":"Akavia, A.: Solving Hidden Number Problem with One Bit Oracle and Advice. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.\u00a05677, pp. 337\u2013354. Springer, Heidelberg (2009)"},{"key":"15_CR3","first-page":"146","volume-title":"FOCS 2003","author":"A. Akavia","year":"2003","unstructured":"Akavia, A., Goldwasser, S., Safra, S.: Proving Hard-Core Predicates Using List Decoding. In: FOCS 2003, pp. 146\u2013157. IEEE Computer Society, Washington (2003)"},{"issue":"2","key":"15_CR4","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.P.: RSA and Rabin Functions: Certain Parts are as Hard as the Whole. SIAM Journal on Computing\u00a017(2), 194\u2013209 (1988)","journal-title":"SIAM Journal on Computing"},{"key":"15_CR5","first-page":"421","volume-title":"STOC 1983","author":"M. Ben-Or","year":"1983","unstructured":"Ben-Or, M., Chor, B., Shamir, A.: On the Cryptographic Security of Single RSA Bits. In: Johnson, D.S., Fagin, R., Fredman, M.L., Harel, D., Karp, R.M., Lynch, N.A., Papadimitriou, C.H., Rivest, R.L., Ruzzo, W.L., Seiferas, J.I. (eds.) STOC 1983, pp. 421\u2013430. ACM, New York (1983)"},{"key":"15_CR6","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":"15_CR7","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.\u00a01109, pp. 129\u2013142. Springer, Heidelberg (1996)"},{"key":"15_CR8","unstructured":"Boneh, D., and Venkatesan, R.: Rounding in Lattices and its Cryptographic Applications. In: Saks, M.E. (ed.) SODA 1997, pp. 675\u2013681. ACM\/SIAM, Philadelphia (1997)"},{"key":"15_CR9","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.\u00a07417, pp. 832\u2013849. Springer, Heidelberg (2012)"},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/978-3-642-40349-1_25","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2013","author":"E. De Mulder","year":"2013","unstructured":"De Mulder, E., Hutter, M., Marson, M.E., Pearson, P.: Using Bleichenbacher\u201ds Solution to the Hidden Number Problem to Attack Nonce Leaks in 384-Bit ECDSA. In: Bertoni, G., Coron, J.-S. (eds.) CHES 2013. LNCS, vol.\u00a08086, pp. 435\u2013452. Springer, Heidelberg (2013)"},{"key":"15_CR11","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":"E.R. 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.\u00a01751, pp. 258\u2013275. Springer, Heidelberg (2000)"},{"key":"15_CR12","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.\u00a08043, pp. 148\u2013165. Springer, Heidelberg (2013)"},{"key":"15_CR13","first-page":"25","volume-title":"STOC 1989","author":"O. Goldreich","year":"1989","unstructured":"Goldreich, O., Levin, L.A.: A Hard-Core Predicate for all One-Way Functions. In: Johnson, D.S. (ed.) STOC 1989, pp. 25\u201332. ACM, New York (1989)"},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-662-45611-8_14","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"D.F. Aranha","year":"2014","unstructured":"Aranha, D.F., Fouque, P.-A., G\u00e9rard, B., Kammerer, J.-G., Tibouchi, M., Zapalowicz, J.-C.: GLV\/GLS Decomposition, Power Analysis, and Attacks on ECDSA Signatures with Single-Bit Nonce Bias. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol.\u00a08873, pp. 262\u2013281. Springer, Heidelberg (2014)"},{"key":"15_CR15","first-page":"455","volume-title":"STOC 1991","author":"E. Kushilevitz","year":"1991","unstructured":"Kushilevitz, E., Mansour, Y.: Learning Decision Trees Using the Fourier Sprectrum. In: Koutsougeras, C., Vitter, J.S. (eds.) STOC 1991, pp. 455\u2013464. ACM, New York (1991)"},{"key":"15_CR16","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.\u00a05443, pp. 15\u201333. Springer, Heidelberg (2009)"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Mansour, Y.: Learning Boolean Functions via the Fourier Transform. In: Roychowdhury, V., Siu, K.Y., Orlitsky, A. (eds.) Theoretical Advances in Neural Computation and Learning, pp. 391\u2013424. Kluwer Academic Publishers (1994)","DOI":"10.1007\/978-1-4615-2696-4_11"},{"key":"15_CR18","unstructured":"Shparlinski, I.: Playing \u201cHide-and-Seek\u201d in Finite Fields: Hidden Number Problem and its Applications. In: Proceedings of the Seventh Spanish Meeting on Cryptology and Information Security, vol.\u00a01, pp. 49\u201372. University of Oviedo (2002)"},{"key":"15_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/978-3-540-24632-9_30","volume-title":"Public Key Cryptography \u2013 PKC 2004","author":"I.E. Shparlinski","year":"2004","unstructured":"Shparlinski, I.E., Winterhof, A.: A Nonuniform Algorithm for the Hidden Number Problem in Subgroups. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol.\u00a02947, pp. 416\u2013424. Springer, Heidelberg (2004)"},{"key":"15_CR20","unstructured":"Wang, M., Zhan, T., and Zhang, H.: Bits Security of the CDH Problems over Finite Fields. Cryptology ePrint Archive, Report 2014\/685 (2014), \n                      http:\/\/eprint.iacr.org\/2014\/685"}],"container-title":["Lecture Notes in Computer Science","Information Theoretic Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-17470-9_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T07:28:20Z","timestamp":1676446100000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-17470-9_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319174693","9783319174709"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-17470-9_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}