Cryptology ePrint Archive: Report 2005/227

Threshold Ring Signatures Efficient for Large Sets of Signers

K. Maneva-Jakimoska and 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.

Category / Keywords: public-key cryptography / anonymity, digital signatures, threshold cryptography, ring signatures, threshold ring signatures, covering designs

Date: received 12 Jul 2005

Contact author: jakimosk at cs fsu edu

Available formats: Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20050712:201718 (All versions of this report)

Discussion forum: Show discussion | Start new discussion