LESS-FM: fine-tuning signatures from the code equivalence problem
From MaRDI portal
Publication:2118522
DOI10.1007/978-3-030-81293-5_2zbMath1485.94128OpenAlexW3183297888MaRDI QIDQ2118522
Jean-François Biasse, Edoardo Persichetti, Alessandro Barenghi, Paolo Maria Santíni
Publication date: 22 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-81293-5_2
Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items
Compact post-quantum signatures from proofs of knowledge leveraging structure for the \textsf{PKP, SD} and \textsf{RSD} problems, Syndrome decoding in the head: shorter signatures from zero-knowledge proofs, On the computational hardness of the code equivalence problem in cryptography, Hardness estimates of the code equivalence problem in the rank metric, An attack on a non-interactive key exchange from code equivalence, MR-DSS -- smaller MinRank-based (ring-)signatures, Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature
Uses Software
Cites Work
- 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
- Durandal: a rank metric based signature scheme
- SeaSign: compact isogeny signatures from class group actions
- Cryptographic group actions and applications
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Computing automorphism groups of error-correcting codes
- Finding the permutation between equivalent linear codes: the support splitting algorithm
- LESS is More: Code-Based Signatures Without Syndromes
- Graph isomorphism in quasipolynomial time [extended abstract]
