Efficient isogeny proofs using generic techniques
From MaRDI portal
Publication:6535120
DOI10.1007/978-3-031-33491-7_10zbMATH Open1540.9406MaRDI QIDQ6535120
Shai Levin, Yi-Fu Lai, Kelong Cong
Publication date: 10 November 2023
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
- BBQ: using AES in Picnic signatures
- Cryptographic hash functions from expander graphs
- Parallel collision search with cryptanalytic applications
- CSIDH: an efficient post-quantum commutative group action
- On the cost of computing isogenies between supersingular elliptic curves
- On oriented supersingular elliptic curves
- Compact, efficient and UC-secure isogeny-based oblivious transfer
- Delay encryption
- Banquet: short and fast signatures from AES
- Group signatures and more from isogenies and lattices: generic, simple, and efficient
- CSI-FiSh: efficient isogeny based signatures through class group computations
- Aurora: transparent succinct arguments for R1CS
- SeaSign: compact isogeny signatures from class group actions
- SQISign: compact post-quantum signatures from quaternions and isogenies
- Calamari and Falafl: logarithmic (linkable) ring signatures from isogenies and lattices
- Efficient Algorithms for Supersingular Isogeny Diffie-Hellman
- On the Non-malleability of the Fiat-Shamir Transform
- Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies
- Interactive Oracle Proofs
- Constructing elliptic curves of prime order
- Zero-Knowledge Proofs from Secure Multiparty Computation
- The Arithmetic of Elliptic Curves
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Constructing Isogenies between Elliptic Curves Over Finite Fields
- Ramanujan graphs and Hecke operators
- Fast Reed-Solomon Interactive Oracle Proofs of Proximity
- CSIDH on the Surface
- LegRoast: Efficient Post-quantum Signatures from the Legendre PRF
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
- Syndrome decoding in the head: shorter signatures from zero-knowledge proofs
- Password-authenticated key exchange from group actions
- A new isogeny representation and applications to cryptography
- SIDH proof of knowledge
- Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection
- What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable?
- Orion: zero knowledge proof with linear prover time
- Verifiable isogeny walks: towards an isogeny-based postquantum VDF
Related Items (2)
Proving knowledge of isogenies: a survey ⋮ Towards a quantum-resistant weak verifiable delay function
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)
