Answers are grounded in this paper and cite their sources.
Ring signature is proved very useful in various applications for its perfect properties. However, the existing schemes based on the discrete logarithm are not perfect in signature and signer verification. In this paper, we introduce a new verifiable ring signature scheme based on Nyberg-Rueppel signature. The scheme realizes the ring signature using the hash functioning merely, which can verify the actual signer besides satisfying the basic properties of ring signature: unconditional anonymity and non-forgeability. The comparison shows that our signature scheme is of less size of signature and computation, and the signer verification is more simple and easy to understand
No takes yet. Share an insight, caveat, or question.
Changlun et al. (2006) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: