Skip to main content
placeholder image

Efficient linkable and/or threshold ring signature without random oracles

Journal Article


Download full-text (Open Access)

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.

  • 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.

UOW Authors


  •   Yuen, Tsz Hon (external author)
  •   Liu, Joseph K. (external author)
  •   Au, Man Ho Allen (external author)
  •   Susilo, Willy
  •   Zhou, Jianying (external author)

Publication Date


  • 2013

Citation


  • Yuen, T. Hon., Liu, J. K., Au, M. Ho., Susilo, W. & Zhou, J. (2013). Efficient linkable and/or threshold ring signature without random oracles. The Computer Journal, 56 (4), 407-421.

Scopus Eid


  • 2-s2.0-84875690586

Ro Full-text Url


  • http://ro.uow.edu.au/cgi/viewcontent.cgi?article=1702&context=eispapers

Ro Metadata Url


  • http://ro.uow.edu.au/eispapers/696

Has Global Citation Frequency


Number Of Pages


  • 14

Start Page


  • 407

End Page


  • 421

Volume


  • 56

Issue


  • 4

Place Of Publication


  • United Kingdom

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.

  • 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.

UOW Authors


  •   Yuen, Tsz Hon (external author)
  •   Liu, Joseph K. (external author)
  •   Au, Man Ho Allen (external author)
  •   Susilo, Willy
  •   Zhou, Jianying (external author)

Publication Date


  • 2013

Citation


  • Yuen, T. Hon., Liu, J. K., Au, M. Ho., Susilo, W. & Zhou, J. (2013). Efficient linkable and/or threshold ring signature without random oracles. The Computer Journal, 56 (4), 407-421.

Scopus Eid


  • 2-s2.0-84875690586

Ro Full-text Url


  • http://ro.uow.edu.au/cgi/viewcontent.cgi?article=1702&context=eispapers

Ro Metadata Url


  • http://ro.uow.edu.au/eispapers/696

Has Global Citation Frequency


Number Of Pages


  • 14

Start Page


  • 407

End Page


  • 421

Volume


  • 56

Issue


  • 4

Place Of Publication


  • United Kingdom