Zobrazeno 1 - 10
of 5 308
pro vyhledávání: '"Gaborit"'
Publikováno v:
Acta Acustica, Vol 8, p E1 (2024)
Externí odkaz:
https://doaj.org/article/e414fde37b6f45d69b23bd83cc0b20c7
Publikováno v:
Acta Acustica, Vol 7, p E1 (2023)
Externí odkaz:
https://doaj.org/article/df16732de7274c259b3c1df6834153a9
The McEliece scheme is a generic frame which allows to use any error correcting code of which there exists an efficient decoding algorithm to design an encryption scheme by hiding the generator matrix code. Similarly, the Niederreiter frame is the du
Externí odkaz:
http://arxiv.org/abs/2405.16539
In rank-metric cryptography, a vector from a finite dimensional linear space over a finite field is viewed as the linear space spanned by its entries. The rank decoding problem which is the analogue of the problem of decoding a random linear code con
Externí odkaz:
http://arxiv.org/abs/2310.08962
Publikováno v:
Acta Acustica, Vol 4, Iss 3, p 8 (2020)
The properties of the materials used for building sound proofing systems are known to exhibit large variations. These may lead to significant differences in the acoustic responses within a given material batch, particularly when resistive screens are
Externí odkaz:
https://doaj.org/article/3d528d1c91034b75ad74b2a0e5b9b53e
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