Name
Abstract | ||
|---|---|---|
Since the first (t, n) threshold proxy signature scheme was proposed, a great deal of work has been done. To avoid dispute, it is necessary to identify the actual signer who generates the proxy signature. To withstand the forgery attack that the original signer can forge a valid threshold proxy signature on behalf of the proxy group, this paper proposed a new scheme which is more secure and efficient. The new scheme is able to resist the forgery attack which relies on the hardness of computational discrete logarithm problem. Furthermore, the original signer only computes a common proxy share and broadcasts it to the proxy group. So that, it is more efficient in terms of computational complexity and communication cost. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1145/3058060.3058086 | ICCSP |
Field | DocType | Citations |
Proxy (climate),Proxy signature,Cryptography,Computer security,Geography,Computational complexity theory,Discrete logarithm | Conference | 0 |
PageRank | References | Authors |
0.34 | 4 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Danni Liu | 1 | 0 | 0.34 |
| Lijuan Wang | 2 | 3 | 6.45 |
| Can Wang | 3 | 3 | 5.50 |
| Pengyuan Huo | 4 | 0 | 0.34 |