Scholarlink

<p>We present a signature scheme based on the syndrome decoding (SD) 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 Feneuil (Cryptology ePrint Archive, Report 2022/1512, 2022), allowing to obtain a zero-knowledge proof thanks to the MPCitH (MPC-in-the-Head) paradigm. We design two different zero-knowledge proofs exploiting this paradigm: the first, which reaches the lower communication costs, relies on additive secret sharing and uses the hypercube technique (Aguilar-Melchor et al., in: Cryptology ePrint Archive, Report 2022/1645, 2022); and the second relies on low-threshold linear secret sharing as proposed in Feneuil (Cryptology ePrint Archive, Report 2022/1512, 2022). These proofs of knowledge are transformed to signature schemes thanks to the Fiat–Shamir transform (Fiat and Shamir, in: International Cryptology Conference (CRYPTO), 1986) and the resulting schemes have signatures of size less than 6&#xa0;kB. These performances prompted us to propose this signature scheme to the post-quantum cryptography standardization process organized by NIST.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

RYDE: a digital signature scheme based on rank syndrome decoding problem with MPC-in-the-Head paradigm

  • 期刊论文

  • 发表日期：

    2025年1月4日

查看全文
  • Loïc Bidoux,
  • Jesús-Javier Chi-Domínguez,
  • Thibauld Feneuil,
  • Philippe Gaborit,
  • Antoine Joux,
  • Matthieu Rivain,
  • Adrien Vinçotte

摘要

We present a signature scheme based on the syndrome decoding (SD) 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 Feneuil (Cryptology ePrint Archive, Report 2022/1512, 2022), allowing to obtain a zero-knowledge proof thanks to the MPCitH (MPC-in-the-Head) paradigm. We design two different zero-knowledge proofs exploiting this paradigm: the first, which reaches the lower communication costs, relies on additive secret sharing and uses the hypercube technique (Aguilar-Melchor et al., in: Cryptology ePrint Archive, Report 2022/1645, 2022); and the second relies on low-threshold linear secret sharing as proposed in Feneuil (Cryptology ePrint Archive, Report 2022/1512, 2022). These proofs of knowledge are transformed to signature schemes thanks to the Fiat–Shamir transform (Fiat and Shamir, in: International Cryptology Conference (CRYPTO), 1986) and the resulting schemes have signatures of size less than 6 kB. These performances prompted us to propose this signature scheme to the post-quantum cryptography standardization process organized by NIST.