{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:23:05Z","timestamp":1725495785429},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540633846"},{"type":"electronic","value":"9783540695288"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"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":[[1997]]},"DOI":"10.1007\/bfb0052224","type":"book-chapter","created":{"date-parts":[[2006,8,17]],"date-time":"2006-08-17T18:37:31Z","timestamp":1155839851000},"page":"1-15","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The complexity of computing hard core predicates"],"prefix":"10.1007","author":[{"given":"Mikael","family":"Goldmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mats","family":"N\u00c4slund","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,17]]},"reference":[{"issue":"no2","key":"1_CR1","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1137\/0217013","volume":"17","author":"W. Alexi","year":"1988","unstructured":"W. Alexi, B. Chor, O. Goldreich, and C. P. Schnorr: RSA and Rabin Functions: Certain Parts Are as Hard as the Whole. SIAM J. on Computing 17 (1988), no 2, pp. 194\u2013209.","journal-title":"SIAM J. on Computing"},{"key":"1_CR2","unstructured":"P. Beame: A Switching Lemma Primer. Manuscript, 1994."},{"issue":"no4","key":"1_CR3","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1986","unstructured":"M. Blum and S. Micali: How to Generate Cryptographically Strong Sequences of Pseudorandom Bits. SIAM J. on Computing 13 (1986), no 4, pp. 850\u2013864.","journal-title":"SIAM J. on Computing"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"M. Furst, J. Saxe, and M. Sipser: Parity, Circuits, and the Polynomial Time Hierarchy. Proc. 22nd Symposium on Foundations of Computer Science, IEEE, 1981, pp. 260\u2013270.","DOI":"10.1109\/SFCS.1981.35"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"O. Goldreich and L. A. Levin: A Hard Core Predicate for all One Way Functions. Proc. 21st Symposium on Theory of Computing, ACM, 1989, pp. 25\u201332.","DOI":"10.1145\/73007.73010"},{"key":"1_CR6","unstructured":"J. H\u00e5stad: Computational Limitations of Small-Depth Circuits. ACM doctoral dissertation award, 1986. MIT Press 1987."},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1016\/0022-0000(93)90038-X","volume":"47","author":"J. H\u00e5stad","year":"1993","unstructured":"J. H\u00e5stad, A. W. Schrift, and A. Shamir: The Discrete Logarithm Modulo a Composite Hides O(n) Bits. J. of Computer and System Sciences 47 (1993), pp. 376\u2013403.","journal-title":"J. of Computer and System Sciences"},{"issue":"no4","key":"1_CR8","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s001459900012","volume":"9","author":"R. Impagliazzo","year":"1996","unstructured":"R. Impagliazzo and M. Naor: Efficient Cryptographic Schemes Provably as Secure as Subset Sum. J. of Cryptology 9 (1996), no 4, pp. 199\u2013216.","journal-title":"J. of Cryptology"},{"issue":"no3","key":"1_CR9","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. J. of the ACM 40 (1993), no 3, pp. 607\u2013620.","journal-title":"J. of the ACM"},{"key":"1_CR10","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 (1993), pp. 121\u2013133.","journal-title":"Theoretical Computer Science"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"M. N\u00c4slund: Universal Hash Functions & Hard Core Bits. Proc. Eurocrypt 1995, LNCS 921, Springer Verlag, pp. 356\u2013366.","DOI":"10.1007\/3-540-49264-X_29"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"M. N\u00c4slund: All Bits in ax+b mod p are Hard. Proc. Crypto 1996, LNCS 1109, Springer Verlag, pp. 114\u2013128.","DOI":"10.1007\/3-540-68697-5_10"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"A. C. Yao: Theory and Applications of Trapdoor Functions. Proc. 23rd Symposium on Foundations of Computer Science, IEEE, 1982, pp. 80\u201391.","DOI":"10.1109\/SFCS.1982.45"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"A. C. Yao: Separating the Polynomial-Time Hierarchy by Oracles. Proc. 26th Symposium on Foundations of Computer Science, IEEE, 1985, pp. 1\u201310.","DOI":"10.1109\/SFCS.1985.49"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO '97"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0052224","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,30]],"date-time":"2020-01-30T03:22:27Z","timestamp":1580354547000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0052224"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540633846","9783540695288"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0052224","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"17 May 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}