SIDH proof of knowledge
From MaRDI portal
Publication:6132414
Recommendations
- Identification protocols and signature schemes based on supersingular isogeny problems
- A new adaptive attack on SIDH
- Identification protocols and signature schemes based on supersingular isogeny problems
- SHealS and HealS: Isogeny-Based PKEs from a Key Validation Method for SIDH
- Sigma protocols for MQ, PKP and SIS, and fishy signature schemes
Cites work
- scientific article; zbMATH DE number 1031002 (Why is no real title available?)
- scientific article; zbMATH DE number 3356934 (Why is no real title available?)
- A Post-quantum Digital Signature Scheme Based on Supersingular Isogenies
- A modular analysis of the Fujisaki-Okamoto transformation
- A new adaptive attack on SIDH
- CSIDH on the surface
- Computational problems in supersingular elliptic curve isogenies
- Efficient concurrent zero-knowledge in the auxiliary string model
- Identification protocols and signature schemes based on supersingular isogeny problems
- Isogeny-based quantum-resistant undeniable signatures
- New techniques for SIDH-based NIKE
- Oblivious pseudorandom functions from isogenies
- On adaptive attacks against Jao-Urbanik's isogeny-based protocol
- On the Security of Supersingular Isogeny Cryptosystems
- Post-quantum static-static key agreement using multiple protocol instances
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Strengthening zero-knowledge protocols using signatures
- The Arithmetic of Elliptic Curves
- Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
- Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
Cited in
(11)- Sigma protocols for MQ, PKP and SIS, and fishy signature schemes
- Parallel isogeny path finding with limited memory
- Supersingular curves you can trust
- Proving knowledge of isogenies: a survey
- Efficient isogeny proofs using generic techniques
- Efficiency of SIDH-based signatures (yes, SIDH)
- An algorithm for efficient detection of \((N, N)\)-splittings and its application to the isogeny problem in dimension 2
- Isogeny problems with level structure
- Compressed M-SIDH: an instance of compressed SIDH-like schemes with isogenies of highly composite degrees
- Exploring SIDH-based signature parameters
- New SIDH countermeasures for a more efficient key exchange
This page was built for publication: SIDH proof of knowledge
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6132414)