Skip to Main content Skip to Navigation
Journal articles

Efficient Verifiable Delay Functions (extended version)

Benjamin Wesolowski 1, 2
1 LFANT - Lithe and fast algorithmic number theory
IMB - Institut de Mathématiques de Bordeaux, Inria Bordeaux - Sud-Ouest
Abstract : We construct a verifiable delay function (VDF). A VDF is a function whose evaluation requires running a given number of sequential steps, yet the result can be efficiently verified. They have applications in decentralised systems, such as the generation of trustworthy public randomness in a trustless environment, or resource-efficient blockchains. To construct our VDF, we actually build a trapdoor VDF. A trapdoor VDF is essentially a VDF which can be evaluated efficiently by parties who know a secret (the trapdoor). By setting up this scheme in a way that the trapdoor is unknown (not even by the party running the setup, so that there is no need for a trusted setup environment), we obtain a simple VDF. Our construction is based on groups of unknown order such as an RSA group, or the class group of an imaginary quadratic field. The output of our construction is very short (the result and the proof of correctness are each a single element of the group), and the verification of correctness is very efficient.
Document type :
Journal articles
Complete list of metadatas

Cited literature [36 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02945371
Contributor : Benjamin Wesolowski <>
Submitted on : Tuesday, September 22, 2020 - 11:27:30 AM
Last modification on : Wednesday, October 14, 2020 - 4:04:57 AM

File

paper.pdf
Files produced by the author(s)

Identifiers

Collections

INRIA | CNRS | IMB

Citation

Benjamin Wesolowski. Efficient Verifiable Delay Functions (extended version). Journal of Cryptology, Springer Verlag, 2020, ⟨10.1007/s00145-020-09364-x⟩. ⟨hal-02945371⟩

Share

Metrics

Record views

38

Files downloads

32