DeepAI AI Chat
Log In Sign Up

Delay Function with Fixed Effort Verification

by   Souvik Sur, et al.
IIT Kharagpur

A Verifiable Delay Function (VDF) is a function that takes a specified (typically long) sequential time to be evaluated, but can be efficiently verified. VDFs are useful in several applications ranging from randomness beacons to sustainable blockchains but are really rare in practice. Most of the VDFs are based on algebraic assumptions like time-lock puzzle in unknown group orders [7,9] and isogenies over pairing groups [4]. The time-lock puzzle based VDFs require effort proportional to their security parameter during their verifications. This paper proposes a verifiable delay function that requires fixed effort during verification. Also this effort to verify is independent of the security parameter of the scheme


page 1

page 2

page 3

page 4


Faster Verifiable Delay Function For Shorter Delay Parameter

A Verifiable Delay Function (VDF) is a function that takes a specified s...

Sequential Proof-of-Work for Fair Staking and Distributed Randomness Beacons

We propose a new Proof-of-Stake consensus protocol based on a Sequential...

Practical and Verifiable Electronic Sortition

Existing verifiable e-sortition systems are impractical due to computati...

How Hard Are Verifiable Delay Functions?

Verifiable delay functions (VDF) are functions that enable a verifier to...

Trustless unknown-order groups

Groups of unknown order are of major interest due to their applications ...

A Study on Accelerating Average Consensus Algorithms Using Delayed Feedback

In this paper, we study accelerating a Laplacian-based dynamic average c...