Cryptology ePrint Archive: Report 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 $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.

Category / Keywords: public-key cryptography /

Date: received 24 Aug 2006

Contact author: hovav shacham at weizmann ac il

Available format(s): PDF | BibTeX Citation

Version: 20060824:194624 (All versions of this report)

Short URL: ia.cr/2006/289

Discussion forum: Show discussion | Start new discussion