Simple and efficient batch verification techniques for verifiable delay functions
From MaRDI portal
(Redirected from Publication:2697899)
Cites work
- A Pseudorandom Generator from any One-way Function
- Batch Verification of Short Signatures
- Batching techniques for accumulators with applications to IOPs and stateless blockchains
- Bit commitment using pseudorandomness
- Continuous verifiable delay functions
- Efficient verifiable delay functions
- Efficient verifiable delay functions
- Explicit, almost optimal, epsilon-balanced codes
- Fast Batch Verification of Multiple Signatures
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
- Generic-group delay functions require hidden-order groups
- Hardness vs randomness
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 1583769 (Why is no real title available?)
- scientific article; zbMATH DE number 4213912 (Why is no real title available?)
- scientific article; zbMATH DE number 1258344 (Why is no real title available?)
- scientific article; zbMATH DE number 1303126 (Why is no real title available?)
- scientific article; zbMATH DE number 1088905 (Why is no real title available?)
- scientific article; zbMATH DE number 1559537 (Why is no real title available?)
- Improved digital signature suitable for batch verification
- Malleability of the blockchain's entropy
- Non-interactive cryptographic timestamping based on verifiable delay functions
- Simple Constructions of Almost k-wise Independent Random Variables
- Simple verifiable delay functions
- Small-Bias Probability Spaces: Efficient Constructions and Applications
- Stronger security proofs for RSA and Rabin bits.
- The Group of Signed Quadratic Residues and Applications
- Tight proofs of space and replication
- Tight verifiable delay functions
- Time- and space-efficient arguments from groups of unknown order
- Verifiable delay functions
- Verifiable delay functions from supersingular isogenies and pairings
Cited in
(9)- Design for delay verifiability
- Verifiable delay functions
- On minimising the maximum expected verification time
- scientific article; zbMATH DE number 1670834 (Why is no real title available?)
- scientific article; zbMATH DE number 5042670 (Why is no real title available?)
- Efficient verifiable delay functions
- Certifying giant nonprimes
- Practical statistically-sound proofs of exponentiation in any group
- Watermarkable and zero-knowledge verifiable delay functions from any proof of exponentiation
This page was built for publication: Simple and efficient batch verification techniques for verifiable delay functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2697899)
