Efficient isogeny proofs using generic techniques
From MaRDI portal
Recommendations
Cites work
- A new isogeny representation and applications to cryptography
- Aurora: transparent succinct arguments for R1CS
- Banquet: short and fast signatures from AES
- BBQ: using AES in Picnic signatures
- Calamari and Falafl: logarithmic (linkable) ring signatures from isogenies and lattices
- Compact, efficient and UC-secure isogeny-based oblivious transfer
- Constructing elliptic curves of prime order
- Constructing Isogenies between Elliptic Curves Over Finite Fields
- Cryptographic hash functions from expander graphs
- CSI-FiSh: efficient isogeny based signatures through class group computations
- CSIDH on the surface
- CSIDH: an efficient post-quantum commutative group action
- Delay encryption
- Efficient Algorithms for Supersingular Isogeny Diffie-Hellman
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- Elliptic curves. Number theory and cryptography
- Fast Reed-Solomon interactive oracle proofs of proximity
- Group signatures and more from isogenies and lattices: generic, simple, and efficient
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 5485433 (Why is no real title available?)
- Interactive oracle proofs
- LegRoast: efficient post-quantum signatures from the Legendre PRF
- On oriented supersingular elliptic curves
- On the cost of computing isogenies between supersingular elliptic curves
- On the Non-malleability of the Fiat-Shamir Transform
- Orion: zero knowledge proof with linear prover time
- Parallel collision search with cryptanalytic applications
- Password-authenticated key exchange from group actions
- Ramanujan graphs and Hecke operators
- SeaSign: compact isogeny signatures from class group actions
- SIDH proof of knowledge
- SQISign: compact post-quantum signatures from quaternions and isogenies
- Syndrome decoding in the head: shorter signatures from zero-knowledge proofs
- The Arithmetic of Elliptic Curves
- Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
- Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
- Verifiable isogeny walks: towards an isogeny-based postquantum VDF
- What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable?
- Zero-knowledge proofs from secure multiparty computation
- Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection
Cited in
(10)- Supersingular curves you can trust
- Proving knowledge of isogenies: a survey
- Verifiable isogeny walks: towards an isogeny-based postquantum VDF
- Towards a quantum-resistant weak verifiable delay function
- Generating supersingular elliptic curves over \(\mathbb{F}_p\) with unknown endomorphism ring
- More efficient isogeny proofs of knowledge via canonical modular polynomials
- Tanuki: new frameworks for (concurrently secure) blind signatures from post-quantum group actions
- Faster proofs and VRFs from isogenies
- On the use of Atkin and Weber modular polynomials in isogeny proofs of knowledge
- Erebor and Durian: full anonymous ring signatures from quaternions and isogenies
This page was built for publication: Efficient isogeny proofs using generic techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535120)
