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.
Advanced signature functionalities from the code equivalence problem / Barenghi, Alessandro; Biasse, Jean-François; Ngo, Tran; Persichetti, Edoardo; Santini, Paolo. - In: INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS. COMPUTER SYSTEMS THEORY. - ISSN 2379-9927. - 7:2(2022), pp. 112-128. [10.1080/23799927.2022.2048206]
Advanced signature functionalities from the code equivalence problem
Edoardo Persichetti;
2022
Abstract
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.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.