Lower Bounds on Black-Box Constructions of Pseudorandom Functions

[2608.14501] Lower Bounds on Black-Box Constructions of Pseudorandom Functions Skip to main content Search Submit Donate Log in Search arXiv Press Enter to search · Advanced search Computer Science > Cryptography and Security arXiv:2608.14501 (cs) [Submitted on 14 Aug 2026] Title: Lower Bounds on Black-Box Constructions of Pseudorandom Functions Authors: Bar Alon , Itai Dinur , Muthuramakrishnan Venkitasubramaniam View a PDF of the paper titled Lower Bounds on Black-Box Constructions of Pseudorandom Functions, by Bar Alon and 2 other authors View PDF HTML (experimental) Abstract: In their seminal work, Goldreich, Goldwasser, and Micali [CRYPTO 1984] constructed a pseudorandom function (PRF) using a black-box access to a pseudorandom generator (PRG). When combined with Levin's domain extension technique, the GGM construction invokes the PRG $\omega(\log n)$ times, where $n$ denotes the input length to the PRG. To this day, no black-box construction achieving fewer calls is known. Recently, Beimel, Malkin, and Mazor [CRYPTO 2024] showed that for a certain family of constructions, which they termed \emph{tree constructions}, the GGM construction is optimal. However, the basic challenge of whether a PRF can be built with just \emph{one invocation} of the PRG still remains open. In this work, we consider fully black-box constructions of PRFs from PRGs, where both the construction and the reduction are required to be black-box, and the number of interactions the reduction makes with the adversary is independent of the number of oracle calls the adversary makes to its underlying function within each interaction. Our main result shows that no such construction can have $o(n/\log n)$ and $o(\mathsf{in}/\log\mathsf{in})$ \emph{non-adaptive} calls to the PRG, where $\mathsf{in}$ is the input length of the PRF. This impossibility holds even for weak PRFs with one-bit output, where the adversary is restricted to making i.i.d. uniformly random queries. In addition, we prove a lower bound for weak PRFs with sufficiently long outputs that holds even when the construction is allowed to make adaptive queries to the PRG. Comments: Published at CRYPTO 2026 Subjects: Cryptography and Security (cs.CR) Cite as: arXiv:2608.14501 [cs.CR] (or arXiv:2608.14501v1 [cs.CR] for this version) https://doi.org/10.48550/arXiv.2608.14501 Focus to learn more arXiv-issued DOI via DataCite Submission history From: Itai Dinur [ view email ] [v1] Fri, 14 Aug 2026 17:15:54 UTC (42 KB) Full-text links: Access Paper: View a PDF of the paper titled Lower Bounds on Black-Box Constructions of Pseudorandom Functions, by Bar Alon and 2 other authors View PDF HTML (experimental) TeX Source view license Current browse context: cs.CR < prev | next > new | recent | 2026-08 Change to browse by: cs References & Citations NASA ADS Google Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer ( What is the Explorer? ) Connected Papers Toggle Connected Papers ( What is Connected Papers? ) Litmaps Toggle Litmaps ( What is Litmaps? ) scite.ai Toggle scite Smart Citations ( What are Smart Citations? ) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv ( What is alphaXiv? ) Links to Code Toggle CatalyzeX Code Finder for Papers ( What is CatalyzeX? ) DagsHub Toggle DagsHub ( What is DagsHub? ) GotitPub Toggle Gotit.pub ( What is GotitPub? ) Huggingface Toggle Hugging Face ( What is Huggingface? ) ScienceCast Toggle ScienceCast ( What is ScienceCast? ) Demos Demos Replicate Toggle Replicate ( What is Replicate? ) Spaces Toggle Hugging Face Spaces ( What is Spaces? ) Spaces Toggle TXYZ.AI ( What is TXYZ.AI? ) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower ( What are Influence Flowers? ) Core recommender toggle CORE Recommender ( What is CORE? ) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs . Which authors of this paper are endorsers? | Disable MathJax ( What is MathJax? ) We gratefully acknowledge support from our major funders , member institutions , , and all contributors. About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab) Major funding support from

Related documents

• Lower Bounds on Black-Box Constructions of Pseudorandom Functions#458223
• Exact Minimax One-Bit Unbiased Compression: Heavy-Tail Necessity and Finite-Randomness Approximation#1064404
• Algorithmic Randomness, Exchangeability, and the Principal Principle#694494
• Spoofing Missed-Detection Bounds for PRF GNSS Ranging Authentication Under AWGN Models#1036582
• Complexity Theory of Randomised Testing#363312