arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2201.05403cs.CR
收藏

伴随式译码问题的新知识证明的码基签名

Code-based Signatures from New Proofs of Knowledge for the Syndrome Decoding Problem

Loïc Bidoux, Philippe Gaborit, Mukul Kulkarni, Victor Mateu

摘要:

在本文中,我们研究基于代码的签名构造知识证明(PoK)。这项工作可以追溯到Stern,他在1993年为伴随式解码问题引入了第一个有效的PoK。之后,提出了不同的变化,以减少签名的大小。在实践中,获得较小的签名大小依赖于两个主要考虑因素的相互作用:(i)底层协议及其可靠性误差,以及(ii)与给定协议兼容的优化类型。多年来,提出了不同的变化,以改善斯特恩计划,如Veron计划(公钥噪声码字,而不是一个症候群),AGS计划,这是一个5-通过协议,欺骗概率渐近等于1/2,最近的FJR方法,允许降低欺骗概率为1/N,但引起的性能开销。总的来说,签名的长度取决于方案本身、可能的优化和实现成本之间的权衡。最近的方法增加了实施成本,为许多不同类型的权衡打开了大门。在本文中,我们提出了三个新的计划和不同的权衡,这都是有趣的本身,因为取决于潜在的未来的优化方案可能最终会变得比另一个更有效。我们提出的所有方案都使用了一个可信的助手:第一个方案允许获得1/2的作弊概率,第二个方案允许以1/N的比例降低作弊概率,但与最近的FJR方案不同,最后第三个方案提出了一个类似Veron的FJR方案,其中公钥是一个有噪声的码字,而不是一个综合征。我们提供了一个广泛的比较表,列出了我们的计划和以前的计划之间的各种权衡。

英文摘要:

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 were proposed in order to reduce signature's size. In practice, obtaining a smaller signature size relies on the interaction of two main considerations: (i) the underlying protocol and its soundness error and (ii) the type of optimizations which are compatible with a given protocol. Over the years, different variations were proposed to improve the Stern scheme such as the Veron scheme (with public key a noisy codeword rather than a syndrome), the AGS scheme which is a 5-pass protocol with cheating probability asymptotically equal to 1/2 and more recently the FJR approach which permits to decrease the cheating probability to 1/N but induces a performance overhead. Overall the length of the signature depends on a trade-off between: the scheme in itself, the possible optimizations and the cost of the implementation. The recent approaches which increase the cost of the implementation opens the door to many different type of trade-offs. In this paper we propose three new schemes and different trade-offs, which are all interesting in themselves, since depending on potential future optimizations a scheme may eventually become more efficient than another. All the schemes we propose use a trusted helper: a first scheme permits to get a 1/2 cheating probability, a second scheme permits to decrease the cheating probability in 1/N but with a different approach than the recent FJR scheme and at last a third scheme propose a Veron-like adaptation of the FJR scheme in which the public key is a noisy codeword rather than a syndrome. We provide an extensive comparison table which lists various trade-offs between our schemes and previous ones.

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

↑