{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T00:38:18Z","timestamp":1777250298445,"version":"3.51.4"},"publisher-location":"Cham","reference-count":54,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031587368","type":"print"},{"value":"9783031587375","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-58737-5_14","type":"book-chapter","created":{"date-parts":[[2024,4,27]],"date-time":"2024-04-27T07:01:52Z","timestamp":1714201312000},"page":"375-406","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Direct PRF Construction from\u00a0Kolmogorov Complexity"],"prefix":"10.1007","author":[{"given":"Yanyi","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rafael","family":"Pass","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,4,28]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Allender, E.: When worlds collide: Derandomization, lower bounds, and kolmogorov complexity. In: International Conference on Foundations of Software Technology and Theoretical Computer Science, pp. 1\u201315. Springer (2001)","DOI":"10.1007\/3-540-45294-X_1"},{"issue":"6","key":"14_CR2","doi-asserted-by":"publisher","first-page":"1467","DOI":"10.1137\/050628994","volume":"35","author":"E Allender","year":"2006","unstructured":"Allender, E., Buhrman, H., Kouck\u1ef3, M., Van Melkebeek, D., Ronneburger, D.: Power from random strings. SIAM J. Comput. 35(6), 1467\u20131493 (2006)","journal-title":"SIAM J. Comput."},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Banerjee, A., Peikert, C., Rosen, A.: Pseudorandom functions and lattices. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 719\u2013737. Springer (2012)","DOI":"10.1007\/978-3-642-29011-4_42"},{"key":"14_CR4","series-title":"Information Security and Cryptography","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-319-57048-8_3","volume-title":"Tutorials on the Foundations of Cryptography","author":"Andrej Bogdanov","year":"2017","unstructured":"Bogdanov, Andrej, Rosen, Alon: Pseudorandom functions: three decades later. In: Tutorials on the Foundations of Cryptography. ISC, pp. 79\u2013158. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57048-8_3"},{"key":"14_CR5","doi-asserted-by":"publisher","unstructured":"Canetti, R., Goldreich, O., Goldwasser, S., Micali, S.: Resettable zero-knowledge (extended abstract). In: STOC 2000, pp. 235\u2013244 (2000). https:\/\/doi.org\/10.1145\/335305.335334","DOI":"10.1145\/335305.335334"},{"key":"14_CR6","unstructured":"Carmosino, M.L., Impagliazzo, R., Kabanets, V., Kolokolova, A.: Learning algorithms from natural proofs. In: 31st Conference on Computational Complexity (CCC 2016). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2016)"},{"key":"14_CR7","unstructured":"Chen, L., Hirahara, S., Oliveira, I.C., Pich, J., Rajgopal, N., Santhanam, R.: Beyond natural proofs: Hardness magnification and locality. In: 11th Innovations in Theoretical Computer Science Conference (ITCS 2020). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Chen, L., Jin, C., Williams, R.R.: Hardness magnification for all sparse np languages. In: 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), pp. 1240\u20131255. IEEE (2019)","DOI":"10.1109\/FOCS.2019.00077"},{"key":"14_CR9","unstructured":"Chen, L., McKay, D.M., Murray, C.D., Williams, R.R.: Relations and equivalences between circuit lower bounds and karp-lipton theorems. In: 34th Computational Complexity Conference (CCC 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2019)"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Chen, L., Tell, R.: Bootstrapping results for threshold circuits \u201cjust beyond\u201d known lower bounds. In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, pp. 34\u201341 (2019)","DOI":"10.1145\/3313276.3316333"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Chen, L., Tell, R.: Hardness vs randomness, revised: uniform, non-black-box, and instance-wise. Electronic Colloquium on Computational Complexity (2021). https:\/\/eccc.weizmann.ac.il\/report\/2021\/080\/l","DOI":"10.1109\/FOCS52979.2021.00021"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Impagliazzo, R., Jaiswal, R., Kabanets, V.: Security amplification for interactive cryptographic primitives. In: Theory of Cryptography: 6th Theory of Cryptography Conference, TCC 2009, San Francisco, CA, USA, March 15-17, 2009. Proceedings 6, pp. 128\u2013145. Springer (2009)","DOI":"10.1007\/978-3-642-00457-5_9"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Foundations of Cryptography \u2014 Basic Tools. Cambridge University Press (2001)","DOI":"10.1017\/CBO9780511546891"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. In: FOCS (1984)","DOI":"10.1109\/SFCS.1984.715949"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: On the cryptographic applications of random functions. In: Advances in Cryptology: Proceedings of CRYPTO 84 4, pp. 276\u2013288. Springer (1985)","DOI":"10.1007\/3-540-39568-7_22"},{"key":"14_CR16","unstructured":"Goldreich, O., Nisan, N., Wigderson, A.: On yao\u2019s xor lemma. Technical Report TR95\u2013050, Electronic Colloquium on Computational Complexity (1995)"},{"issue":"3","key":"14_CR17","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1145\/233551.233553","volume":"43","author":"O Goldreich","year":"1996","unstructured":"Goldreich, O., Ostrovsky, R.: Software protection and simulation on oblivious rams. J. ACM 43(3), 431\u2013473 (1996)","journal-title":"J. ACM"},{"issue":"2","key":"14_CR18","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. J. Comput. Syst. Sci. 28(2), 270\u2013299 (1984)","journal-title":"J. Comput. Syst. Sci."},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Haitner, I., Harnik, D., Reingold, O.: On the power of the randomized iterate. In: CRYPTO, pp. 22\u201340 (2006)","DOI":"10.1007\/11818175_2"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Haitner, I., Reingold, O., Vadhan, S.: Efficiency improvements in constructing pseudorandom generators from one-way functions. In: Proceedings of the Forty-Second ACM Symposium on Theory of Computing, pp. 437\u2013446 (2010)","DOI":"10.1145\/1806689.1806750"},{"issue":"3","key":"14_CR21","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1002\/rsa.10095","volume":"23","author":"T Hartman","year":"2003","unstructured":"Hartman, T., Raz, R.: On the distribution of the number of roots of polynomials and explicit weak designs. Random Struct. Algorithms 23(3), 235\u2013263 (2003)","journal-title":"Random Struct. Algorithms"},{"key":"14_CR22","doi-asserted-by":"publisher","unstructured":"Hartmanis, J.: Generalized kolmogorov complexity and the structure of feasible computations. In: 24th Annual Symposium on Foundations of Computer Science (sfcs 1983). pp. 439\u2013445, November 1983. https:\/\/doi.org\/10.1109\/SFCS.1983.21","DOI":"10.1109\/SFCS.1983.21"},{"issue":"4","key":"14_CR23","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 J. Comput. 28(4), 1364\u20131396 (1999)","journal-title":"SIAM J. Comput."},{"key":"14_CR24","doi-asserted-by":"crossref","unstructured":"Hirahara, S.: Non-black-box worst-case to average-case reductions within NP. In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, pp. 247\u2013258 (2018)","DOI":"10.1109\/FOCS.2018.00032"},{"key":"14_CR25","doi-asserted-by":"crossref","unstructured":"Holenstein, T.: Pseudorandom generators from one-way functions: a simple construction for any hardness. In: TCC, pp. 443\u2013461 (2006)","DOI":"10.1007\/11681878_23"},{"key":"14_CR26","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Wigderson, A.: P = BPP if e requires exponential circuits: Derandomizing the xor lemma. In: STOC 1997, pp. 220\u2013229 (1997)","DOI":"10.1145\/258533.258590"},{"key":"14_CR27","doi-asserted-by":"crossref","unstructured":"Kabanets, V., Cai, J.: Circuit minimization problem. In: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, May 21-23, 2000, Portland, OR, USA, pp. 73\u201379 (2000)","DOI":"10.1145\/335305.335314"},{"key":"14_CR28","doi-asserted-by":"crossref","unstructured":"Ko, K.: On the notion of infinite pseudorandom sequences. Theor. Comput. Sci. 48(3), 9\u201333 (1986)","DOI":"10.1016\/0304-3975(86)90081-2"},{"issue":"1\u20134","key":"14_CR29","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1080\/00207166808803030","volume":"2","author":"AN Kolmogorov","year":"1968","unstructured":"Kolmogorov, A.N.: Three approaches to the quantitative definition of information. Int. J. Comput. Math. 2(1\u20134), 157\u2013168 (1968)","journal-title":"Int. J. Comput. Math."},{"key":"14_CR30","doi-asserted-by":"crossref","unstructured":"Liu, Y., Pass, R.: On one-way functions and Kolmogorov complexity. In: 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA, November 16-19, 2020, pp. 1243\u20131254. IEEE (2020)","DOI":"10.1109\/FOCS46700.2020.00118"},{"key":"14_CR31","doi-asserted-by":"crossref","unstructured":"Liu, Y., Pass, R.: Cryptography from sublinear time hardness of time-bounded kolmogorov complexity. In: STOC (2021)","DOI":"10.1145\/3406325.3451121"},{"key":"14_CR32","unstructured":"Liu, Y., Pass, R.: Characterizing derandomization through hardness of levin-kolmogorov complexity. In CCC (2022)"},{"key":"14_CR33","doi-asserted-by":"crossref","unstructured":"Liu, Y., Pass, R.: On one-way functions and the worst-case hardness of time-bounded kolmogorov complexity. Cryptology ePrint Archive p.\u00a01086 (2023)","DOI":"10.1007\/978-3-031-78011-0_8"},{"key":"14_CR34","doi-asserted-by":"crossref","unstructured":"Luby, M.G.: Pseudorandomness and cryptographic applications, vol.\u00a01. Princeton University Press (1996)","DOI":"10.1515\/9780691206844"},{"key":"14_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-3-642-03356-8_21","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"U Maurer","year":"2009","unstructured":"Maurer, U., Tessaro, S.: Computational indistinguishability amplification: tight product theorems for system composition. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 355\u2013373. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03356-8_21"},{"key":"14_CR36","doi-asserted-by":"crossref","unstructured":"Mazor, N., Pass, R.: Counting unpredictable bits: A simple prg from one-way functions. Cryptology ePrint Archive (2023)","DOI":"10.1007\/978-3-031-48615-9_7"},{"key":"14_CR37","doi-asserted-by":"crossref","unstructured":"McKay, D.M., Murray, C.D., Williams, R.R.: Weak lower bounds on resource-bounded compression imply strong separations of complexity classes. In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, pp. 1215\u20131225 (2019)","DOI":"10.1145\/3313276.3316396"},{"issue":"2","key":"14_CR38","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1006\/jcss.1998.1618","volume":"58","author":"M Naor","year":"1999","unstructured":"Naor, M., Reingold, O.: Synthesizers and their application to the parallel construction of pseudo-random functions. J. Comput. Syst. Sci. 58(2), 336\u2013375 (1999)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"14_CR39","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1145\/972639.972643","volume":"51","author":"M Naor","year":"2004","unstructured":"Naor, M., Reingold, O.: Number-theoretic constructions of efficient pseudo-random functions. J. ACM (JACM) 51(2), 231\u2013262 (2004)","journal-title":"J. ACM (JACM)"},{"key":"14_CR40","doi-asserted-by":"crossref","unstructured":"Naor, M., Reingold, O., Rosen, A.: Pseudo-random functions and factoring. In: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, pp. 11\u201320 (2000)","DOI":"10.1145\/335305.335307"},{"issue":"2","key":"14_CR41","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0022-0000(05)80043-1","volume":"49","author":"N Nisan","year":"1994","unstructured":"Nisan, N., Wigderson, A.: Hardness vs randomness. J. Comput. Syst. Sci. 49(2), 149\u2013167 (1994)","journal-title":"J. Comput. Syst. Sci."},{"key":"14_CR42","unstructured":"Oliveira, I., Pich, J., Santhanam, R.: Hardness magnification near state-of-the-art lower bounds (2019)"},{"key":"14_CR43","unstructured":"Oliveira, I.C.: Randomness and intractability in kolmogorov complexity. In: 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2019)"},{"key":"14_CR44","doi-asserted-by":"crossref","unstructured":"Oliveira, I.C., Santhanam, R.: Hardness magnification for natural problems. In: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), pp. 65\u201376. IEEE (2018)","DOI":"10.1109\/FOCS.2018.00016"},{"issue":"1","key":"14_CR45","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1006\/jcss.1997.1494","volume":"55","author":"AA Razborov","year":"1997","unstructured":"Razborov, A.A., Rudich, S.: Natural proofs. J. Comput. Syst. Sci. 55(1), 24\u201335 (1997)","journal-title":"J. Comput. Syst. Sci."},{"key":"14_CR46","doi-asserted-by":"crossref","unstructured":"Sipser, M.: A complexity theoretic approach to randomness. In: Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 25\u201327 April, 1983, Boston, Massachusetts, USA, pp. 330\u2013335. ACM (1983)","DOI":"10.1145\/800061.808762"},{"issue":"2","key":"14_CR47","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., Vadhan, S.: Pseudorandom generators without the xor lemma. J. Comput. Syst. Sci. 62(2), 236\u2013266 (2001)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"14_CR48","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/MAHC.1984.10036","volume":"6","author":"BA Trakhtenbrot","year":"1984","unstructured":"Trakhtenbrot, B.A.: A survey of Russian approaches to perebor (brute-force searches) algorithms. Annal. History Comput. 6(4), 384\u2013400 (1984)","journal-title":"Annal. History Comput."},{"key":"14_CR49","doi-asserted-by":"crossref","unstructured":"Vadhan, S.P.: Pseudorandomness. Foundations and Trends\u00ae in Theoretical Comput. Sci. 7(1\u20133), 1\u2013336 (2012)","DOI":"10.1561\/0400000010"},{"key":"14_CR50","doi-asserted-by":"crossref","unstructured":"Vadhan, S.P., Zheng, C.J.: Characterizing pseudoentropy and simplifying pseudorandom generator constructions. In: STOC, pp. 817\u2013836 (2012)","DOI":"10.1145\/2213977.2214051"},{"issue":"11","key":"14_CR51","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"LG Valiant","year":"1984","unstructured":"Valiant, L.G.: A theory of the learnable. Commun. ACM 27(11), 1134\u20131142 (1984)","journal-title":"Commun. ACM"},{"issue":"1","key":"14_CR52","first-page":"75","volume":"2","author":"S Yablonski","year":"1959","unstructured":"Yablonski, S.: The algorithmic difficulties of synthesizing minimal switching circuits. Problemy Kibernetiki 2(1), 75\u2013121 (1959)","journal-title":"Problemy Kibernetiki"},{"issue":"1","key":"14_CR53","first-page":"44","volume":"124","author":"SV Yablonski","year":"1959","unstructured":"Yablonski, S.V.: On the impossibility of eliminating perebor in solving some problems of circuit theory. Dokl. Akad. Nauk SSSR 124(1), 44\u201347 (1959)","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"14_CR54","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Theory and applications of trapdoor functions (extended abstract). In: 23rd Annual Symposium on Foundations of Computer Science, Chicago, Illinois, USA, 3\u20135 November 1982, pp. 80\u201391 (1982)","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-58737-5_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T00:03:41Z","timestamp":1777248221000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-58737-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031587368","9783031587375"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-58737-5_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"28 April 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zurich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Switzerland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"43","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}