A Code-Based Undeniable Signature Scheme

Abstract : 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.
Type de document :
Communication dans un congrès
Martijn Stam. 14th IMA International Conference, IMACC 2013., Dec 2013, Oxford, United Kingdom. Springer Berlin Heidelberg, 8308, pp.99-119, 2013, Lecture Notes in Computer Science. 〈10.1007/978-3-642-45239-0_7〉
Liste complète des métadonnées

https://hal-unilim.archives-ouvertes.fr/hal-00937088
Contributeur : Yolande Vieceli <>
Soumis le : lundi 27 janvier 2014 - 17:37:16
Dernière modification le : lundi 13 octobre 2014 - 15:43:25

Identifiants

Collections

Citation

Carlos Aguilar Melchor, Slim Bettaieb, Philippe Gaborit, Julien Schreck. A Code-Based Undeniable Signature Scheme. Martijn Stam. 14th IMA International Conference, IMACC 2013., Dec 2013, Oxford, United Kingdom. Springer Berlin Heidelberg, 8308, pp.99-119, 2013, Lecture Notes in Computer Science. 〈10.1007/978-3-642-45239-0_7〉. 〈hal-00937088〉

Partager

Métriques

Consultations de la notice

179