{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T03:44:30Z","timestamp":1776743070583,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642033551","type":"print"},{"value":"9783642033568","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03356-8_20","type":"book-chapter","created":{"date-parts":[[2009,8,18]],"date-time":"2009-08-18T14:00:39Z","timestamp":1250604039000},"page":"337-354","source":"Crossref","is-referenced-by-count":13,"title":["Solving Hidden Number Problem with One Bit Oracle and Advice"],"prefix":"10.1007","author":[{"given":"Adi","family":"Akavia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","unstructured":"Akavia, A.: Learning Noisy Characters, Multiplication Codes and Cryptographic Hardcore Predicates. Ph.D dissertation, defended August 2007, MIT, EECS (February 2008)"},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1109\/SFCS.2003.1238189","volume-title":"Proc. of 44th IEEE Annual Symposium on Foundations of Computer Science (FOCS 2003)","author":"A. Akavia","year":"2003","unstructured":"Akavia, A., Goldwasser, S., Safra, S.: Proving Hard-Core Predicates using List Decoding. In: Proc. of 44th IEEE Annual Symposium on Foundations of Computer Science (FOCS 2003), pp. 146\u2013157. IEEE Computer Society, Los Alamitos (2003)"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Akavia, A.: Finding significant fourier coefficients deterministically and locally. ECCC Report TR08-102 (2008)","DOI":"10.1007\/978-0-387-30162-4_199"},{"key":"20_CR4","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":"20_CR5","unstructured":"Boneh, D., Venkatesan, R.: Rounding in lattices and its cryptographic applications. In: SODA: ACM-SIAM Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms) (1997)"},{"key":"20_CR6","first-page":"152","volume-title":"Proc. of 34 ACM Annual Symposium on Theory of Computing (STOC 2002)","author":"A.C. Gilbert","year":"2002","unstructured":"Gilbert, A.C., Guha, S., Indyk, P., Muthukrishnan, S., Strauss, M.: Near-optimal sparse fourier representations via sampling. In: Proc. of 34 ACM Annual Symposium on Theory of Computing (STOC 2002), pp. 152\u2013161. ACM Press, New York (2002)"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Gilbert, A.C., Muthukrishnan, S., Strauss, M.: Improved time bounds for near-optimal sparse fourier representation via sampling. In: Proc. SPIE Wavelets XI (2005)","DOI":"10.1117\/12.615931"},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-0348-8295-8_19","volume-title":"Proc. Workshop on Cryptography and Computational Number Theory","author":"M.I. Gonz\u00e1lez-Vasco","year":"2001","unstructured":"Gonz\u00e1lez-Vasco, M.I., Shparlinski, I.: On the security of diffie-hellman bits. In: Proc. Workshop on Cryptography and Computational Number Theory, Singapore, pp. 257\u2013268. Birkh\u00e4user, Basel (2001)"},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W. Hoeffding","year":"1963","unstructured":"Hoeffding, W.: Probability inequalities for sums of bounded random variables. J. Amer. Stat. Assoc.\u00a058, 13\u201330 (1963)","journal-title":"J. Amer. Stat. Assoc."},{"key":"20_CR10","unstructured":"Iwen, M.A.: A deterministic sub-linear time sparse fourier algorithm via non-adaptive compressed sensing methods. CoRR, abs\/0708.1211 (2007)"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Iwen, M.A.: A deterministic sub-linear time sparse fourier algorithm via non-adaptive compressed sensing methods. In: SODA, pp. 20\u201329 (2008)","DOI":"10.1109\/CISS.2008.4558570"},{"issue":"6","key":"20_CR12","doi-asserted-by":"publisher","first-page":"1331","DOI":"10.1137\/0222080","volume":"22","author":"E. Kushilevitz","year":"1993","unstructured":"Kushilevitz, E., Mansour, Y.: Learning decision trees using the Fourier spectrum. SICOMP\u00a022(6), 1331\u20131348 (1993)","journal-title":"SICOMP"},{"issue":"4","key":"20_CR13","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A.K. Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra, H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Mathematische Annalen\u00a0261(4), 515\u2013534 (1982)","journal-title":"Mathematische Annalen"},{"key":"20_CR14","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. Shparlinski","year":"2004","unstructured":"Shparlinski, I., Winterhof, A.: A nonuniform algorithm for the hidden number problem in subgroups. In: Bao, F., Deng, R.H., Zhou, J. (eds.) PKC 2004. LNCS, vol.\u00a02947, pp. 416\u2013424. Springer, Heidelberg (2004)"},{"key":"20_CR15","doi-asserted-by":"publisher","first-page":"2073","DOI":"10.1090\/S0025-5718-05-01797-7","volume":"74","author":"I. Shparlinski","year":"2005","unstructured":"Shparlinski, I., Winterhof, A.: A hidden number problem in small subgroups. Math. Comp.\u00a074, 2073\u20132080 (2005)","journal-title":"Math. Comp."},{"key":"20_CR16","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511626265","volume-title":"Fourier Analysis on Finite Groups and Applications","author":"A. Terras","year":"1999","unstructured":"Terras, A.: Fourier Analysis on Finite Groups and Applications. Cambridge U. Press, Cambridge (1999)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - CRYPTO 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03356-8_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T02:10:06Z","timestamp":1558491006000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03356-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642033551","9783642033568"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03356-8_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}