Verifiable Delay Functions
Functions that take a prescribed amount of sequential time to evaluate but are quickly verifiable, and their (un)computational uniqueness.
| Status | Problem | Tags |
|---|---|---|
|
Computationally unique VDFs in the ROM Resolved. Guan, Riazanov and Yuan, Breaking Verifiable Delay Functions in the Random Oracle Model (ePrint 2024/766, CRYPTO 2025), prove that no VDF in the parallel ROM can have completeness and computational uniqueness and be \(\sigma\)-sequential for \(\sigma\) a fixed polynomial in the security parameter and the Setup/Verify query counts – their Theorem 5.1, which in fact covers general (not just perfect) completeness error, strictly more than this conjecture asked for. The proof is human-authored and published; it has not yet been independently re-derived by this site or formalized in Lean. 3 open |
Black Box SeparationsRandom Oracle ModelVerifiable Delay Functionsromimpossibilityresearch-solved |
No matching items