3 papers
cs.CR2022
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…
cs.CR2022
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…
cs.CR2022
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…