International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Efficient Ring Signatures without Random Oracles

Authors:
Hovav Shacham
Brent Waters
Download:
URL: http://eprint.iacr.org/2006/289
Search ePrint
Search Google
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.
BibTeX
@misc{eprint-2006-21781,
  title={Efficient Ring Signatures without Random Oracles},
  booktitle={IACR Eprint archive},
  keywords={public-key cryptography /},
  url={http://eprint.iacr.org/2006/289},
  note={ hovav.shacham@weizmann.ac.il 13384 received 24 Aug 2006},
  author={Hovav Shacham and Brent Waters},
  year=2006
}