A survey of two verifiable delay functions using proof of exponentiation
From MaRDI portal
Cites work
- \textsf{Dew}: a transparent constant-sized polynomial commitment scheme
- A survey on IQ cryptography
- Batching techniques for accumulators with applications to IOPs and stateless blockchains
- Can verifiable delay functions be based on random oracles?
- Efficient verifiable delay functions
- Efficient verifiable delay functions
- Fiat-Shamir transformation of multi-round interactive proofs (Extended version)
- Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 3889661 (Why is no real title available?)
- scientific article; zbMATH DE number 3353398 (Why is no real title available?)
- Practical statistically-sound proofs of exponentiation in any group
- Public-key cryptography -- PKC 2023. 26th IACR international conference on practice and theory of public-key cryptography, Atlanta, GA, USA, May 7--10, 2023. Proceedings. Part II
- Reflection Principles and Bounds for Class Group Torsion
- Simple proofs of sequential work
- Simple verifiable delay functions
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- Subvector commitments with application to succinct arguments
- Tight verifiable delay functions
- Time- and space-efficient arguments from groups of unknown order
- Time-lock puzzles from randomized encodings
- Time-release cryptography from minimal circuit assumptions
- Transparent SNARKs from DARK compilers
- Trustworthy public randomness with sloth, unicorn, and trx
- Verifiable delay functions
- Verifiable delay functions from supersingular isogenies and pairings
This page was built for publication: A survey of two verifiable delay functions using proof of exponentiation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7318553)
