Cryptanalysis of a code-based one-time signature
In [\textit{V. Lyubashevsky}, Eurocrypt 2012, Lect. Notes Comput. Sci. 7237, 738--755 (2012; Zbl 1239.94002)] a new method for obtaining digital signatures from lattice assumptions was proposed, that does not require the use of a trapdoor. Recently, \textit{E. Persichetti} proposed an efficient adaptation of this method based on quasi-cyclic codes [``Efficient one-time signatures from quasi-cyclic codes: a full treatment, Cryptography 2, No. 4, 30 (2018; \url{doi:10.3390/cryptography2040030})]. The paper under review provides evidences that a direct translation of Lyubashevsky's framework to build signatures without trapdoors from lattice assumptions to coding theory assumptions can only yield insecure signatures. It presents a general adaptation of Lyubashevsky's framework to coding theory, not restricted to specific codes. It express the key recovery from a single signature as a decoding problem, and arguing that this problem is efficiently solvable, and an algorithm to solve this problem is presented. Furthermore, a full cryptanalysis of all the parameters of Persichetti's one-time signature scheme based upon an adaptation of Lyubashevsky's framework is given. It is also shown that the attack recovers the signing key of the most secure instance (\(n = 9857\), 128 bits of security) in \(\approx 450ms\) (versus \(100ms\) for signature verification).
- Asymptotically efficient lattice-based digital signatures
- Asymptotically Efficient Lattice-Based Digital Signatures
- Lattice signatures without trapdoors
- Lattice signatures and bimodal Gaussians
- Lattice-based signcryption without random oracles
- Public Key Cryptography - PKC 2005
- Analysis of error terms of signatures based on learning with errors
- Transcript secure signatures based on modular lattices
- scientific article; zbMATH DE number 4179279
- Efficient Encryption From Random Quasi-Cyclic Codes
- scientific article; zbMATH DE number 1722680 (Why is no real title available?)
- scientific article; zbMATH DE number 3174791 (Why is no real title available?)
- Lattice signatures without trapdoors
- On the inherent intractability of certain coding problems (Corresp.)
- Ouroboros: a simple, secure and efficient key exchange protocol based on coding theory
- Security arguments for digital signatures and blind signatures
- Trapdoors for hard lattices and new cryptographic constructions
- Cryptanalysis of a code-based full-time signature
- Wave: a new family of trapdoor one-way preimage sampleable functions based on codes
- A code-based signature scheme from the Lyubashevsky framework
- Cryptanalysis of a rank-based signature with short public keys
- An efficient attack on a code-based signature scheme
- scientific article; zbMATH DE number 7141562 (Why is no real title available?)
- Ternary forking lemma and its application to the analysis of one code-based signature
- \textsf{FuLeeca}: a Lee-based signature scheme
- SPANSE: combining sparsity with density for efficient one-time code-based digital signatures
- Breaking HWQCS: a code-based signature scheme from high weight QC-LDPC codes
This page was built for publication: Cryptanalysis of a code-based one-time signature
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2200516)
