LESS is more: code-based signatures without syndromes
From MaRDI portal
Recommendations
- LESS-FM: fine-tuning signatures from the code equivalence problem
- Using LDGM codes and sparse syndromes to achieve digital signatures
- Code-Based Signature Schemes from Identification Protocols in the Rank Metric
- Post-quantum cryptography: Code-based signatures
- A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory
Cites work
- A new identification scheme based on syndrome decoding
- A zero-knowledge identification scheme based on the q-ary syndrome decoding problem
- Computing automorphism groups of error-correcting codes
- Digital Signatures
- Durandal: a rank metric based signature scheme
- Efficient signature generation by smart cards
- Finding the permutation between equivalent linear codes: the support splitting algorithm
- From Identification to Signatures, Tightly: A Framework and Generic Transforms
- Grover vs. McEliece
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 2081064 (Why is no real title available?)
- scientific article; zbMATH DE number 2086722 (Why is no real title available?)
- Identification protocols and signature schemes based on supersingular isogeny problems
- Improved identification schemes based on error-correcting codes
- Is code equivalence easy to decide?
- Lattice signatures without trapdoors
- McEliece and Niederreiter cryptosystems that resist quantum Fourier sampling attacks
- Non-interactive zero-knowledge proofs in the quantum random oracle model
- On the Dimension of the Hull
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Revisiting post-quantum Fiat-Shamir
- SeaSign: compact isogeny signatures from class group actions
- Security of the Fiat-Shamir transformation in the quantum random-oracle model
- SPHINCS: practical stateless hash-based signatures
- The hardness of code equivalence over F_q and its application to code-based cryptography
- Time/Space Trade-Offs for Reversible Computation
- Wave: a new family of trapdoor one-way preimage sampleable functions based on codes
Cited in
(53)- Cryptanalysis of a code-based full-time signature
- LESS-FM: fine-tuning signatures from the code equivalence problem
- On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography
- A code-based signature scheme from the Lyubashevsky framework
- An attack on a non-interactive key exchange from code equivalence
- Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature
- Using LDGM codes and sparse syndromes to achieve digital signatures
- Syndrome decoding in the head: shorter signatures from zero-knowledge 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
- Hardness estimates of the code equivalence problem in the rank metric
- Take your MEDS: digital signatures from matrix code equivalence
- Graph-theoretic algorithms for the alternating trilinear form equivalence problem
- MR-DSS -- smaller MinRank-based (ring-)signatures
- A code-based hybrid signcryption scheme
- On Linear Complexity of Finite Sequences: Coding Theory and Applications to Cryptography
- A High-Performance Hardware Implementation of the LESS Digital Signature Scheme
- Wave Parameter Selection
- Building MPCitH-based signatures from MQ, MinRank, and rank SD
- Algebraic algorithm for the alternating trilinear form equivalence problem
- Code-based secret handshake scheme, revisited
- 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
- \textsf{ReSolveD}: shorter signatures from regular syndrome decoding and VOLE-in-the-head
- Cutting the GRASS: threshold group action signature schemes
- Algorithms for matrix code and alternating trilinear form equivalences via new isomorphism invariants
- Lossy cryptography from code-based assumptions
- Correlation power analysis of LESS and CROSS
- Re-randomize and extract: a novel commitment construction framework based on group actions
- Lossy cryptography from code-based assumptions dense-sparse LPN: a new subexponentially hard LPN variant in SZK
- On linear equivalence, canonical forms, and digital signatures
- On the sample complexity of linear code equivalence for all code rates
- 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
- ZKFault: fault attack analysis on zero-knowledge based post-quantum digital signature schemes
- Rare structures in tensor graphs. Bermuda triangles for cryptosystems based on the tensor isomorphism problem
- Don't use it twice! Solving relaxed linear equivalence problems
- The code equivalence problem and its applications to cryptography
- Enhancing threshold group action signature schemes: adaptive security and scalability improvements
- An improved algorithm for code equivalence
- Relating code equivalence to other isomorphism problems
- On digital signatures based on group actions: QROM security and ring signatures
- Properties of lattice isomorphism as a cryptographic group action
- Tanuki: new frameworks for (concurrently secure) blind signatures from post-quantum group actions
- Post-quantum blind signature from standard group action assumptions and more
- Lie algebras and the security of cryptosystems based on classical varieties in disguise
- Post-quantum adaptor signatures with strong security from cryptographic group actions
- On the relation between the permutation equivalence problem for linear codes and the isomorphism problem for subspaces of quadratic forms
- A survey on code equivalence: the state-of-the-art and open questions
- Two is all it takes: asymptotic and concrete improvements for solving code equivalence
- Hardware acceleration of the LESS canonical form computation
- Post-quantum (partially) blind signatures from matrix code equivalence
- On the security of two blind signatures from code equivalence problems
This page was built for publication: LESS is more: code-based signatures without syndromes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5048961)
