Practical batch proofs of exponentiation
From MaRDI portal
Cites work
- (Verifiable) delay functions from Lucas sequences
- A compressed \(\varSigma \)-protocol theory for lattices
- A note on the low order assumption in class groups of imaginary quadratic number fields
- A survey of two verifiable delay functions using proof of exponentiation
- Batch RSA
- Batch verification of short signatures
- Certifying giant nonprimes
- Constant-Size Commitments to Polynomials and Their Applications
- Cryptography and Coding
- Efficient verifiable delay functions
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 1303126 (Why is no real title available?)
- scientific article; zbMATH DE number 2085203 (Why is no real title available?)
- Lattice-based succinct arguments from vanishing polynomials (extended abstract)
- Lattice-based timed cryptography
- Non-interactive cryptographic timestamping based on verifiable delay functions
- On extractability of the KZG family of polynomial commitment schemes
- On the Evaluation of Powers and Monomials
- Parallelizable delegation from LWE
- Practical statistically-sound proofs of exponentiation in any group
- Short-lived zero-knowledge proofs and signatures
- Simple and efficient batch verification techniques for verifiable delay functions
- Simple proofs of sequential work
- Simple verifiable delay functions
- Time- and space-efficient arguments from groups of unknown order
- Transaction protection by beacons
- Verifiable delay functions
- Verifiable delay functions from supersingular isogenies and pairings
- Verifiable isogeny walks: towards an isogeny-based postquantum VDF
- Watermarkable and zero-knowledge verifiable delay functions from any proof of exponentiation
This page was built for publication: Practical batch proofs of exponentiation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7390763)
