Advanced signature functionalities from the code equivalence problem
Advanced signature functionalities from the code equivalence problem
复制标题
DOI：
10.1080/23799927.2022.2048206
复制
发表时间：
2022-03
影响因子：
--
通讯作者：
Alessandro Barenghi;Jean-François Biasse;Tra Ngô;Edoardo Persichetti;Paolo Santini
中科院分区：
文献类型：
--
作者：
Alessandro Barenghi;Jean-François Biasse;Tra Ngô;Edoardo Persichetti;Paolo Santini
2020年推出的LESS签名方案代表了基于代码的签名的新开始。在本文中，我们探讨了先进的功能，签名方案，源于工作的LESS。首先，我们适应了最近的协议Beullens等人。获得一个建设（环）环签名。然后，我们实现了一个基于身份的签名方案遵循传统的方法由Joye和Neven。我们的性能数据证实，基于码等价问题的签名方案具有相当大的实际应用潜力。
The LESS signature scheme, introduced in 2020, represented a fresh start for code-based signatures. In this paper we explore advanced functionalities for signature schemes, stemming from the work of LESS. First, we adapt a recent protocol of Beullens et al. to obtain a construction for (linkable) ring signatures. Then, we realize an identity-based signature scheme following the traditional approach by Joye and Neven. Our performance numbers confirm that signature schemes based on the code equivalence problem have considerable potential for practical applications.