{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:41:25Z","timestamp":1743050485777,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540671411"},{"type":"electronic","value":"9783540465416"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46541-3_51","type":"book-chapter","created":{"date-parts":[[2007,8,2]],"date-time":"2007-08-02T16:03:24Z","timestamp":1186070604000},"page":"614-625","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Spectral Bounds on General Hard Core Predicates"],"prefix":"10.1007","author":[{"given":"Mikael","family":"Goldmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Russell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,3,24]]},"reference":[{"key":"51_CR1","unstructured":"H. Dym and H. P. McKean. Fourier Series and Integrals, volume 14 of Probability and Mathematical Statistics. Academic Press, 1972."},{"key":"51_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0052224","volume-title":"Advances in Cryptology\u2014CRYPTO\u2019 97","author":"M. Goldmann","year":"1997","unstructured":"M. Goldmann and M. N\u00e4slund. The complexity of computing hard core predicates. In B. S. Kaliski Jr., editor, Advances in Cryptology\u2014CRYPTO\u2019 97, volume 1294 of Lecture Notes in Computer Science, pages 1\u201315. Springer-Verlag, 17\u201320 Aug. 1997."},{"key":"51_CR3","doi-asserted-by":"crossref","unstructured":"O. Goldreich. Modern Cryptography, Probabilistic Proofs and Pseudorandomness. Springer-Verlag, 1999.","DOI":"10.1007\/978-3-662-12521-2"},{"key":"51_CR4","doi-asserted-by":"crossref","unstructured":"O. Goldreich and L. A. Levin. A hard-core predicate for all one-way functions. In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, pages 25\u201332, Seattle, Washington, 15\u201317 May 1989.","DOI":"10.1145\/73007.73010"},{"issue":"2","key":"51_CR5","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"S. Goldwasser and S. Micali. Probabilistic encryption. J. Comput. Syst. Sci., 28(2):270\u2013299, Apr. 1984.","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"51_CR6","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/BF01305949","volume":"14","author":"C. Gotsman","year":"1994","unstructured":"C. Gotsman and N. Linial. Spectral properties of threshold functions. Combinatorica, 14(1):35\u201350, 1994.","journal-title":"Combinatorica"},{"issue":"4","key":"51_CR7","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J. H\u00e5stad","year":"1998","unstructured":"J. H\u00e5stad, R. Impagliazzo, L. A. Levin, and M. Luby. Construction of a pseudorandom generator from any one-way function. SIAM J. Comp., 28(4):1364\u20131396, 1998.","journal-title":"SIAM J. Comp."},{"key":"51_CR8","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1109\/SFCS.1988.21923","volume-title":"29th Annual Symposium on Foundations of Computer Science","author":"J. Kahn","year":"1988","unstructured":"J. Kahn, G. Kalai, and N. Linial. The influence of variables on Boolean functions (extended abstract). In 29th Annual Symposium on Foundations of Computer Science, pages 68\u201380, White Plains, New York, 24\u201326 Oct. 1988. IEEE."},{"key":"51_CR9","unstructured":"N. Linial. Private communication. December, 1998."},{"issue":"3","key":"51_CR10","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1145\/174130.174138","volume":"40","author":"N. Linial","year":"1993","unstructured":"N. Linial, Y. Mansour, and N. Nisan. Constant depth circuits, Fourier transform, and learnability. Journal of the ACM, 40(3): 607\u2013620, 1993.","journal-title":"Journal of the ACM"},{"key":"51_CR11","doi-asserted-by":"crossref","unstructured":"M. Luby. Pseudorandomness and Cryptographic Applications. Princeton University Press, 1996.","DOI":"10.1515\/9780691206844"},{"issue":"1","key":"51_CR12","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0304-3975(93)90257-T","volume":"107","author":"Y. Mansour","year":"1993","unstructured":"Y. Mansour, N. Nisan, and P. Tiwari. The computational complexity of universal hashing. Theoretical Computer Science, 107(1):121\u2013133, 4 Jan. 1993.","journal-title":"Theoretical Computer Science"},{"key":"51_CR13","doi-asserted-by":"crossref","unstructured":"M. N\u00e4slund. Universal hash functions and hard core bits. In EUROCRYPT: Advances in Cryptology: Proceedings of EUROCRYPT, 1995.","DOI":"10.1007\/3-540-49264-X_29"},{"key":"51_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1007\/3-540-68697-5_10","volume-title":"Advances in Cryptology\u2014CRYPTO\u2019 96","author":"M. N\u00e4slund","year":"1996","unstructured":"M. N\u00e4slund. All bits in ax+b mod p are hard (extended abstract). In N. Koblitz, editor, Advances in Cryptology\u2014CRYPTO\u2019 96, volume 1109 of Lecture Notes in Computer Science, pages 114\u2013128. Springer-Verlag, 18\u201322 Aug. 1996."}],"container-title":["Lecture Notes in Computer Science","STACS 2000"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46541-3_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,25]],"date-time":"2020-04-25T15:35:41Z","timestamp":1587828941000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46541-3_51"}},"subtitle":["Extended Abstract"],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540671411","9783540465416"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-46541-3_51","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"24 March 2000","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}