A zero-knowledge proof for the syndrome decoding problem in the Lee metric

MaRDI QIDQ7230887zbMATH OpenFDO

Authors Kovačević Mladen, Tatjana Grbić, Darko Čapko, Nemanja Nedić, S. Vukmirović

Publication date 21 April 2026

Published in Transactions on Mathematical Cryptology (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://journals.flvc.org/mathcryptology/article/view/139059

zbMATH Keywords

code-based cryptographyidentification schemeLee metricsyndrome decodingzero-knowledge proof

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Cites work

• A new identification scheme based on syndrome decoding
• Classical and quantum algorithms for generic syndrome decoding problems and applications to the Lee metric
• Code-based signatures from new proofs of knowledge for the syndrome decoding problem
• Coin flipping by telephone a protocol for solving impossible problems
• Compact post-quantum signatures from proofs of knowledge leveraging structure for the \textsf{PKP, SD} and \textsf{RSD} problems
• Foundations of Cryptography
• Generic Decoding in the Sum-Rank Metric
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• scientific article; zbMATH DE number 3989251 (Why is no real title available?)
• Improved information set decoding algorithms over Galois ring in the Lee metric
• Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications
• Information set decoding in the Lee metric with applications to cryptography
• Non-Binary Error Correction Codes*
• On channels and codes for the Lee metric
• On the (in)security of optimized Stern-like signature schemes
• On the Hardness of the Decoding and the Minimum Distance Problems for Rank Codes
• On the hardness of the Lee syndrome decoding problem
• On the inherent intractability of certain coding problems (Corresp.)
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Publicly verifiable zero-knowledge and post-quantum signatures from VOLE-in-the-head
• Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature
• Some new NP-complete coding problems
• The knowledge complexity of interactive proof-systems
• Zero knowledge protocols and signatures from the restricted syndrome decoding problem

This page was built for publication: A zero-knowledge proof for the syndrome decoding problem in the Lee metric

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7230887)