Separating verifiable delay functions and time-lock puzzles
From MaRDI portal
No records found.
Cites work
- (Verifiable) delay functions from Lucas sequences
- Black-box timed commitments from time-lock puzzles
- Breaking verifiable delay functions in the random oracle model
- Can verifiable delay functions be based on random oracles?
- Continuous verifiable delay functions
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
- Homomorphic time-lock puzzles and applications
- scientific article; zbMATH DE number 1759782 (Why is no real title available?)
- Incremental proofs of sequential work
- Lattice-based timed cryptography
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
- Non-interactive cryptographic timestamping based on verifiable delay functions
- Non-malleable time-lock puzzles and applications
- On graphs of incremental proofs of sequential work
- On the security of time-lock puzzles and timed commitments
- PPAD is as hard as LWE and iterated squaring
- Practical statistically-sound proofs of exponentiation in any group
- Publicly verifiable proofs of sequential work
- Resource fairness and composability of cryptographic protocols
- Reversible proofs of sequential work
- Short-lived zero-knowledge proofs and signatures
- Simple proofs of sequential work
- Simple verifiable delay functions
- Simple, fast, efficient, and tightly-secure non-malleable non-interactive timed commitments
- SNACKs for proof-of-space blockchains
- SNACKs: leveraging proofs of sequential work for blockchain light clients
- SPARKs: succinct parallelizable arguments of knowledge
- Succinct randomized encodings from laconic function evaluation, faster and simpler
- TARDIS: a foundation of time-lock puzzles in UC
- Theory of Cryptography
- Time- and space-efficient arguments from groups of unknown order
- Time-lock puzzles from lattices
- Time-lock puzzles from randomized encodings
- Time-lock puzzles in the random oracle model
- Time-lock puzzles with efficient batch solving
- Time-release cryptography from minimal circuit assumptions
- Transparent batchable time-lock puzzles and applications to Byzantine consensus
- Verifiable delay functions from supersingular isogenies and pairings
- Versatile and sustainable timed-release encryption and sequential time-lock puzzles (extended abstract)
This page was built for publication: Separating verifiable delay functions and time-lock puzzles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7304134)
