arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2307.08575cs.CR
收藏

MIRA:一种基于 MinRank 问题和 MPC-in-the-Head 范式的数字签名方案

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, Thibauld Feneuil, Philippe Gaborit, Romaric Neveu, Matthieu Rivain

AI总结:

本文结合 MinRank 零知识证明、MPCitH 范式与超立方体或阈值秘密共享技术,提出 MIRA-Additive 和 MIRA-Threshold 两种数字签名方案,并给出优化与安全性证明。

摘要:

我们利用了 [Fen22] 的思想,该文提出基于对 MinRank 实例解的知识的零知识证明来构建高效签名方案。该方案采用 MPCitH 范式,这是构建 ZK 证明的一种高效方式。我们将这一思想与另一思想——[AMGH+22] 中引入的超立方体技术——相结合,从而得到更高效的基于 MPCitH 的方案。这种新方法比经典 MPCitH 更高效,因为它能够减少参与方计算的数量。这给我们带来了第一个方案,称为 MIRA-Additive。随后,我们提出另一个基于低阈值秘密共享的方案,称为 MIRA-Threshold,它速度更快,但代价是签名更大。使用阈值秘密共享构建 MPCitH 的细节见 [FR22]。这两种构造使我们能够比经典 MPCitH 更快,签名大小在 MIRA-Additive 下约为 5.6 kB,在 MIRA-Threshold 下约为 8.3 kB。我们在此详细说明这些方案的构造、优化及其安全性证明。

英文摘要:

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. We combine this idea with another idea, the hypercube technique introduced in [AMGH+22], which leads to more efficient MPCitH-based scheme. This new approach is more efficient than classical MPCitH, as it allows to reduce the number of party computation. This gives us a first scheme called MIRA-Additive. We then present an other scheme, based on low-threshold secret sharings, called MIRA-Threshold, which is a faster scheme, at the price of larger signatures. The construction of MPCitH using threshold secret sharing is detailed in [FR22]. These two constructions allows us to be faster than classical MPCitH, with a size of signature around 5.6kB with MIRA-Additive, and 8.3kB with MIRA-Threshold. We detail here the constructions and optimizations of the schemes, as well as their security proofs.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑