Verifiable isogeny walks: towards an isogeny-based postquantum VDF
From MaRDI portal
Publication:6618603
DOI10.1007/978-3-030-99277-4_21zbMATH Open1547.94334MaRDI QIDQ6618603
Mehdi Tibouchi, Francisco Rodríguez-Henríquez, Jorge Chavez-Saab
Publication date: 14 October 2024
supersingular elliptic curvesverifiable computationisogeny-based cryptographypostquantum cryptographyverifiable delay functionsSNARGs
Cites Work
- Improved generalized Atkin algorithm for computing square roots in finite fields
- Cryptographic hash functions from expander graphs
- Trustworthy public randomness with sloth, unicorn, and trx
- On isogeny graphs of supersingular elliptic curves over finite fields
- Simple proofs of sequential work
- Verifiable delay functions
- Tight verifiable delay functions
- Verifiable delay functions from supersingular isogenies and pairings
- Scalable zero knowledge with no trusted setup
- Endomorphisms of Abelian varieties over finite fields
- SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
- On the quaternion -isogeny path problem
- A Quantum Algorithm for Computing Isogenies between Supersingular Elliptic Curves
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Probabilistic checking of proofs
- Algebraic methods for interactive proof systems
- Interactive proofs and the hardness of approximating cliques
- Computationally Sound Proofs
- Ramanujan graphs and Hecke operators
- Simple verifiable delay functions
- Faster computation of isogenies of large prime degree
- Efficient verifiable delay functions
Related Items (4)
Efficient isogeny proofs using generic techniques ⋮ (Verifiable) delay functions from Lucas sequences ⋮ Robustly reusable fuzzy extractor from isogeny ⋮ Towards a quantum-resistant weak verifiable delay function
This page was built for publication: Verifiable isogeny walks: towards an isogeny-based postquantum VDF
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6618603)
