File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Efficient identity based ring signature

TitleEfficient identity based ring signature
Authors
KeywordsAnonymity
Bilinear pairings
Efficiency
General access structure
Identity-based signature
Real spontaneity
Ring signature
Issue Date2005
PublisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/
Citation
Lecture Notes In Computer Science, 2005, v. 3531, p. 499-512 How to Cite?
AbstractIdentity-based (ID-based) cryptosystems eliminate the need for validity checking of the certificates and the need for registering for a certificate before getting the public key. These two features are desirable especially for the efficiency and the real spontaneity of ring signature, where a user can anonymously sign a message on behalf of a group of spontaneously conscripted users including the actual signer. In this paper, we propose a novel construction of ID-based ring signature which only needs two pairing computations for any group size. The proposed scheme is proven to be existential unforgeable against adaptive chosen message-and-identity attack under the random oracle model, using the forking lemma for generic ring signature schemes. We also consider its extension to support the general access structure. © Springer-Verlag Berlin Heidelberg 2005.
Persistent Identifierhttp://hdl.handle.net/10722/93301
ISSN
2005 Impact Factor: 0.402
2015 SCImago Journal Rankings: 0.252
References

 

DC FieldValueLanguage
dc.contributor.authorChow, SSMen_HK
dc.contributor.authorYiu, SMen_HK
dc.contributor.authorHui, LCKen_HK
dc.date.accessioned2010-09-25T14:56:58Z-
dc.date.available2010-09-25T14:56:58Z-
dc.date.issued2005en_HK
dc.identifier.citationLecture Notes In Computer Science, 2005, v. 3531, p. 499-512en_HK
dc.identifier.issn0302-9743en_HK
dc.identifier.urihttp://hdl.handle.net/10722/93301-
dc.description.abstractIdentity-based (ID-based) cryptosystems eliminate the need for validity checking of the certificates and the need for registering for a certificate before getting the public key. These two features are desirable especially for the efficiency and the real spontaneity of ring signature, where a user can anonymously sign a message on behalf of a group of spontaneously conscripted users including the actual signer. In this paper, we propose a novel construction of ID-based ring signature which only needs two pairing computations for any group size. The proposed scheme is proven to be existential unforgeable against adaptive chosen message-and-identity attack under the random oracle model, using the forking lemma for generic ring signature schemes. We also consider its extension to support the general access structure. © Springer-Verlag Berlin Heidelberg 2005.en_HK
dc.languageengen_HK
dc.publisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/en_HK
dc.relation.ispartofLecture Notes in Computer Scienceen_HK
dc.subjectAnonymityen_HK
dc.subjectBilinear pairingsen_HK
dc.subjectEfficiencyen_HK
dc.subjectGeneral access structureen_HK
dc.subjectIdentity-based signatureen_HK
dc.subjectReal spontaneityen_HK
dc.subjectRing signatureen_HK
dc.titleEfficient identity based ring signatureen_HK
dc.typeConference_Paperen_HK
dc.identifier.emailYiu, SM:smyiu@cs.hku.hken_HK
dc.identifier.emailHui, LCK:hui@cs.hku.hken_HK
dc.identifier.authorityYiu, SM=rp00207en_HK
dc.identifier.authorityHui, LCK=rp00120en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.scopuseid_2-s2.0-26444540788en_HK
dc.identifier.hkuros102652en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-26444540788&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume3531en_HK
dc.identifier.spage499en_HK
dc.identifier.epage512en_HK
dc.publisher.placeGermanyen_HK
dc.identifier.scopusauthoridChow, SSM=8980575500en_HK
dc.identifier.scopusauthoridYiu, SM=7003282240en_HK
dc.identifier.scopusauthoridHui, LCK=8905728300en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats