Welcome to the resource topic for 2003/261
A provably secure ID-based ring signature scheme
Authors: Javier Herranz, Germán SáezAbstract:
Identity-based (ID) cryptosystems avoid the necessity of certificates to authenticate public keys
in a digital communications system. This is desirable, specially for these applications which
involve a large number of public keys in each execution. For example, any computation and
verification of a ring signature scheme, where a user anonymously signs a message on behalf of a
set of users including himself, requires to authenticate the public keys of all the members of the
We use bilinear pairings to design a new ID-based ring signature scheme. We extend to the
ID-based scehario some known results about the security of generic ring signature schemes.
This allows us to formally prove the security of our scheme, under the assumption that the
Computational Diffie-Hellman problem is hard to solve.
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .