File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Linkable ring signature with unconditional anonymity

TitleLinkable ring signature with unconditional anonymity
Authors
Keywordslinkable
Ring signature
anonymity
Issue Date2014
Citation
IEEE Transactions on Knowledge and Data Engineering, 2014, v. 26, n. 1, p. 157-165 How to Cite?
AbstractIn this paper, we construct a linkable ring signature scheme with unconditional anonymity. It has been regarded as an open problem in [22] since 2004 for the construction of an unconditional anonymous linkable ring signature scheme. We are the first to solve this open problem by giving a concrete instantiation, which is proven secure in the random oracle model. Our construction is even more efficient than other schemes that can only provide computational anonymity. Simultaneously, our scheme can act as an counterexample to show that [19, Theorem 1] is not always true, which stated that linkable ring signature scheme cannot provide strong anonymity. Yet we prove that our scheme can achieve strong anonymity (under one of the interpretations). © 1989-2012 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/280803
ISSN
2021 Impact Factor: 9.235
2020 SCImago Journal Rankings: 1.360
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorLiu, Joseph K.-
dc.contributor.authorAu, Man Ho-
dc.contributor.authorSusilo, Willy-
dc.contributor.authorZhou, Jianying-
dc.date.accessioned2020-02-17T14:34:59Z-
dc.date.available2020-02-17T14:34:59Z-
dc.date.issued2014-
dc.identifier.citationIEEE Transactions on Knowledge and Data Engineering, 2014, v. 26, n. 1, p. 157-165-
dc.identifier.issn1041-4347-
dc.identifier.urihttp://hdl.handle.net/10722/280803-
dc.description.abstractIn this paper, we construct a linkable ring signature scheme with unconditional anonymity. It has been regarded as an open problem in [22] since 2004 for the construction of an unconditional anonymous linkable ring signature scheme. We are the first to solve this open problem by giving a concrete instantiation, which is proven secure in the random oracle model. Our construction is even more efficient than other schemes that can only provide computational anonymity. Simultaneously, our scheme can act as an counterexample to show that [19, Theorem 1] is not always true, which stated that linkable ring signature scheme cannot provide strong anonymity. Yet we prove that our scheme can achieve strong anonymity (under one of the interpretations). © 1989-2012 IEEE.-
dc.languageeng-
dc.relation.ispartofIEEE Transactions on Knowledge and Data Engineering-
dc.subjectlinkable-
dc.subjectRing signature-
dc.subjectanonymity-
dc.titleLinkable ring signature with unconditional anonymity-
dc.typeArticle-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1109/TKDE.2013.17-
dc.identifier.scopuseid_2-s2.0-84890338882-
dc.identifier.volume26-
dc.identifier.issue1-
dc.identifier.spage157-
dc.identifier.epage165-
dc.identifier.isiWOS:000327656800014-
dc.identifier.issnl1041-4347-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats