Efficient Linkable and/or Threshold Ring Signature Without Random Oracles

Tsz Hon Yuen, Joseph K. Liu, Man Ho Allen Au, Willy Susilo, Jianying Zhou

Research output: Journal article publicationJournal articleAcademic researchpeer-review

42 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 - 1 Apr 2013
Externally publishedYes

Keywords

  • linkable
  • random oracles
  • ring signature
  • threshold

ASJC Scopus subject areas

  • Computer Science(all)

Fingerprint

Dive into the research topics of 'Efficient Linkable and/or Threshold Ring Signature Without Random Oracles'. Together they form a unique fingerprint.

Cite this