6 papers
How hard are verifiable delay functions?
Souvik Sur
Verifiable delay functions (VDF) are functions that take a specified number of sequential steps to be evaluated but can be verified efficiently. In this paper, we introduce a new c…
Single Squaring Verifiable Delay Function from Time-lock Puzzle in the Group of Known Order
Souvik Sur
A Verifiable Delay Function (VDF) is a function that takes a specified sequential time to be evaluated, but can be verified in -time. For meaningful security, c…
Generating Hard Problems of Cellular Automata
Souvik Sur
We propose two hard problems in cellular automata. In particular the problems are: [DDP] Given two \emph{randomly} chosen configurations and of a cellular automat…
Souvik Sur
Verifiable delay functions (VDF) are functions that take a specified number of sequential steps to be evaluated but can be verified efficiently. In this paper, we show that every V…
Single-Query Verifiable Proof-of-Sequential-Work
Souvik Sur
We propose a proof-of-sequential-work (PoSW) that can be verified with only a single query to the random oracle for each random challenge. Proofs-of-sequential-work are protocols t…
Two Sequential Squaring Verifiable Delay Function
Souvik Sur
A Verifiable Delay Function (VDF) is a function that takes a specified sequential time to be evaluated, but can be efficiently verified. VDFs are useful in several applications ran…