Can verifiable delay functions be based on random oracles?
From MaRDI portal
Cites work
- A method for obtaining digital signatures and public-key cryptosystems
- A signature scheme based on the intractability of computing roots
- Efficient verifiable delay functions
- High Parallel Complexity Graphs and Memory-Hard Functions
- scientific article; zbMATH DE number 708802 (Why is no real title available?)
- Incremental proofs of sequential work
- Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions
- Merkle's key agreement protocol is optimal: an \(O(n^2)\) attack on any key agreement from random oracles
- On black-box separations among injective one-way functions
- Publicly verifiable proofs of sequential work
- Reversible proofs of sequential work
- Simple proofs of sequential work
- Simple verifiable delay functions
- The equivalence of the random oracle model and the ideal cipher model, revisited
- The Random Oracle Model and the Ideal Cipher Model Are Equivalent
- Time-lock puzzles in the random oracle model
- Verifiable delay functions
- Verifiable delay functions from supersingular isogenies and pairings
Cited in
(6)- Breaking verifiable delay functions in the random oracle model
- Watermarkable and zero-knowledge verifiable delay functions from any proof of exponentiation
- Time/space tradeoffs for generic attacks on delay functions
- Impossibility of VDFs in the ROM: the complete picture
- Separating verifiable delay functions and time-lock puzzles
- A survey of two verifiable delay functions using proof of exponentiation
This page was built for publication: Can verifiable delay functions be based on random oracles?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6842488)
