Article thumbnail

Efficient linkable and/or threshold ring signature without random oracles

By Tsz Hon Yuen, Joseph K Liu, Man Ho Au, Willy Susilo and Jianying Zhou

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. © 2012 The Author

Topics: era2015, Engineering, Science and Technology Studies
Publisher: 'Sociological Research Online'
Year: 2013
OAI identifier: oai:ro.uow.edu.au:eispapers-1702
Provided by: Research Online
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • https://ro.uow.edu.au/eispaper... (external link)
  • https://ro.uow.edu.au/cgi/view... (external link)

  • To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.

    Suggested articles