Name
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. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1093/comjnl/bxs115 | Comput. J. |
Keywords | Field | DocType |
existing ltrs scheme,electronic government,existing scheme,threshold ring signature scheme,random oracles,threshold ring signature,efficient linkable,efficient scheme,electronic commerce,ltrs scheme,linkable threshold ring signature,linkable ring signature | Computer science,Computer security,Random oracle,Ring signature,Anonymity | Journal |
Volume | Issue | ISSN |
56 | 4 | 0010-4620 |
Citations | PageRank | References |
16 | 0.66 | 29 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tsz Hon Yuen | 1 | 507 | 33.86 |
| Joseph K. Liu | 2 | 1134 | 67.24 |
| Man Ho Au | 3 | 1444 | 97.70 |
| Willy Susilo | 4 | 4823 | 353.18 |
| Jianying Zhou | 5 | 2868 | 229.06 |