Skip to main navigation Skip to search Skip to main content

Impossibility of VDFs in the ROM: The Complete Picture

Publications: Contribution to bookContribution to proceedingsPeer Reviewed

Abstract

We study whether Verifiable Delay Functions (VDFs) can be constructed in the (plain) Random Oracle Model (ROM) without any computational assumptions. A first partial answer to this question is due to Mahmoody, Smith, and Wu [ICALP 2020] where they rule out perfectly unique VDFs in the ROM. Building on this result, Guan, Riazanov, and Yuan [CRYPTO 2025] prove that VDFs with computational uniqueness and public-coin setup are impossible in the ROM. These works leave open the possibility of constructing computationally unique VDFs with private-coin setup in the ROM. We resolve this problem and additionally rule out computationally-unique VDFs with computationally expensive private-coin setup in the ROM.

Original languageEnglish
Title of host publicationAdvances in Cryptology – EUROCRYPT 2026
Subtitle of host publication45th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Rome, Italy, May 10–14, 2026, Proceedings
EditorsJoan Daemen, Emmanuel Thomé
Place of PublicationCham
PublisherSpringer
Pages3-32
Number of pages30
Volume5
ISBN (Electronic)978-3-032-25330-9
ISBN (Print)9783032253293
DOIs
Publication statusPublished - 1 May 2026

Publication series

SeriesLecture Notes in Computer Science
Volume16545
ISSN0302-9743

Funding

Hamza Abusalah is supported by the PICOCRYPT project that has received funding from the European Research Council (ERC) under the European Unions Horizon 2020 research and innovation programme (Grant agreement No. 101001283), partially supported by ESPADA (PID2022-142290OB-I00) and CEX2024-001471-M funded by MCIN/AEI/10.13039/501100011033/. Erkan Tairi is supported in part by the France 2030 ANR-22-PECY-003 SecureCompute Project, by the Austrian Science Fund (FWF) Project J4879-N, by the Bakar Funds and Peder Sather Funds.

Austrian Fields of Science 2012

  • 102017 Cryptology

Cite this