4 citations · 10 across the 7 of their papers we have counts for
8 papers · 1 filter
MIRA: a Digital Signature Scheme based on the MinRank problem and the MPC-in-the-Head paradigm
Nicolas Aragon, Loïc Bidoux, Jesús-Javier Chi-Domínguez +4
We exploit the idea of [Fen22] which proposes to build an efficient signature scheme based on a zero-knowledge proof of knowledge of a solution of a MinRank instance. The scheme us…
RYDE: A Digital Signature Scheme based on Rank-Syndrome-Decoding Problem with MPCitH Paradigm
Loïc Bidoux, Jesús-Javier Chi-Domínguez, Thibauld Feneuil +4
We present a signature scheme based on the Syndrome-Decoding problem in rank metric. It is a construction from multi-party computation (MPC), using a MPC protocol which is a slight…
Post-Quantum Oblivious Transfer from Smooth Projective Hash Functions with Grey Zone
Slim Bettaieb, Loïc Bidoux, Olivier Blazy +2
Oblivious Transfer (OT) is a major primitive for secure multiparty computation. Indeed, combined with symmetric primitives along with garbled circuits, it allows any secure functio…
RQC revisited and more cryptanalysis for Rank-based Cryptography
Loïc Bidoux, Pierre Briaud, Maxime Bros +1
We propose two main contributions: first, we revisit the encryption scheme Rank Quasi-Cyclic (RQC) by introducing new efficient variations, in particular, a new class of codes, the…
Compact Post-Quantum Signatures from Proofs of Knowledge leveraging Structure for the PKP, SD and RSD Problems
Loïc Bidoux, Philippe Gaborit
The MPC-in-the-head introduced in [IKOS07] has established itself as an important paradigm to design efficient digital signatures. It has been leveraged in the Picnic scheme [CDG+…
Code-based Signatures from New Proofs of Knowledge for the Syndrome Decoding Problem
Loïc Bidoux, Philippe Gaborit, Mukul Kulkarni +1
In this paper, we study code-based signatures constructed from Proof of Knowledge (PoK). This line of work can be traced back to Stern who introduces the first efficient PoK for th…