Efficient Ring Signatures without Random Oracles

Hovav Shacham; Brent Waters

Paper 2006/289

Efficient Ring Signatures without Random Oracles

Hovav Shacham and Brent Waters

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 $2 l + 2$ group elements and require $2 l + 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: Published elsewhere. Unknown where it was published
Contact author(s): hovav shacham @ weizmann ac il
History: 2006-08-24: received
Short URL: https://ia.cr/2006/289
License: CC BY

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}
}