New Identity-Based Ring Signature Schemes
- 806 Downloads
Identity-based (ID-based) 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, 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 give bounds on the concrete security of our scheme in the random oracle model, under the assumption that the Computational Diffie-Hellman problem is hard to solve. Then we extend this scheme to scenarios where a subset of users anonymously sign on behalf of some access structure of different subsets.
KeywordsHash Function Ring Signature Access Structure Random Oracle Blind Signature
Unable to display preview. Download preview PDF.
- 2.Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: First ACM Conference on Computer and Communications Security, pp. 62–73 (1993)Google Scholar
- 9.Herranz, J., Sáez, G.: Distributed ring signatures for identity-based scenarios. Technical report (2004), Available at http://eprint.iacr.org/2004/