Paper 2006/289 Original: eprint.iacr.org/2006/289 ↗
Efficient Ring Signatures without Random Oracles
Abstract
We describe the first efficient ring signature scheme secure, without random oracles, based on standard assumptions. Our ring signatures are based in bilinear groups. For $l$ members of a ring our signatures consist of $2l+2$ group elements and require $2l+3$ pairings to verify. We prove our scheme secure in the strongest security model proposed by Bender, Katz, and Morselli: namely, we show our scheme to be anonymous against full key exposure and unforgeable with respect to insider corruption. A shortcoming of our approach is that all the users' keys must be defined in the same group.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2006-08-24: last updated
- 2006-08-24: published
- Short URL
- https://ia.cr/2006/289
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2006/289,
author = {Hovav Shacham and Brent Waters},
title = {Efficient Ring Signatures without Random Oracles},
howpublished = {Cryptology {ePrint} Archive, Paper 2006/289},
year = {2006},
url = {https://eprint.iacr.org/2006/289}
}