CryptoDB

Paper: A provably secure ID-based ring signature scheme

Authors: Javier Herranz Germ\'an S\'aez URL: http://eprint.iacr.org/2003/261 Search ePrint Search Google 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 set. 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.
BibTeX
@misc{eprint-2003-11974,
title={A provably secure ID-based ring signature scheme},
booktitle={IACR Eprint archive},
keywords={public-key cryptography / Identity-based schemes, ring signatures, random oracle model},
url={http://eprint.iacr.org/2003/261},
note={ jherranz@mat.upc.es 12404 received 18 Dec 2003},
author={Javier Herranz and Germ\'an S\'aez},
year=2003
}