Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Feneuil, Thibauld"'
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
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.
Publikováno v:
Designs, Codes & Cryptography; Feb2023, Vol. 91 Issue 2, p563-608, 46p
Publikováno v:
Advances in Cryptology – ASIACRYPT 2022 ISBN: 9783031229657
Advances in Cryptology-Asiacrypt 2022
ASIACRYPT 2022-28th International Conference on the Theory and Application of Cryptology and Information Security
ASIACRYPT 2022-28th International Conference on the Theory and Application of Cryptology and Information Security, Dec 2022, Taipei, Taiwan. pp.371-402, ⟨10.1007/978-3-031-22966-4_13⟩
Advances in Cryptology-Asiacrypt 2022
ASIACRYPT 2022-28th International Conference on the Theory and Application of Cryptology and Information Security
ASIACRYPT 2022-28th International Conference on the Theory and Application of Cryptology and Information Security, Dec 2022, Taipei, Taiwan. pp.371-402, ⟨10.1007/978-3-031-22966-4_13⟩
International audience; We propose (honest verifier) zero-knowledge arguments for the modular subset sum problem. Previous combinatorial approaches, notably one due to Shamir, yield arguments with cubic communication complexity (in the security param
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f0730a46e62e495ace99bb669892bcbf
https://doi.org/10.1007/978-3-031-22966-4_13
https://doi.org/10.1007/978-3-031-22966-4_13