Thumbnail
Access Restriction
Open

Author Shacham, Hovav ♦ Waters, Brent
Source CiteSeerX
Content type Text
Publisher Springer
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Bilinear Group ♦ Scheme Secure ♦ Group Element ♦ Random Oracle ♦ User Key ♦ Full Key Exposure ♦ Standard Assumption ♦ Security Model ♦ Ring Signature
Description 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.
In PKC07, volume 4450 of LNCS
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study
Learning Resource Type Article
Publisher Date 2006-01-01