CryptoDB
Threshold Ring Signatures Efficient for Large Sets of Signers
Authors: | |
---|---|
Download: | |
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. |
BibTeX
@misc{eprint-2005-12562, title={Threshold Ring Signatures Efficient for Large Sets of Signers}, booktitle={IACR Eprint archive}, keywords={public-key cryptography / anonymity, digital signatures, threshold cryptography, ring signatures, threshold ring signatures, covering designs}, url={http://eprint.iacr.org/2005/227}, note={ jakimosk@cs.fsu.edu 12976 received 12 Jul 2005}, author={K. Maneva-Jakimoska and G. Jakimoski and M. Burmester}, year=2005 }