Efficient verifiable delay functions
From MaRDI portal
Recommendations
- Efficient verifiable delay functions
- Verifiable delay functions
- Tight verifiable delay functions
- Simple verifiable delay functions
- Continuous verifiable delay functions
- Simple and efficient batch verification techniques for verifiable delay functions
- Design for delay verifiability
- Non-interactive cryptographic timestamping based on verifiable delay functions
- Efficient Construction of (Distributed) Verifiable Random Functions
Cites work
- A key-exchange system based on imaginary quadratic fields
- A Rigorous Subexponential Algorithm For Computation of Class Groups
- A signature scheme based on the intractability of computing roots
- A survey on IQ cryptography
- Advances in Cryptology - CRYPTO 2003
- Batching techniques for accumulators with applications to IOPs and stateless blockchains
- Composability and On-Line Deniability of Authentication
- Computationally Sound Proofs
- Concurrent zero-knowledge
- scientific article; zbMATH DE number 1643955 (Why is no real title available?)
- scientific article; zbMATH DE number 1088251 (Why is no real title available?)
- scientific article; zbMATH DE number 1759782 (Why is no real title available?)
- scientific article; zbMATH DE number 1424194 (Why is no real title available?)
- Nonmalleable Cryptography
- The Knowledge Complexity of Interactive Proof Systems
- Transaction protection by beacons
- Trustworthy public randomness with sloth, unicorn, and trx
- Verifiable delay functions
- When e-th Roots Become Easier Than Factoring
Cited in
(28)- Design for delay verifiability
- Trustworthy public randomness with sloth, unicorn, and trx
- Verifiable delay functions
- Continuous verifiable delay functions
- Delay encryption
- Tight verifiable delay functions
- PoSAT: proof-of-work availability and unpredictability, without the work
- Verifiable delay functions from supersingular isogenies and pairings
- Simple and efficient batch verification techniques for verifiable delay functions
- Improved constructions of anonymous credentials from structure-preserving signatures on equivalence classes
- Simple verifiable delay functions
- Efficient verifiable delay functions
- A proof of the conjectured run time of the Hafner-McCurley class group algorithm
- Verifiable capacity-bound functions: a new primitive from Kolmogorov complexity. (Revisiting space-based security in the adaptive setting)
- Certifying giant nonprimes
- Practical statistically-sound proofs of exponentiation in any group
- I want to ride my \texttt{BICYCL} : \texttt{BICYCL} implements cryptography in class groups
- Logarithmic-size (linkable) threshold ring signatures in the plain model
- Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\)
- Short-lived zero-knowledge proofs and signatures
- Distributed-prover interactive proofs
- (Verifiable) delay functions from Lucas sequences
- 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 lattice-based sequentiality assumptions and proofs of sequential work
- BTLE: atomic swaps with time-lock puzzles
- A survey of two verifiable delay functions using proof of exponentiation
This page was built for publication: Efficient verifiable delay functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5919019)
