2008 | OriginalPaper | Buchkapitel
A New Efficient Threshold Ring Signature Scheme Based on Coding Theory
verfasst von : Carlos Aguilar Melchor, Pierre-Louis Cayrel, Philippe Gaborit
Erschienen in: Post-Quantum Cryptography
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Ring signatures were introduced by Rivest, Shamir and Tauman in 2001. Bresson, Stern and Szydlo extended the ring signature concept to
t
-out-of-
N
threshold ring signatures in 2002. We present in this paper a
generalization
of Stern’s code based authentication (and signature) scheme to the case of
t
-out-of-
N
threshold ring signature. The size of our signature is in
$\mathcal{O}(N)$
and does not depend on
t
. Our protocol is anonymous and secure in the random oracle model, it has a very short public key and has a complexity in
$\mathcal{O}(N)$
. This protocol is the first efficient code-based ring signature scheme and the first code-based threshold ring signature scheme. Moreover it has a better complexity than number-theory based schemes which have a complexity in
$\mathcal{O}(Nt)$
.