Name
Abstract | ||
|---|---|---|
Concurrent signature is a novel paradigm, which can achieve fair exchange of signatures between users. Since its appearance, the topic has been widely concerned, while the study of concurrent signature in multi-user setting suffers from some criticism. Almost all known multi-user concurrent signature schemes rely on the hardness assumptions that is insecure against quantum analysis. Furthermore, most of multi-party concurrent signature (MCS) schemes are lacking of formal security models. In the paper, in the random oracle model, we propose a construction of lattice-based MCS scheme and prove its security under the hardness of the small integer solution (SIS) problem. Since our proposed scheme is based on the lattice assumptions, which is believed to be quantum-resistant, the mathematical properties make our scheme simpler and more flexible. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1016/j.ipl.2016.02.007 | Information Processing Letters |
Keywords | Field | DocType |
Concurrent signature,Multi-party,Lattice,SIS,Cryptography | Integer,Quantum,Discrete mathematics,Lattice (order),Cryptography,Random oracle,Algorithm,Theoretical computer science,Mathematical properties,Mathematics,Computer security model,Schnorr signature | Journal |
Volume | Issue | ISSN |
116 | 8 | 0020-0190 |
Citations | PageRank | References |
1 | 0.35 | 7 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xinyin Xiang | 1 | 1 | 0.69 |
| Hui Li | 2 | 814 | 92.33 |
| Mingyu Wang | 3 | 135 | 24.90 |
| Xingwen Zhao | 4 | 1 | 1.03 |