A New Efficient Threshold Ring Signature Scheme Based on Coding Theory - GREYC amacc Access content directly
Journal Articles IEEE Transactions on Information Theory Year : 2011

A New Efficient Threshold Ring Signature Scheme Based on Coding Theory

Abstract

—Ring signatures were introduced by Rivest, Shamir and Tauman in 2001 [32]. These sig-natures allow a signer to anonymously authenticate a message on behalf of a group of his choice. This concept was then extended by Bresson, Stern and Szydlo into -out-of-(threshold) ring signatures in 2002 [9]. We propose in this article a generalization of Stern's code based identification (and signature) scheme [36] to design a practical -out-of-threshold ring signature scheme. The size of the resulting signatures is in () and does not depend on , contrary to most of the existing protocols. Our scheme is existentially unforge-able under a chosen message attack in the random oracle model assuming the hardness of the minimum distance problem, is unconditionally source hiding, has a very short public key and has an overall complexity in (). This protocol is the first efficient code-based ring signature scheme and the first code-based thresh-old ring signature scheme. Moreover it has a better complexity than number-theory based schemes which have a complexity in (). This paper is an extended version of [2] with complete proofs and definitions.
Fichier principal
Vignette du fichier
RIACL-AGUILARMELCHOR-2011-1.pdf (459.65 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01083807 , version 1 (18-11-2014)

Identifiers

Cite

Carlos Aguilar Melchor, Pierre-Louis Cayrel, Philippe Gaborit, Fabien Laguillaumie. A New Efficient Threshold Ring Signature Scheme Based on Coding Theory. IEEE Transactions on Information Theory, 2011, pp.4833-4842. ⟨10.1007/978-3-540-88403-3_1⟩. ⟨hal-01083807⟩
734 View
706 Download

Altmetric

Share

Gmail Facebook X LinkedIn More