LESS-FM: fine-tuning signatures from the code equivalence problem
From MaRDI portal
Publication:2118522
DOI10.1007/978-3-030-81293-5_2zbMATH Open1485.94128OpenAlexW3183297888MaRDI QIDQ2118522FDOQ2118522
Authors: Alessandro Barenghi, Jean-François Biasse, Edoardo Persichetti, P. M. Santini 
Publication date: 22 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-81293-5_2
Recommendations
- LESS is more: code-based signatures without syndromes
- Not enough less: an improved algorithm for solving code equivalence problems over \(\mathbb{F}_q\)
- Post-quantum cryptography: Code-based signatures
- A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory
- Code-Based Signature Schemes from Identification Protocols in the Rank Metric
Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Finding the permutation between equivalent linear codes: the support splitting algorithm
- Graph isomorphism in quasipolynomial time [extended abstract]
- Sigma protocols for MQ, PKP and SIS, and fishy signature schemes
- Wave: a new family of trapdoor one-way preimage sampleable functions based on codes
- SeaSign: compact isogeny signatures from class group actions
- Durandal: a rank metric based signature scheme
- Computing automorphism groups of error-correcting codes
- LESS is More: Code-Based Signatures Without Syndromes
- Cryptographic group actions and applications
Cited In (20)
- Monomial isomorphism for tensors and applications to code equivalence problems
- On two modifications of the McEliece PKE and the CFS signature scheme
- SPANSE: combining sparsity with density for efficient one-time code-based digital signatures
- A new formulation of the linear equivalence problem and shorter less signatures
- On Linear Complexity of Finite Sequences: Coding Theory and Applications to Cryptography
- Post-quantum cryptography: Code-based signatures
- Syndrome decoding in the head: shorter signatures from zero-knowledge proofs
- Representations of group actions and their applications in cryptography
- MR-DSS -- smaller MinRank-based (ring-)signatures
- \textsf{ReSolveD}: shorter signatures from regular syndrome decoding and VOLE-in-the-head
- Cutting the GRASS: threshold group action signature schemes
- Using LDGM codes and sparse syndromes to achieve digital signatures
- An attack on a non-interactive key exchange from code equivalence
- Entanglement Between Hash Encodings and Signatures from ID Schemes with Non-binary Challenges: A Case Study on Lightweight Code-Based Signatures
- On the computational hardness of the code equivalence problem in cryptography
- Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature
- Compact post-quantum signatures from proofs of knowledge leveraging structure for the \textsf{PKP, SD} and \textsf{RSD} problems
- Building MPCitH-based signatures from MQ, MinRank, and rank SD
- Code-based secret handshake scheme, revisited
- Hardness estimates of the code equivalence problem in the rank metric
Uses Software
This page was built for publication: LESS-FM: fine-tuning signatures from the code equivalence problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118522)
