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

DOI10.1007/978-3-642-19574-7_12zbMath1292.94045MaRDI 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

identification; code-based cryptography; zero-knowledge; post-quantum cryptography; Stern's scheme

Mathematics Subject Classification ID

94A60: Cryptography

94B35: Decoding

94A62: Authentication, digital signatures and secret sharing

Related Items

LESS is More: Code-Based Signatures Without Syndromes, A NP-Complete Problem in Coding Theory with Application to Code Based Cryptography, Extended security arguments for signature schemes, 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, Syndrome decoding in the head: shorter signatures from zero-knowledge proofs, Code-Based Signature Schemes from Identification Protocols in the Rank Metric, Non-interactive secure computation of inner-product from LPN and LWE, A code-based hybrid signcryption scheme, Not enough less: an improved algorithm for solving code equivalence problems over \(\mathbb{F}_q\), Cryptanalysis of a code-based full-time signature, A code-based signature scheme from the Lyubashevsky framework, Statistical zero-knowledge and analysis of rank-metric zero-knowledge proofs of knowledge, Secret handshakes: full dynamicity, deniability and lattice-based design, From 5-Pass $$\mathcal {MQ}$$-Based Identification to $$\mathcal {MQ}$$-Based Signatures, Full Cryptanalysis of the Chen Identification Protocol

Uses Software

• McEliece

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item