Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Bidoux, Loic"'
Autor:
Bidoux, Loïc, Chi-Domínguez, Jesús-Javier, Feneuil, Thibauld, Gaborit, Philippe, Joux, Antoine, Rivain, Matthieu, Vinçotte, Adrien
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 improvement of the linearized-polynomial protocol used in [Fen22], al
Externí odkaz:
http://arxiv.org/abs/2307.08726
Autor:
Aragon, Nicolas, Bidoux, Loïc, Chi-Domínguez, Jesús-Javier, Feneuil, Thibauld, Gaborit, Philippe, Neveu, Romaric, Rivain, Matthieu
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 uses the MPCitH paradigm, which is an efficient way to build ZK proofs.
Externí odkaz:
http://arxiv.org/abs/2307.08575
Oblivious Transfer (OT) is a major primitive for secure multiparty computation. Indeed, combined with symmetric primitives along with garbled circuits, it allows any secure function evaluation between two parties. In this paper, we propose a new appr
Externí odkaz:
http://arxiv.org/abs/2209.04149
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 Augmented Gabidulin codes; second, we propose new attacks against the
Externí odkaz:
http://arxiv.org/abs/2207.01410
Autor:
Bidoux, Loïc, Gaborit, Philippe
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+ 20] that reached the third round of the NIST PQC Standardization proce
Externí odkaz:
http://arxiv.org/abs/2204.02915
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 the syndrome decoding problem in 1993. Afterward, different variations w
Externí odkaz:
http://arxiv.org/abs/2201.05403
The ongoing NIST standardization process has shown that Proof of Knowledge (PoK) based signatures have become an important type of possible post-quantum signatures. Regarding code-based cryptography, the original approach for PoK based signatures is
Externí odkaz:
http://arxiv.org/abs/2110.05005
Publikováno v:
ARES 2021 - 16th International Conference on Availability, Reliability and Security, Aug 2021, Vienna, Austria. pp.1-12
Decision forests are classical models to efficiently make decision on complex inputs with multiple features. While the global structure of the trees or forests is public, sensitive information have to be protected during the evaluation of some client
Externí odkaz:
http://arxiv.org/abs/2108.08546
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.