Paper 2005/227

Threshold Ring Signatures Efficient for Large Sets of Signers

K. Maneva-Jakimoska, G. Jakimoski, and 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 PS
Category
Public-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Keywords
anonymitydigital signaturesthreshold cryptographyring signaturesthreshold ring signaturescovering designs
Contact author(s)
jakimosk @ cs fsu edu
History
2005-07-12: received
Short URL
https://ia.cr/2005/227
License
Creative Commons Attribution
CC BY

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},
      note = {\url{https://eprint.iacr.org/2005/227}},
      url = {https://eprint.iacr.org/2005/227}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.