In this paper, we show how to use the Matrix Code Equivalence (MCE) problem as a new
basis to construct signature schemes. This extends previous work on using isomorphism …

The MPC-in-the-Head paradigm is instrumental in building zero-knowledge proof systems
and post-quantum signatures using techniques from secure multi-party computation. In this …

In the light of NIST's announced reopening of the call for digital signature proposals in 2023
due to lacking diversity, there is a strong need for constructions based on other established …

Code equivalence is a well-known concept in coding theory. Recently, literature saw an
increased interest in this notion, due to the introduction of protocols based on the hardness …

The estimation of the computational complexity of hard problems is essential for determining
secure parameters for cryptographic systems. To date, those estimations are often …

Abstract The Linear Equivalence Problem (LEP) asks to find a linear isometry between a
given pair of linear codes; in the Hamming weight this is known as a monomial map. LEP …

Group actions are fundamental mathematical tools, with a long history of use in
cryptography. Indeed, the action of finite groups at the basis of the discrete logarithm …

In this paper, we take inspiration from an invited talk presented at CBCrypto'23 to design
identification protocols and signature schemes from group actions using the MPC-in-the …

We devise algorithms for finding equivalences of trilinear forms over finite fields modulo
linear group actions. Our focus is on two problems under this umbrella, Matrix Code …

Abstract We present TRIFORS (TRIlinear FOrms Ring Signature), a logarithmic post-
quantum (linkable) ring signature based on a novel assumption regarding the equivalence …