Tight verifiable delay functions
From MaRDI portal
Publication:2106631
Recommendations
Cited in
(25)- Design for delay verifiability
- Verifiable delay functions
- Continuous verifiable delay functions
- Generic-group delay functions require hidden-order groups
- Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions
- Verifiable delay functions from supersingular isogenies and pairings
- Non-interactive cryptographic timestamping based on verifiable delay functions
- Simple and efficient batch verification techniques for verifiable delay functions
- Simple verifiable delay functions
- Efficient verifiable delay functions
- Efficient verifiable delay functions
- Verifiable capacity-bound functions: a new primitive from Kolmogorov complexity. (Revisiting space-based security in the adaptive setting)
- Practical statistically-sound proofs of exponentiation in any group
- Parallelizable delegation from LWE
- Short-lived zero-knowledge proofs and signatures
- Time-release cryptography from minimal circuit assumptions
- Lattice-based timed cryptography
- (Verifiable) delay functions from Lucas sequences
- Verifiable isogeny walks: towards an isogeny-based postquantum VDF
- Towards a quantum-resistant weak verifiable delay function
- Cryptanalysis of algebraic verifiable delay functions
- On sequential functions and fine-grained cryptography
- Breaking verifiable delay functions in the random oracle model
- Impossibility of VDFs in the ROM: the complete picture
- A survey of two verifiable delay functions using proof of exponentiation
This page was built for publication: Tight verifiable delay functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2106631)