A Code-Based Undeniable Signature Scheme - Université de Limoges Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

A Code-Based Undeniable Signature Scheme

Carlos Aguilar Melchor
DMI
Slim Bettaieb
  • Fonction : Auteur
DMI
Philippe Gaborit
  • Fonction : Auteur
  • PersonId : 918137
DMI
Julien Schreck
  • Fonction : Auteur
DMI

Résumé

In this work we propose the first code-based undeniable signature scheme (and more generally the first post-quantum undeniable signature scheme). The verification protocols for our scheme are 3-pass zero-knowledge protocols derived from the Stern authentication protocol. There are two main ideas in our protocol, first we remark that it is possible to obtain a full-time undeniable signature from a one-time undeniable signature simply by signing the one-time public key by a standard signature. Second, we introduce a zero-knowledge variation on the Stern authentication scheme which permits to prove that one or two different syndromes are associated (or not) to the same low weight word. We give a polynomial reduction of the security of our scheme to the security of the syndrome decoding problem.

Dates et versions

hal-00937088 , version 1 (27-01-2014)

Identifiants

Citer

Carlos Aguilar Melchor, Slim Bettaieb, Philippe Gaborit, Julien Schreck. A Code-Based Undeniable Signature Scheme. 14th IMA International Conference, IMACC 2013., Dec 2013, Oxford, United Kingdom. pp.99-119, ⟨10.1007/978-3-642-45239-0_7⟩. ⟨hal-00937088⟩

Collections

UNILIM CNRS XLIM
258 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More