{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T06:44:14Z","timestamp":1761979454690,"version":"build-2065373602"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642420443"},{"type":"electronic","value":"9783642420450"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-42045-0_14","type":"book-chapter","created":{"date-parts":[[2013,11,23]],"date-time":"2013-11-23T08:53:33Z","timestamp":1385196813000},"page":"261-279","source":"Crossref","is-referenced-by-count":5,"title":["Pseudorandom Generators from Regular One-Way Functions: New Constructions with Improved Parameters"],"prefix":"10.1007","author":[{"given":"Yu","family":"Yu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiangxue","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Weng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","unstructured":"Workshop on leakage, tampering and viruses (June 2013), http:\/\/www.crypto.edu.pl\/events\/workshop2013"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/978-3-540-45198-3_18","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"B. Barak","year":"2003","unstructured":"Barak, B., Shaltiel, R., Wigderson, A.: Computational analogues of entropy. In: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (eds.) RANDOM 2003 and APPROX 2003. LNCS, vol.\u00a02764, pp. 200\u2013215. Springer, Heidelberg (2003)"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Blum, M., Micali, S.: How to generate cryptographically strong sequences of pseudo random bits. In: Proceedings of the 23rd IEEE Symposium on Foundation of Computer Science, pp. 112\u2013117 (1982)","DOI":"10.1109\/SFCS.1982.72"},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"J.L. Carter","year":"1979","unstructured":"Carter, J.L., Wegman, M.N.: Universal classes of hash functions. Journal of Computer and System Sciences\u00a018, 143\u2013154 (1979)","journal-title":"Journal of Computer and System Sciences"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1007\/978-3-540-78524-8_33","volume-title":"Theory of Cryptography","author":"N. Dedi\u0107","year":"2008","unstructured":"Dedi\u0107, N., Harnik, D., Reyzin, L.: Saving private randomness in one-way functions and pseudorandom generators. In: Canetti, R. (ed.) TCC 2008. LNCS, vol.\u00a04948, pp. 607\u2013625. Springer, Heidelberg (2008)"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-540-27821-4_30","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"Y. Dodis","year":"2004","unstructured":"Dodis, Y., Elbaz, A., Oliveira, R., Raz, R.: Improved randomness extraction from two independent sources. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) RANDOM 2004 and APPROX 2004. LNCS, vol.\u00a03122, pp. 334\u2013344. Springer, Heidelberg (2004)"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Foundations of Cryptography: Basic Tools. Cambridge University Press (2001)","DOI":"10.1017\/CBO9780511546891"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-642-22670-0_22","volume-title":"Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation","author":"O. Goldreich","year":"2011","unstructured":"Goldreich, O.: Three XOR-lemmas \u2014 an exposition. In: Goldreich, O. (ed.) Studies in Complexity and Cryptography. LNCS, vol.\u00a06650, pp. 248\u2013272. Springer, Heidelberg (2011)"},{"issue":"6","key":"14_CR9","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 on Computing\u00a022(6), 1163\u20131175 (1993)","journal-title":"SIAM Journal on Computing"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: Johnson, D.S. (ed.) Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, Seattle, Washington, May 15-17, pp. 25\u201332 (1989)","DOI":"10.1145\/73007.73010"},{"key":"14_CR11","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":"6","key":"14_CR12","doi-asserted-by":"publisher","first-page":"1486","DOI":"10.1137\/080721820","volume":"40","author":"I. Haitner","year":"2011","unstructured":"Haitner, I., Harnik, D., Reingold, O.: On the power of the randomized iterate. SIAM Journal on Computing\u00a040(6), 1486\u20131528 (2011)","journal-title":"SIAM Journal on Computing"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Haitner, I., Reingold, O., Vadhan, S.P.: Efficiency improvements in constructing pseudorandom generators from one-way functions. In: Proceedings of the 42nd ACM Symposium on the Theory of Computing, pp. 437\u2013446 (2010)","DOI":"10.1145\/1806689.1806750"},{"issue":"4","key":"14_CR14","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.: Construction of pseudorandom generator from any one-way function. SIAM Journal on Computing\u00a028(4), 1364\u20131396 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"14_CR15","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":"14_CR16","doi-asserted-by":"crossref","unstructured":"Holenstein, T., Sinha, M.: Constructing a pseudorandom generator requires an almost linear Number of calls. In: Proceedings of the 53rd IEEE Symposium on Foundation of Computer Science, pp. 698\u2013707 (2012)","DOI":"10.1109\/FOCS.2012.51"},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-540-72540-4_10","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"C.-Y. Hsiao","year":"2007","unstructured":"Hsiao, C.-Y., Lu, C.-J., Reyzin, L.: Conditional computational entropy, or toward separating pseudoentropy from compressibility. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515, pp. 169\u2013186. Springer, Heidelberg (2007)"},{"issue":"6","key":"14_CR18","doi-asserted-by":"publisher","first-page":"2224","DOI":"10.1109\/TIT.2005.847746","volume":"51","author":"C.-J. Lee","year":"2005","unstructured":"Lee, C.-J., Lu, C.-J., Tsai, S.-C., Tzeng, W.-G.: Extracting randomness from multiple independent sources. IEEE Transactions on Information Theory\u00a051(6), 2224\u20132227 (2005)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"14_CR19","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"},{"issue":"4","key":"14_CR20","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":"1","key":"14_CR21","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1006\/jcss.1996.0004","volume":"52","author":"N. Nisan","year":"1996","unstructured":"Nisan, N., Zuckerman, D.: Randomness is linear in space. Journal of Computer and System Sciences\u00a052(1), 43\u201353 (1996)","journal-title":"Journal of Computer and System Sciences"},{"key":"14_CR22","first-page":"3","volume":"42","author":"D.R. Stinson","year":"2002","unstructured":"Stinson, D.R.: Universal hash families and the leftover hash lemma, and applications to cryptography and computing. Journal of Combinatorial Mathematics and Combinatorial Computing\u00a042, 3\u201331 (2002), http:\/\/www.cacr.math.uwaterloo.ca\/~dstinson\/publist.html","journal-title":"Journal of Combinatorial Mathematics and Combinatorial Computing"},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"Vadhan, S.P., Zheng, C.J.: Characterizing pseudoentropy and simplifying pseudorandom generator constructions. In: Proceedings of the 44th ACM Symposium on the Theory of Computing, pp. 817\u2013836 (2012)","DOI":"10.1145\/2213977.2214051"},{"key":"14_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-642-40041-4_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"S.P. Vadhan","year":"2013","unstructured":"Vadhan, S.P., Zheng, C.J.: A uniform min-max theorem with applications in cryptography. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part I. LNCS, vol.\u00a08042, pp. 93\u2013110. Springer, Heidelberg (2013)"},{"key":"14_CR25","doi-asserted-by":"crossref","unstructured":"Vazirani, U.V., Vazirani, V.V.: Efficient and secure pseudo-random number generation (extended abstract). In: Proceedings of the 25th IEEE Symposium on Foundation of Computer Science, pp. 458\u2013463 (1984)","DOI":"10.1109\/SFCS.1984.715948"},{"key":"14_CR26","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: Theory and applications of trapdoor functions (extended abstract). In: Proceedings of the 23rd IEEE Symposium on Foundation of Computer Science, pp. 80\u201391 (1982)","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - ASIACRYPT 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-42045-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T22:54:41Z","timestamp":1746053681000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-42045-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642420443","9783642420450"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-42045-0_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}