A zero-knowledge identification scheme based on the q-ary syndrome decoding problem
From MaRDI portal
Publication:3084253
DOI10.1007/978-3-642-19574-7_12zbMATH Open1292.94045OpenAlexW1495716978MaRDI QIDQ3084253FDOQ3084253
Authors: Pierre-Louis Cayrel, Pascal Véron, Sidi Mohamed El Yousfi Alaoui 
Publication date: 15 March 2011
Published in: Selected Areas in Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-19574-7_12
Recommendations
Cites Work
- Algebraic cryptanalysis of McEliece variants with compact keys
- Reducing Key Length of the McEliece Cryptosystem
- Compact McEliece keys from Goppa codes
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the inherent intractability of certain coding problems (Corresp.)
- Title not available (Why is that?)
- Identity-based identification and signature schemes using error correcting codes
- A new identification scheme based on syndrome decoding
- A New Efficient Threshold Ring Signature Scheme Based on Coding Theory
- Improved identification schemes based on error-correcting codes
- Limit distribution of the minimum distance of random linear codes
- Some new NP-complete coding problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- A new NP-complete problem and public-key identification
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (38)
- A code-based signature scheme from the Lyubashevsky framework
- Non-interactive secure computation of inner-product from LPN and LWE
- Quasi-dyadic Girault identification scheme
- Not enough less: an improved algorithm for solving code equivalence problems over \(\mathbb{F}_q\)
- Statistical zero-knowledge and analysis of rank-metric zero-knowledge proofs of knowledge
- Code-Based Signature Schemes from Identification Protocols in the Rank Metric
- From 5-pass \(\mathcal {MQ}\)-based identification to \(\mathcal {MQ}\)-based signatures
- A code-based undeniable signature scheme
- The return of the SDitH
- Full round zero-sum distinguishers on \textsf{TinyJAMBU}-128 and \textsf{TinyJAMBU}-192 keyed-permutation in the known-key setting
- Improving Efficiency of an ‘On the Fly’ Identification Scheme by Perfecting Zero-Knowledgeness
- Syndrome decoding in the head: shorter signatures from zero-knowledge proofs
- Attack on a code-based signature scheme from QC-LDPC codes
- A NP-complete problem in coding theory with application to code based cryptography
- Enhancing Code Based Zero-Knowledge Proofs Using Rank Metric
- An Attack on Some Signature Schemes Constructed from Five-Pass Identification Schemes
- A new key recovery attack on a code-based signature from the Lyubashevsky framework
- \textsf{ReSolveD}: shorter signatures from regular syndrome decoding and VOLE-in-the-head
- Zero knowledge protocols and signatures from the restricted syndrome decoding problem
- Short code-based one-out-of-many proofs and applications
- Reduction from sparse LPN to LPN, dual attack 3.0
- Extended security arguments for signature schemes
- A code-based hybrid signcryption scheme
- New results on the Stern identification and signature scheme
- Private interrogation of devices via identification codes
- Entanglement Between Hash Encodings and Signatures from ID Schemes with Non-binary Challenges: A Case Study on Lightweight Code-Based Signatures
- Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature
- Compact post-quantum signatures from proofs of knowledge leveraging structure for the \textsf{PKP, SD} and \textsf{RSD} problems
- Secret handshakes: full dynamicity, deniability and lattice-based design
- Chosen-ciphertext secure code-based threshold public key encryptions with short ciphertext
- High weight code-based signature scheme from QC-LDPC codes
- Generic error SDP and generic error CVE
- LESS is more: code-based signatures without syndromes
- Full cryptanalysis of the Chen identification protocol
- Cryptanalysis of a code-based full-time signature
- Densities of codes of various linearity degrees in translation-invariant metric spaces
- On the (in)security of optimized Stern-like signature schemes
- Improved information set decoding algorithms over Galois ring in the Lee metric
Uses Software
This page was built for publication: A zero-knowledge identification scheme based on the \(q\)-ary syndrome decoding problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3084253)
