Simple verifiable delay functions
From MaRDI portal
Recommendations
Cites work
- A signature scheme based on the intractability of computing roots
- Generating safe primes
- How not to prove yourself: pitfalls of the fiat-shamir heuristic and applications to helios
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
- Publicly verifiable proofs of sequential work
- Simple proofs of sequential work
- Stronger security proofs for RSA and Rabin bits.
- The Group of Signed Quadratic Residues and Applications
- Verifiable delay functions
Cited in
(71)- Design for delay verifiability
- Verifiable delay functions
- Transparent SNARKs from DARK compilers
- SPARKs: succinct parallelizable arguments of knowledge
- Continuous verifiable delay functions
- Generic-group delay functions require hidden-order groups
- Bandwidth-efficient threshold EC-DSA
- Delay encryption
- Generic compiler for publicly verifiable covert multi-party computation
- TARDIS: a foundation of time-lock puzzles in UC
- Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
- Delegation with updatable unambiguous proofs and PPAD-hardness
- Non-malleable codes for bounded parallel-time tampering
- Time- and space-efficient arguments from groups of unknown order
- Minting mechanism for proof of stake blockchains
- On the impossibility of purely algebraic signatures
- Simple and efficient batch verification techniques for verifiable delay functions
- Non-malleable time-lock puzzles and applications
- Multiparty generation of an RSA modulus
- Efficient verifiable delay functions
- Multiparty generation of an RSA modulus
- A proof of the conjectured run time of the Hafner-McCurley class group algorithm
- An incremental PoSW for general weight distributions
- Verifiable capacity-bound functions: a new primitive from Kolmogorov complexity. (Revisiting space-based security in the adaptive setting)
- CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime
- Simple, fast, efficient, and tightly-secure non-malleable non-interactive timed commitments
- Certifying giant nonprimes
- Practical statistically-sound proofs of exponentiation in any group
- TIDE: a novel approach to constructing timed-release encryption
- Parallelizable delegation from LWE
- SNACKs: leveraging proofs of sequential work for blockchain light clients
- Short-lived zero-knowledge proofs and signatures
- On time-lock cryptographic assumptions in abelian hidden-order groups
- Astrolabous: a universally composable time-lock encryption scheme
- Snarky ceremonies
- Time-release cryptography from minimal circuit assumptions
- PPAD is as hard as LWE and iterated squaring
- Applications of timed-release encryption with implicit authentication
- Completeness theorems for adaptively secure broadcast
- Secure multiparty computation from threshold encryption based on class groups
- Lattice-based succinct arguments from vanishing polynomials (extended abstract)
- Lattice-based timed cryptography
- Bicorn: an optimistically efficient distributed randomness beacon
- (Verifiable) delay functions from Lucas sequences
- On the (im)possibility of time-lock puzzles in the quantum random oracle model
- Verifiable isogeny walks: towards an isogeny-based postquantum VDF
- Towards a quantum-resistant weak verifiable delay function
- PURED: a unified framework for resource-hard functions
- Cryptanalysis of algebraic verifiable delay functions
- Cryptanalysis of lattice-based sequentiality assumptions and proofs of sequential work
- On sequential functions and fine-grained cryptography
- CaSCaDE: (time-based) Cryptography from Space Communications DElay
- Can verifiable delay functions be based on random oracles?
- Breaking verifiable delay functions in the random oracle model
- DewTwo: a transparent PCS with quasi-linear prover, logarithmic verifier and 4.5KB proofs from falsifiable assumptions
- Behemoth: transparent polynomial commitment scheme with constant opening proof size and verifier time
- How (not) to hash into class groups of imaginary quadratic fields?
- Proofs of sequential communication delays from physical assumptions and their applications
- Watermarkable and zero-knowledge verifiable delay functions from any proof of exponentiation
- Black-box timed commitments from time-lock puzzles
- Space-lock puzzles and verifiable space-hard functions from root-finding in sparse polynomials
- Timed secret sharing
- Short paper: naysayer proofs
- Subverting cryptographic hardware used in blockchain consensus
- BTLE: atomic swaps with time-lock puzzles
- Verifiable delay function based on non-linear hybrid cellular automata
- 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: Simple verifiable delay functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090439)
