搜索结果: 1-9 共查到“Verifiable delay functions”相关记录9条 . 查询时间(0.061 秒)
A Note on the (Im)possibility of Verifiable Delay Functions in the Random Oracle Model
Verifiable Delay Functions Random Oracle Model
2019/6/6
Boneh, Bonneau, B{\"u}nz, and Fisch (CRYPTO 2018) recently introduced the notion of a \emph{verifiable delay function} (VDF). VDFs are functions that take a long \emph{sequential} time TT to compute, ...
A Verifiable Delay Function (VDF) is a function that takes at least TT sequential steps to evaluate and produces a unique output that can be verified efficiently, in time essentially independent of TT...
Continuous Verifiable Delay Functions
Verifiable delay functions continuous verifiability randomness beacons
2019/6/4
We introduce the notion of a continuous verifiable delay functioncontinuous verifiable delay function (cVDF): a function gg which is (a) iteratively sequential---meaning that evaluating the iteration ...
Non-interactive Cryptographic Timestamping based on Verifiable Delay Functions
non-interactive cryptographic timestamping universal composability verifiable delay functions
2019/3/1
We present the first treatment of non-interactive publicly-verifiable timestamping schemes in the Universal Composability framework. Similar to a simple construction by Mahmoody et al., we use non-par...
A note on isogeny-based hybrid verifiable delay functions
verifiable delay function time-lock puzzle isogeny-based cryptography
2019/3/1
Using the idea behind the recently proposed isogeny- and paring-based verifiable delay function (VDF) by De Feo, Masson, Petit and Sanso, we construct an isogeny-based VDF without the use of pairings....
Verifiable Delay Functions from Supersingular Isogenies and Pairings
Verifiable Delay Function Isogenies Pairings
2019/2/25
We present two new Verifiable Delay Functions (VDF) based on assumptions from elliptic curve cryptography. We discuss both the advantages and some drawbacks of our constructions, we study their securi...
A verifiable delay function (VDF) is an important tool used for adding delay in decentralized applications. This short note briefly surveys and compares two recent beautiful Verifiable Delay Functions...
We construct a verifable delay function (or unique publicly verifiable proof of sequential work) by showing how the Rivest-Shamir-Wagner time-lock puzzle can be made publicly verifiable.
We study the problem of building a verifiable delay function (VDF). A VDF requires a specified number of sequential steps to evaluate, yet produces a unique output that can be efficiently and publicly...