Journal
JOURNAL OF CRYPTOLOGY
Volume 33, Issue 4, Pages 2113-2147Publisher
SPRINGER
DOI: 10.1007/s00145-020-09364-x
Keywords
Time-lock puzzle; VDF; Randomness beacon; RSA; Class group
Categories
Funding
- Ethereum Foundation [FY19-0090]
- ERC [740972]
- European Research Council (ERC) [740972] Funding Source: European Research Council (ERC)
Ask authors/readers for more resources
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 atrapdoorVDF. 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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available