{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T02:48:00Z","timestamp":1725504480951},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540785231"},{"type":"electronic","value":"9783540785248"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78524-8_33","type":"book-chapter","created":{"date-parts":[[2008,2,25]],"date-time":"2008-02-25T09:18:12Z","timestamp":1203931092000},"page":"607-625","source":"Crossref","is-referenced-by-count":4,"title":["Saving Private Randomness in One-Way Functions and Pseudorandom Generators"],"prefix":"10.1007","author":[{"given":"Nenad","family":"Dedi\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny","family":"Harnik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leonid","family":"Reyzin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"33_CR1","doi-asserted-by":"crossref","unstructured":"Blum, M., Micali, S.: How to generate cryptographically strong sequences of pseudo random bits. In: 23rd FOCS, pp. 112\u2013117 (1982)","DOI":"10.1109\/SFCS.1982.72"},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"Carter, I., Wegman, M.: Universal classes of hash functions. In: 9th ACM Symposium on Theory of Computing, pp. 106\u2013112 (1977)","DOI":"10.1145\/800105.803400"},{"key":"33_CR3","unstructured":"Dedi\u0107, N., Harnik, D., Reyzin, L.: Saving private randomness in one-way functions and pseudorandom generators. Technical Report 2007\/458, Cryptology e-print archive (2007), http:\/\/eprint.iacr.org"},{"key":"33_CR4","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Smith, A.: Correcting errors without leaking partial information. In: 37th STOC, pp. 654\u2013663 (2005)","DOI":"10.1145\/1060590.1060688"},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Impagliazzo, R., Levin, L., Venkatesan, R., Zuckerman, D.: Security preserving amplification of hardness. In: 31st IEEE Symposium on Foundations of Computer Science, pp. 318\u2013326 (1990)","DOI":"10.1109\/FSCS.1990.89550"},{"issue":"6","key":"33_CR6","doi-asserted-by":"publisher","first-page":"1163","DOI":"10.1137\/0222069","volume":"22","author":"O. Goldreich","year":"1993","unstructured":"Goldreich, O., Krawczyk, H., Luby, M.: On the existence of pseudorandom generators. SIAM Journal of Computing\u00a022(6), 1163\u20131175 (1993)","journal-title":"SIAM Journal of Computing"},{"key":"33_CR7","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: 21st ACM Symposium on the Theory of Computing, pp. 25\u201332 (1989)","DOI":"10.1145\/73007.73010"},{"key":"33_CR8","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography","author":"O. Goldreich","year":"2001","unstructured":"Goldreich, O.: Foundations of Cryptography. Cambridge University Press, Cambridge (2001)"},{"key":"33_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/11787006_20","volume-title":"Automata, Languages and Programming","author":"I. Haitner","year":"2006","unstructured":"Haitner, I., Harnik, D., Reingold, O.: Efficient pseudorandom generators from exponentially hard one-way functions. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04052, pp. 228\u2013239. Springer, Heidelberg (2006)"},{"key":"33_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/11818175_2","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"I. Haitner","year":"2006","unstructured":"Haitner, I., Harnik, D., Reingold, O.: On the power of the randomized iterate. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 22\u201340. Springer, Heidelberg (2006)"},{"issue":"4","key":"33_CR11","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"29","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 of Computing\u00a029(4), 1364\u20131396 (1999)","journal-title":"SIAM Journal of Computing"},{"key":"33_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/3-540-48071-4_29","volume-title":"Advances in Cryptology - CRYPTO 1992","author":"A. Herzberg","year":"1993","unstructured":"Herzberg, A., Luby, M.: Pubic randomness in cryptography. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol.\u00a0740, pp. 421\u2013432. Springer, Heidelberg (1993)"},{"key":"33_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/11681878_23","volume-title":"Theory of Cryptography","author":"T. Holenstein","year":"2006","unstructured":"Holenstein, T.: Pseudorandom generators from one-way functions: A simple construction for any hardness. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol.\u00a03876, pp. 443\u2013461. Springer, Heidelberg (2006)"},{"key":"33_CR14","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Nisan, N., Wigderson, A.: Pseudorandomness for network algorithms. In: 26th STOC, pp. 356\u2013364 (1994)","DOI":"10.1145\/195058.195190"},{"issue":"1","key":"33_CR15","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1137\/0215020","volume":"15","author":"L.A. Levin","year":"1986","unstructured":"Levin, L.A.: Average case complete problems. SIAM Journal on Computing\u00a015(1), 285\u2013286 (1986)","journal-title":"SIAM Journal on Computing"},{"key":"33_CR16","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, 357\u2013363 (1987)","journal-title":"Combinatorica"},{"issue":"3","key":"33_CR17","first-page":"1102","volume":"58","author":"L.A. Levin","year":"1993","unstructured":"Levin, L.A.: Randomness and nondeterminism. The Journal of Symbolic Logic\u00a058(3), 1102\u20131103 (1993)","journal-title":"The Journal of Symbolic Logic"},{"issue":"4","key":"33_CR18","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/BF01305237","volume":"12","author":"N. Nisan","year":"1992","unstructured":"Nisan, N.: Pseudorandom generators for space-bounded computation. Combinatorica\u00a012(4), 449\u2013461 (1992)","journal-title":"Combinatorica"},{"issue":"4","key":"33_CR19","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1137\/0222053","volume":"22","author":"J. Naor","year":"1993","unstructured":"Naor, J., Naor, M.: Small-bias probability spaces: Efficient constructions and applications. SIAM Journal on Computing\u00a022(4), 838\u2013856 (1993)","journal-title":"SIAM Journal on Computing"},{"key":"33_CR20","doi-asserted-by":"crossref","unstructured":"Wegman, M., Carter, J.: New hash functions and their use in authentication and set equality. Journal of Computer and System Sciences (1981)","DOI":"10.1016\/0022-0000(81)90033-7"},{"key":"33_CR21","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Theory and application of trapdoor functions. In: 23rd IEEE Symposium on Foundations of Computer Science, pp. 80\u201391 (1982)","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78524-8_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:12:09Z","timestamp":1619521929000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78524-8_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540785231","9783540785248"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78524-8_33","relation":{},"subject":[]}}