On the security of two blind signatures from code equivalence problems
From MaRDI portal
Cites work
- A framework for group action-based multi-signatures and applications to LESS, MEDS, and ALTEQ
- Algebraic algorithm for the alternating trilinear form equivalence problem
- Cutting the GRASS: threshold group action signature schemes
- Cyclic Matrices Over Finite Fields
- Don't use it twice! Solving relaxed linear equivalence problems
- Enhancing threshold group action signature schemes: adaptive security and scalability improvements
- Hardness estimates of the code equivalence problem in the rank metric
- LESS is more: code-based signatures without syndromes
- New complexity estimation on the rainbow-band-separation attack
- Non-interactive commitment from non-transitive group actions
- On the computational hardness of the code equivalence problem in cryptography
- Polynomial-time algorithms for quadratic isomorphism of polynomials: the regular case
- Re-randomize and extract: a novel commitment construction framework based on group actions
- Relating code equivalence to other isomorphism problems
- Solving the tensor isomorphism problem for special orbits with low rank points: cryptanalysis and repair of an Asiacrypt 2023 commitment scheme
- Stein's method and the rank distribution of random matrices over finite fields
- Take your MEDS: digital signatures from matrix code equivalence
- The hardness of code equivalence over F_q and its application to code-based cryptography
- The Magma algebra system. I: The user language
This page was built for publication: On the security of two blind signatures from code equivalence problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7391810)
