Efficient Linkable and/or Threshold Ring Signature Without Random Oracles

Tsz Hon Yuen, Kai Sui Joseph Liu, Man Ho Allen Au, Willy Susilo, Jianying Zhou

Research output: Contribution to journalArticleResearchpeer-review

23 Citations (Scopus)

Abstract

Linkable 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.
Original languageEnglish
Pages (from-to)407 - 421
Number of pages15
JournalComputer Journal
Volume56
Issue number4
DOIs
Publication statusPublished - 2013
Externally publishedYes

Cite this

Yuen, Tsz Hon ; Liu, Kai Sui Joseph ; Au, Man Ho Allen ; Susilo, Willy ; Zhou, Jianying. / Efficient Linkable and/or Threshold Ring Signature Without Random Oracles. In: Computer Journal. 2013 ; Vol. 56, No. 4. pp. 407 - 421.
@article{cc4215aaf8154abfaae8ffb0dadfbf6e,
title = "Efficient Linkable and/or Threshold Ring Signature Without Random Oracles",
abstract = "Linkable 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.",
author = "Yuen, {Tsz Hon} and Liu, {Kai Sui Joseph} and Au, {Man Ho Allen} and Willy Susilo and Jianying Zhou",
year = "2013",
doi = "10.1093/comjnl/bxs115",
language = "English",
volume = "56",
pages = "407 -- 421",
journal = "Computer Journal",
issn = "0010-4620",
publisher = "Oxford University Press",
number = "4",

}

Efficient Linkable and/or Threshold Ring Signature Without Random Oracles. / Yuen, Tsz Hon; Liu, Kai Sui Joseph; Au, Man Ho Allen; Susilo, Willy; Zhou, Jianying.

In: Computer Journal, Vol. 56, No. 4, 2013, p. 407 - 421.

Research output: Contribution to journalArticleResearchpeer-review

TY - JOUR

T1 - Efficient Linkable and/or Threshold Ring Signature Without Random Oracles

AU - Yuen, Tsz Hon

AU - Liu, Kai Sui Joseph

AU - Au, Man Ho Allen

AU - Susilo, Willy

AU - Zhou, Jianying

PY - 2013

Y1 - 2013

N2 - Linkable 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.

AB - Linkable 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.

UR - http://comjnl.oxfordjournals.org.ezproxy.lib.monash.edu.au/content/56/4/407.full.pdf+html

U2 - 10.1093/comjnl/bxs115

DO - 10.1093/comjnl/bxs115

M3 - Article

VL - 56

SP - 407

EP - 421

JO - Computer Journal

JF - Computer Journal

SN - 0010-4620

IS - 4

ER -