Simple and efficient batch verification techniques for verifiable delay functions
From MaRDI portal
Publication:2697899
DOI10.1007/978-3-030-90456-2_13OpenAlexW3214715484MaRDI QIDQ2697899
Publication date: 13 April 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-90456-2_13
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Malleability of the blockchain's entropy
- Bit commitment using pseudorandomness
- Hardness vs randomness
- Verifiable delay functions
- Stronger security proofs for RSA and Rabin bits.
- Continuous verifiable delay functions
- Generic-group delay functions require hidden-order groups
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
- Tight verifiable delay functions
- Time- and space-efficient arguments from groups of unknown order
- Batching techniques for accumulators with applications to IOPs and stateless blockchains
- Verifiable delay functions from supersingular isogenies and pairings
- Non-interactive cryptographic timestamping based on verifiable delay functions
- Tight proofs of space and replication
- Small-Bias Probability Spaces: Efficient Constructions and Applications
- The Group of Signed Quadratic Residues and Applications
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Simple Constructions of Almost k-wise Independent Random Variables
- A Pseudorandom Generator from any One-way Function
- Improved digital signature suitable for batch verification
- Explicit, almost optimal, epsilon-balanced codes
- Simple verifiable delay functions
- Batch Verification of Short Signatures
- Fast Batch Verification of Multiple Signatures
- Efficient verifiable delay functions
- Efficient verifiable delay functions
This page was built for publication: Simple and efficient batch verification techniques for verifiable delay functions
