Efficient verifiable delay functions
From MaRDI portal
Publication:5919019
DOI10.1007/s00145-020-09364-xzbMath1453.94125OpenAlexW4205348036MaRDI QIDQ5919019
Publication date: 6 November 2020
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/30021
Related Items (10)
PoSAT: proof-of-work availability and unpredictability, without the work ⋮ Improved Constructions of Anonymous Credentials from Structure-Preserving Signatures on Equivalence Classes ⋮ 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}\) ⋮ Simple and efficient batch verification techniques for verifiable delay functions
Uses Software
Cites Work
- Transaction protection by beacons
- A key-exchange system based on imaginary quadratic fields
- Trustworthy public randomness with sloth, unicorn, and trx
- Verifiable delay functions
- A signature scheme based on the intractability of computing roots
- Batching techniques for accumulators with applications to IOPs and stateless blockchains
- A Rigorous Subexponential Algorithm For Computation of Class Groups
- Composability and On-Line Deniability of Authentication
- The Knowledge Complexity of Interactive Proof Systems
- Nonmalleable Cryptography
- Computationally Sound Proofs
- When e-th Roots Become Easier Than Factoring
- Advances in Cryptology - CRYPTO 2003
- Concurrent zero-knowledge
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Efficient verifiable delay functions
