A new path to code-based signatures via identification schemes with restricted errors

DOI10.3934/AMC.2024058MaRDI QIDQ6981195zbMATH OpenFDO

Authors Marco Baldi, Massimo Battaglioni, Franco Chiaraluce, Anna-Lena Horlemann, Edoardo Persichetti, Paolo Santini, Violetta Weger

Publication date 21 May 2025

Published in Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/AMC.2024058

zbMATH Keywords

boundscoding theorydecoding problemsrestricted errors

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Bounds on codes (94B65)

Cites work

• A class of codes for asymmetric channels and a problem from the additive theory of numbers
• A probabilistic algorithm for computing minimum weights of large error-correcting codes
• A zero-knowledge identification scheme based on the q-ary syndrome decoding problem
• Algebraic coding theory
• Asymmetric/unidirectional error correcting and detecting codes
• Codes Correcting a Burst of Deletions or Insertions
• Codes correcting phased burst erasures
• Codes for Asymmetric Limited-Magnitude Errors With Application to Multilevel Flash Memories
• Codes over Gaussian integers
• Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
• Decoding random linear codes in \(\tilde{\mathcal{O}}(2^{0.054n})\)
• Generic error SDP and generic error CVE
• scientific article; zbMATH DE number 4070796 (Why is no real title available?)
• scientific article; zbMATH DE number 4112524 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• Introduction to Coding Theory
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems
• Maximum distance<tex>q</tex>-nary codes
• New Results on Codes Correcting Single Error of Limited Magnitude for Flash Memory
• On some perfect codes with respect to Lee metric
• On the inherent intractability of certain coding problems (Corresp.)
• Optimal, Systematic, $q$-Ary Codes Correcting All Asymmetric and Symmetric Errors of Limited Magnitude
• Phased burst error-correcting array codes
• Smaller decoding exponents: ball-collision decoding
• Some new NP-complete coding problems
• Two decoding algorithms for linear codes
• Zero knowledge protocols and signatures from the restricted syndrome decoding problem

Cited in

(1)

• Cross-paradigm models of restricted syndrome decoding with application to CROSS

This page was built for publication: A new path to code-based signatures via identification schemes with restricted errors

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