On verifiable delay functions from time-lock puzzles
From MaRDI portal
Cites work
- Adaptive security in SNARGs via iO and lossy functions
- Adaptively secure constrained pseudorandom functions in the standard model
- Constrained key-homomorphic PRFs from standard lattice assumptions. Or: how to secretly embed a circuit in your PRF
- Constrained PRFs for unbounded inputs
- Constrained pseudorandom functions and their applications
- Continuous verifiable delay functions
- Cryptanalysis of algebraic verifiable delay functions
- Cryptanalysis of lattice-based sequentiality assumptions and proofs of sequential work
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- How to use indistinguishability obfuscation
- Non-interactive cryptographic timestamping based on verifiable delay functions
- Perfect structure on the edge of chaos. Trapdoor permutations from indistinguishability obfuscation
- Practical statistically-sound proofs of exponentiation in any group
- Publicly verifiable proofs of sequential work
- Simple verifiable delay functions
- SPARKs: succinct parallelizable arguments of knowledge
- Succinct randomized encodings from laconic function evaluation, faster and simpler
- Time-lock puzzles from randomized encodings
- Time-lock puzzles with efficient batch solving
- Time-release cryptography from minimal circuit assumptions
- Trustworthy public randomness with sloth, unicorn, and trx
- Verifiable delay functions from supersingular isogenies and pairings
- Verifiable isogeny walks: towards an isogeny-based postquantum VDF
- Watermarking public-key cryptographic primitives
- Witness maps and applications
This page was built for publication: On verifiable delay functions from time-lock puzzles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7390950)
