LESS-FM: fine-tuning signatures from the code equivalence problem
From MaRDI portal
Publication:2118522
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
Cites work
- Computing automorphism groups of error-correcting codes
- Cryptographic group actions and applications
- Durandal: a rank metric based signature scheme
- Finding the permutation between equivalent linear codes: the support splitting algorithm
- Graph isomorphism in quasipolynomial time (extended abstract)
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- LESS is more: code-based signatures without syndromes
- SeaSign: compact isogeny signatures from class group actions
- 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
Cited in
(35)- On linear equivalence, canonical forms, and digital signatures
- Hardness estimates of the code equivalence problem in the rank metric
- A framework for group action-based multi-signatures and applications to LESS, MEDS, and ALTEQ
- A guide to the design of digital signatures based on cryptographic group actions
- Rare structures in tensor graphs. Bermuda triangles for cryptosystems based on the tensor isomorphism problem
- The code equivalence problem and its applications to cryptography
- Enhancing threshold group action signature schemes: adaptive security and scalability improvements
- Monomial isomorphism for tensors and applications to code equivalence problems
- On two modifications of the McEliece PKE and the CFS signature scheme
- Take your MEDS: digital signatures from matrix code equivalence
- 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
- On digital signatures based on group actions: QROM security and ring signatures
- Reducing signature size of matrix-code-based signature schemes
- 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
- Group factorisation for smaller signatures from cryptographic group actions
- \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
- Hollow LWE: a new spin. Unbounded updatable encryption from LWE and PCE
- An attack on a non-interactive key exchange from code equivalence
- Security of fixed-weight repetitions of special-sound multi-round interactive proofs
- 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
- A revision of CROSS security: proofs and attacks for multi-round Fiat-Shamir signatures
- LESS is more: code-based signatures without syndromes
- Building MPCitH-based signatures from MQ, MinRank, and rank SD
- \textsf{FuLeeca}: a Lee-based signature scheme
- Code-based secret handshake scheme, revisited
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)
