A Zero-Knowledge Identification Scheme Based on the q-ary Syndrome Decoding Problem

DOI10.1007/978-3-642-19574-7_12zbMath1292.94045OpenAlexW1495716978MaRDI QIDQ3084253

Sidi Mohamed El Yousfi Alaoui, Pierre-Louis Cayrel, Pascal Véron

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

zbMATH Keywords

identificationcode-based cryptographyzero-knowledgepost-quantum cryptographyStern's scheme

Mathematics Subject Classification ID

Cryptography (94A60) Decoding (94B35) Authentication, digital signatures and secret sharing (94A62)

Related Items (22)

Not enough less: an improved algorithm for solving code equivalence problems over \(\mathbb{F}_q\) ⋮ LESS is More: Code-Based Signatures Without Syndromes ⋮ Compact post-quantum signatures from proofs of knowledge leveraging structure for the \textsf{PKP, SD} and \textsf{RSD} problems ⋮ Attack on a code-based signature scheme from QC-LDPC codes ⋮ A new key recovery attack on a code-based signature from the Lyubashevsky framework ⋮ From 5-Pass $$\mathcal {MQ}$$-Based Identification to $$\mathcal {MQ}$$-Based Signatures ⋮ The return of the SDitH ⋮ Syndrome decoding in the head: shorter signatures from zero-knowledge proofs ⋮ Code-Based Signature Schemes from Identification Protocols in the Rank Metric ⋮ A code-based signature scheme from the Lyubashevsky framework ⋮ Chosen-ciphertext secure code-based threshold public key encryptions with short ciphertext ⋮ 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 ⋮ Non-interactive secure computation of inner-product from LPN and LWE ⋮ A code-based hybrid signcryption scheme ⋮ Statistical zero-knowledge and analysis of rank-metric zero-knowledge proofs of knowledge ⋮ Secret handshakes: full dynamicity, deniability and lattice-based design ⋮ Cryptanalysis of a code-based full-time signature ⋮ A NP-Complete Problem in Coding Theory with Application to Code Based Cryptography ⋮ Extended security arguments for signature schemes ⋮ Full Cryptanalysis of the Chen Identification Protocol

Uses Software

• McEliece

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some new NP-complete coding problems
• Improved identification schemes based on error-correcting codes
• A new NP-complete problem and public-key identification
• A New Efficient Threshold Ring Signature Scheme Based on Coding Theory
• 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
• On the inherent intractability of certain coding problems (Corresp.)
• A new identification scheme based on syndrome decoding
• Limit distribution of the minimum distance of random linear codes

This page was built for publication: A Zero-Knowledge Identification Scheme Based on the q-ary Syndrome Decoding Problem