Breaking Verifiable Delay Functions in the Random Oracle Model

A VDF is a cryptographic primitive that requires a long time to compute (even with parallelization), but produces a unique output that is efficiently and publicly verifiable. We prove that VDFs do not exist in the random oracle model. This also rules out black-box constructions of VDFs from other cryptographic primitives, such as one-way functions, one-way permutations and collision-resistant hash functions.

Based on https://eprint.iacr.org/2024/766, joint work with Artur Riazanov and Weiqiang Yuan