Advanced signature functionalities from the code equivalence problem

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) ri...

Full description

Saved in:
Bibliographic Details
Published inInternational journal of computer mathematics. Computer systems theory Vol. 7; no. 2; pp. 112 - 128
Main Authors Barenghi, Alessandro, Biasse, Jean-François, Ngo, Tran, Persichetti, Edoardo, Santini, Paolo
Format Journal Article
LanguageEnglish
Published Taylor & Francis 03.04.2022
Subjects
Online AccessGet full text
ISSN2379-9927
2379-9935
DOI10.1080/23799927.2022.2048206

Cover

More Information
Summary: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.
ISSN:2379-9927
2379-9935
DOI:10.1080/23799927.2022.2048206