File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Efficient Linkable and/or Threshold Ring Signature without Random Oracles

TitleEfficient Linkable and/or Threshold Ring Signature without Random Oracles
Authors
Keywordsring signature
threshold
linkable
random oracles
Issue Date2013
PublisherOxford University Press. The Journal's web site is located at http://comjnl.oxfordjournals.org/
Citation
Computer Journal, 2013, v. 56, n. 4, p. 407-421 How to Cite?
AbstractLinkable ring signatures have found many attractive applications. One of the recent important extensions is a linkable threshold ring signature (LTRS) scheme. Unfortunately, the existing LTRS schemes are only secure in the random oracle model (ROM). In this paper, we make the following contributions. First, we construct the first LTRS scheme that is secure without requiring the ROM. Further, we enhance the security of a threshold ring signature (for both linkable or non-linkable) by providing a stronger definition of anonymity. This strengthened notion makes threshold ring signature schemes more suitable in real life. Finally, we provide efficient schemes that outperform the existing schemes in the literature. Our scheme is particularly suitable for electronic commerce or electronic government where anonymity and accountability are the most concerned factors. © 2012 The Author.
Persistent Identifierhttp://hdl.handle.net/10722/185121
ISSN
2023 Impact Factor: 1.5
2023 SCImago Journal Rankings: 0.520
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorYuen, THen_US
dc.contributor.authorLiu, JKen_US
dc.contributor.authorAu, MHen_US
dc.contributor.authorSusilo, Wen_US
dc.contributor.authorZhou, Jen_US
dc.date.accessioned2013-07-15T10:32:18Z-
dc.date.available2013-07-15T10:32:18Z-
dc.date.issued2013en_US
dc.identifier.citationComputer Journal, 2013, v. 56, n. 4, p. 407-421en_US
dc.identifier.issn0010-4620-
dc.identifier.urihttp://hdl.handle.net/10722/185121-
dc.description.abstractLinkable ring signatures have found many attractive applications. One of the recent important extensions is a linkable threshold ring signature (LTRS) scheme. Unfortunately, the existing LTRS schemes are only secure in the random oracle model (ROM). In this paper, we make the following contributions. First, we construct the first LTRS scheme that is secure without requiring the ROM. Further, we enhance the security of a threshold ring signature (for both linkable or non-linkable) by providing a stronger definition of anonymity. This strengthened notion makes threshold ring signature schemes more suitable in real life. Finally, we provide efficient schemes that outperform the existing schemes in the literature. Our scheme is particularly suitable for electronic commerce or electronic government where anonymity and accountability are the most concerned factors. © 2012 The Author.-
dc.languageengen_US
dc.publisherOxford University Press. The Journal's web site is located at http://comjnl.oxfordjournals.org/en_US
dc.relation.ispartofThe Computer Journalen_US
dc.subjectring signature-
dc.subjectthreshold-
dc.subjectlinkable-
dc.subjectrandom oracles-
dc.titleEfficient Linkable and/or Threshold Ring Signature without Random Oraclesen_US
dc.typeArticleen_US
dc.identifier.emailYuen, TH: johnyuen@hku.hken_US
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1093/comjnl/bxs115-
dc.identifier.scopuseid_2-s2.0-84875690586-
dc.identifier.hkuros215058en_US
dc.identifier.volume56en_US
dc.identifier.spage407en_US
dc.identifier.epage421en_US
dc.identifier.isiWOS:000316958200001-
dc.identifier.issnl0010-4620-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats