Zero-knowledge proofs of knowledge are useful tools to design signature schemes. The
ongoing effort to build a quantum computer urges the cryptography community to develop …

This paper presents a code-based signature scheme based on the well-known syndrome
decoding (SD) problem. The scheme builds upon a recent line of research which uses the …

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 threat of a coming quantum computer motivates the research for new zero-knowledge
proof techniques for (or based on) post-quantum cryptographic problems. One of the few …

We introduce a new candidate post-quantum digital signature scheme from the regular
syndrome decoding (RSD) assumption, an established variant of the syndrome decoding …

Abstract The Restricted Syndrome Decoding Problem (R-SDP) cor-responds to the
Syndrome Decoding Problem (SDP) with the additional constraint that all entries of the …

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 …

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 work, we introduce a new code-based signature scheme, called FuLeeca, based on
the NP-hard problem of finding codewords of given Lee-weight. The scheme follows the …

The MPC-in-the-head introduced in has established itself as an important paradigm to
design efficient digital signatures. For instance, it has been leveraged in the Picnic scheme …