Skip to Main content Skip to Navigation
Conference papers

Provably Secure Code-Based Threshold Ring Signatures

Léonard Dallot 1 Damien Vergnaud 2, 3
1 Equipe AMACC - Laboratoire GREYC - UMR6072
GREYC - Groupe de Recherche en Informatique, Image, Automatique et Instrumentation de Caen
2 CASCADE - Construction and Analysis of Systems for Confidentiality and Authenticity of Data and Entities
DI-ENS - Département d'informatique de l'École normale supérieure, Inria Paris-Rocquencourt, CNRS - Centre National de la Recherche Scientifique : UMR 8548
Abstract : A threshold ring signature scheme enables a set of users to sign a message such that a finite set of possible signers (the ring) is identified, without revealing which subset of ring members actually produced the signature. A recent proposal of Aguillar et al. introduced the first code-based threshold ring signature scheme which large signatures (about 20KBytes per member of the ring for 80-bit security). We propose a new code-based threshold ring signature scheme that achieves small signature size of 675N − 228ℓ bits, where N is the number of members in the ring and ℓ is the number of signers, for a security level of 80 bits. We give a security proof of our scheme whose security relies — in both random oracle and ideal cipher models — on two coding theory problems, making our scheme the first provably secure code-based threshold ring signature scheme. Unfortunately, as often in code-based cryptography, the presented scheme leads to very large public keys.
Complete list of metadatas
Contributor : Greyc Référent <>
Submitted on : Thursday, November 13, 2014 - 2:15:17 PM
Last modification on : Tuesday, February 5, 2019 - 12:12:41 PM

Links full text



Léonard Dallot, Damien Vergnaud. Provably Secure Code-Based Threshold Ring Signatures. 12th IMA International Conference, Cryptography and Coding 2009, Dec 2009, Cirencester, United Kingdom. ⟨10.1007/978-3-642-10868-6_13⟩. ⟨hal-01082399⟩



Record views