More efficient isogeny proofs of knowledge via canonical modular polynomials
From MaRDI portal
Cites work
- \textsf{POKÉ}: a compact and efficient PKE from higher-dimensional isogenies
- A unified framework for non-universal SNARKs
- Aurora: transparent succinct arguments for R1CS
- Brakedown: linear-time and field-agnostic SNARKs for R1CS
- Computing the number of points on an elliptic curve over a finite field: algorithmic aspects
- Cryptographic hash functions from expander graphs
- CSI-FiSh: efficient isogeny based signatures through class group computations
- CSIDH: an efficient post-quantum commutative group action
- Cycles in the Supersingular ℓ-Isogeny Graph and Corresponding Endomorphisms
- Delay encryption
- Efficient isogeny proofs using generic techniques
- Elliptic curves. Number theory and cryptography
- Handbook of Elliptic and Hyperelliptic Curve Cryptography
- scientific article; zbMATH DE number 4006420 (Why is no real title available?)
- scientific article; zbMATH DE number 12258 (Why is no real title available?)
- scientific article; zbMATH DE number 1210367 (Why is no real title available?)
- scientific article; zbMATH DE number 3995866 (Why is no real title available?)
- scientific article; zbMATH DE number 6164023 (Why is no real title available?)
- Identification protocols and signature schemes based on supersingular isogeny problems
- Isogeny volcanoes
- LaBRADOR: compact proofs for R1CS from Module-SIS
- Legendre elliptic curves over finite fields
- Libra: succinct zero-knowledge proofs with optimal prover computation
- M-SIDH and MD-SIDH: countering SIDH attacks by masking information
- Neighborhood of the supersingular elliptic curve isogeny graph at j = 0 and 1728
- On isogeny graphs of supersingular elliptic curves over finite fields
- On the size of pairing-based non-interactive arguments
- Orion: zero knowledge proof with linear prover time
- Practical robust DKG protocols for CSIDH
- Practical sublinear proofs for R1CS from lattices
- Proving knowledge of isogenies: a survey
- Ramanujan graphs and Hecke operators
- Ramanujan graphs in cryptography
- SIDH proof of knowledge
- SILBE: an updatable public key encryption scheme from lollipop attacks
- SQISign: compact post-quantum signatures from quaternions and isogenies
- Supersingular curves with small noninteger endomorphisms
- Supersingular curves you can trust
- Supersingular j-invariants as singular moduli mod p
- The Arithmetic of Elliptic Curves
- The elliptic functions and their applications. Second part: The algebraic explanations
- The Power of Proofs-of-Possession: Securing Multiparty Signatures against Rogue-Key Attacks
- Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
- Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
- Updatable and universal common reference strings with applications to zk-SNARKs
- Verifiable delay functions
- Verifiable delay functions from supersingular isogenies and pairings
- Verifiable isogeny walks: towards an isogeny-based postquantum VDF
- VSS from distributed ZK proofs and applications
This page was built for publication: More efficient isogeny proofs of knowledge via canonical modular polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6864054)
