We study the complexity of black-box constructions of pseudorandom functions (PRFs) from one-way functions (OWFs) that are secure against non-uniform adversaries. We show that if OWFs do not exist, then given as an oracle any (inefficient) hard-to-invert function, one can compute a PRF ...
Combining this with the fact that OWFs imply PRFs, we show that unconditionally there exists a (pathological) construction of a PRF from OWF making at most $k(n)$ queries. This result shows a limitation of a certain class of techniques for proving efficiency lower bounds on the construction...