(Verifiable) delay functions from Lucas sequences
From MaRDI portal
Publication:6587959
DOI10.1007/978-3-031-48624-1_13zbMATH Open1546.94077MaRDI QIDQ6587959
Unnamed Author, Chethan Kamath, Pavel Hubáček, Tomáš Krňák
Publication date: 15 August 2024
Cites Work
- Unnamed Item
- Unnamed Item
- Transaction protection by beacons
- A key-exchange system based on imaginary quadratic fields
- Trustworthy public randomness with sloth, unicorn, and trx
- Simple proofs of sequential work
- Verifiable delay functions
- An extended theory of Lucas' functions.
- Continuous verifiable delay functions
- Generic-group delay functions require hidden-order groups
- Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
- Tight verifiable delay functions
- On the security of time-lock puzzles and timed commitments
- Time- and space-efficient arguments from groups of unknown order
- Homomorphic time-lock puzzles and applications
- Verifiable delay functions from supersingular isogenies and pairings
- Reversible proofs of sequential work
- Incremental proofs of sequential work
- Time-Lock Puzzles from Randomized Encodings
- Publicly verifiable proofs of sequential work
- The Group of Signed Quadratic Residues and Applications
- Modular exponentiation via the explicit Chinese remainder theorem
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- The Knowledge Complexity of Interactive Proof Systems
- A p + 1 Method of Factoring
- Breaking RSA may not be equivalent to factoring
- Algebraic methods for interactive proof systems
- My Numbers, My Friends
- Simple verifiable delay functions
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
- Breaking RSA Generically Is Equivalent to Factoring
- Advances in Cryptology - ASIACRYPT 2003
- Prime numbers and computer methods for factorization
- Efficient verifiable delay functions
- Efficient verifiable delay functions
- Practical statistically-sound proofs of exponentiation in any group
- Parallelizable delegation from LWE
- Short-lived zero-knowledge proofs and signatures
- PPAD is as hard as LWE and iterated squaring
- Lattice-based succinct arguments from vanishing polynomials (extended abstract)
- Lattice-based timed cryptography
- Verifiable isogeny walks: towards an isogeny-based postquantum VDF
This page was built for publication: (Verifiable) delay functions from Lucas sequences
