Threshold Ring Signatures Efficient for Large Sets of Signers

K.  Maneva-Jakimoska; G.  Jakimoski; M.  Burmester

Paper 2005/227 Original: eprint.iacr.org/2005/227 ↗

Threshold Ring Signatures Efficient for Large Sets of Signers

K. Maneva-Jakimoska

G. Jakimoski

M. Burmester

Abstract

The anonymity provided by the threshold ring signature scheme proposed by Bresson et al (Crypto'02) is perfect. However, its complexity is prohibitively large even for relatively small sets of signers. We propose use of threshold schemes based on covering designs that are efficient for large groups of signers. The cost we pay is non-perfect anonymity.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Preprint.
History: 2005-07-12: last updated; 2005-07-12: published
Short URL: https://ia.cr/2005/227
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2005/227,
      author = {K.  Maneva-Jakimoska and G.  Jakimoski and M.  Burmester},
      title = {Threshold Ring Signatures Efficient for Large Sets of Signers},
      howpublished = {Cryptology {ePrint} Archive, Paper 2005/227},
      year = {2005},
      url = {https://eprint.iacr.org/2005/227}
}