Advanced Signature Functionalities from the Code Equivalence Problem

Alessandro Barenghi; Jean-Francois Biasse; Tran Ngo; Edoardo Persichetti; Paolo Santini

Paper 2022/710

Advanced Signature Functionalities from the Code Equivalence Problem

Alessandro Barenghi, Politecnico di Milano

Jean-Francois Biasse, University of South Florida

Tran Ngo, Florida Atlantic University

Edoardo Persichetti

, Florida Atlantic University

Paolo Santini, Universita' Politecnica delle Marche

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.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Published elsewhere. International Journal of Computer Mathematics: Computer Systems Theory
Keywords: Post-Quantum Signatures Identity-Based Ring Signatures Code Equivalence
Contact author(s): alessandro barenghi @ polimi it
biasse @ usf edu
ngot2018 @ fau edu
epersichetti @ fau edu
p santini @ staff univpm it
History: 2022-06-06: approved; 2022-06-03: received; See all versions
Short URL: https://ia.cr/2022/710
License: CC BY

BibTeX

@misc{cryptoeprint:2022/710,
      author = {Alessandro Barenghi and Jean-Francois Biasse and Tran Ngo and Edoardo Persichetti and Paolo Santini},
      title = {Advanced Signature Functionalities from the Code Equivalence Problem},
      howpublished = {Cryptology {ePrint} Archive, Paper 2022/710},
      year = {2022},
      url = {https://eprint.iacr.org/2022/710}
}