An improved threshold ring signature scheme based on error correcting codes

Abstract : The concept of threshold ring signature in code-based cryptography was introduced by Aguilar et al. in. Their proposal uses Stern's identification scheme as basis. In this paper we construct a novel threshold ring signature scheme built on the q-SD identification scheme recently proposed by Cayrel et al. Our proposed scheme benefits of a performance gain as a result of the reduction in the soundness error from 2/3 for Stern's scheme to 1/2 per round for the q-SD scheme. Our threshold ring signature scheme uses random linear codes over the field Fq, secure in the random oracle model and its security relies on the hardness of an error-correcting codes problem (namely the q-ary syndrome decoding problem). In this paper we also provide implementation results of the Aguilar et al. scheme and our proposal, this is the first efficient implementation of this type of code-based schemes.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [27 references]  Display  Hide  Download

https://hal.inria.fr/hal-00686645
Contributor : Pascal Véron <>
Submitted on : Wednesday, February 20, 2013 - 12:27:45 PM
Last modification on : Tuesday, December 4, 2018 - 7:42:05 PM
Document(s) archivé(s) le : Tuesday, May 21, 2013 - 9:21:50 AM

File

waifi2012.pdf
Publisher files allowed on an open archive

Identifiers

Citation

Pierre-Louis Cayrel, Sidi Mohamed El Yousfi Alaoui, Gerhard Hoffmann, Pascal Véron. An improved threshold ring signature scheme based on error correcting codes. International Workshop on the Arithmetic of Finite Fields, Jul 2012, Bochum, Germany. pp.45-63, ⟨10.1007/978-3-642-31662-3_4⟩. ⟨hal-00686645⟩

Share

Metrics

Record views

462

Files downloads

389