Designing a Practical Code-Based Signature Scheme from Zero-Knowledge Proofs with Trusted Setup

Shay Gueron, Edoardo Persichetti, Paolo Santini

Research output: Contribution to journalArticlepeer-review


This paper defines a new practical construction for a code-based signature scheme. We introduce a new protocol that is designed to follow the recent paradigm known as “Sigma protocol with helper”, and prove that the protocol’s security reduces directly to the Syndrome Decoding Problem. The protocol is then converted to a full-fledged signature scheme via a sequence of generic steps that include: removing the role of the helper; incorporating a variety of protocol optimizations (using e.g., Merkle trees); applying the Fiat–Shamir transformation. The resulting signature scheme is EUF-CMA secure in the QROM, with the following advantages: (a) Security relies on only minimal assumptions and is backed by a long-studied NP-complete problem; (b) the trusted setup structure allows for obtaining an arbitrarily small soundness error. This minimizes the required number of repetitions, thus alleviating a major bottleneck associated with Fiat–Shamir schemes. We outline an initial performance estimation to confirm that our scheme is competitive with respect to existing solutions of similar type.

Original languageEnglish
Article number5
Issue number1
StatePublished - Mar 2022

Bibliographical note

Publisher Copyright:
© 2022 by the authors. Licensee MDPI, Basel, Switzerland.


  • Code-based
  • Signature
  • Syndrome decoding
  • Zero-knowledge

ASJC Scopus subject areas

  • Software
  • Computer Science Applications
  • Computer Networks and Communications
  • Computational Theory and Mathematics
  • Applied Mathematics


Dive into the research topics of 'Designing a Practical Code-Based Signature Scheme from Zero-Knowledge Proofs with Trusted Setup'. Together they form a unique fingerprint.

Cite this