{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:58:09Z","timestamp":1725566289987},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540226680"},{"type":"electronic","value":"9783540286288"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-28628-8_5","type":"book-chapter","created":{"date-parts":[[2010,9,20]],"date-time":"2010-09-20T16:54:02Z","timestamp":1285001642000},"page":"73-91","source":"Crossref","is-referenced-by-count":5,"title":["Complete Classification of Bilinear Hard-Core Functions"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Holenstein","sequence":"first","affiliation":[]},{"given":"Ueli","family":"Maurer","sequence":"additional","affiliation":[]},{"given":"Johan","family":"Sj\u00f6din","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"5_CR1","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1137\/0217013","volume":"17","author":"W. Alexi","year":"1988","unstructured":"Alexi, W., Chor, B., Golreich, O., Schnorr, C.P.: RSA and Rabin functions: Certain parts are as hard as the whole. Siam Journal on Computation\u00a017(2), 194\u2013209 (1988)","journal-title":"Siam Journal on Computation"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Akavia, A., Goldwasser, S., Safra, S.: Proving hard-core predicates using list decoding. In: The 44th Annual Symposium on Foundations of Computer Science, pp. 146\u2013157 (2003)","DOI":"10.1109\/SFCS.2003.1238189"},{"issue":"4","key":"5_CR3","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 pseudo-random bits. Siam Journal on Computation\u00a013(4), 850\u2013864 (1984)","journal-title":"Siam Journal on Computation"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, pp. 25\u201332 (1989)","DOI":"10.1145\/73007.73010"},{"key":"5_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography","author":"O. Goldreich","year":"2001","unstructured":"Goldreich, O.: Basic Tools. In: Goldreich, O. (ed.) Foundations of Cryptography, 1st edn., Cambridge University Press, Cambridge (2001)","edition":"1"},{"issue":"4","key":"5_CR6","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1137\/S0895480198344540","volume":"13","author":"O. Goldreich","year":"2000","unstructured":"Goldreich, O., Rubinfeld, R., Sudan, M.: Learning polynomials with queries: The highly noisy case. Siam Journal on Discrete Mathematics\u00a013(4), 535\u2013570 (2000)","journal-title":"Siam Journal on Discrete Mathematics"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Trevisan, L.: Trevisan Lower bounds on the efficiency of generic cryptographic constructions. In: The 41st Annual Symposium on Foundations of Computer Science, pp. 305\u2013313 (2000)","DOI":"10.1109\/SFCS.2000.892119"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/3-540-39200-9_12","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"G. Hast","year":"2003","unstructured":"Hast, G.: Nearly one-sided tests and the Goldreich-Levin predicate. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 195\u2013210. Springer, Heidelberg (2003)"},{"issue":"4","key":"5_CR9","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J. H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. Siam Journal on Computation\u00a028(4), 1364\u20131396 (1999)","journal-title":"Siam Journal on Computation"},{"issue":"4","key":"5_CR10","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BF02579323","volume":"7","author":"L.A. Levin","year":"1987","unstructured":"Levin, L.A.: One-way functions and pseudorandom generators. Combinatorica\u00a07(4), 357\u2013363 (1987)","journal-title":"Combinatorica"},{"key":"5_CR11","doi-asserted-by":"crossref","DOI":"10.1515\/9780691206844","volume-title":"Pseudorandomness and Cryptographic Applications","author":"M. Luby","year":"1996","unstructured":"Luby, M.: Pseudorandomness and Cryptographic Applications, 1st edn. Princeton University Press, Princeton (1996)","edition":"1"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1007\/3-540-49264-X_29","volume-title":"Advances in Cryptology - EUROCRYPT \u201995","author":"M. N\u00e4slund","year":"1995","unstructured":"N\u00e4slund, M.: Universal hash functions & hard core bits. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol.\u00a0921, pp. 356\u2013366. Springer, Heidelberg (1995)"},{"key":"5_CR13","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 mod p are hard. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 114\u2013128. Springer, Heidelberg (1996)"},{"issue":"2","key":"5_CR14","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1006\/jcss.2000.1730","volume":"62","author":"M. Sudan","year":"2001","unstructured":"Sudan, M., Trevisan, L., Pseudorandom, S.V.: generators without the XOR lemma. Journal of Computer and System Sciences\u00a062(2), 236\u2013266 (2001)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"5_CR15","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1145\/346048.346049","volume":"31","author":"M. Sudan","year":"2000","unstructured":"Sudan, M.: List decoding: Algorithms and applications. SIGACTN: SIGACT News (ACM Special Interest Group on Automata and Computability Theory\u00a031(1), 16\u201327 (2000)","journal-title":"SIGACTN: SIGACT News (ACM Special Interest Group on Automata and Computability Theory"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Theory and applications of trapdoor functions (extended abstract). In: The 23rd Annual Symposium on Foundations of Computer Science, pp. 80\u201391 (1982)","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-28628-8_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T23:27:49Z","timestamp":1619998069000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-28628-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540226680","9783540286288"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-28628-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}