Name
Abstract | ||
|---|---|---|
The primitive secret handshake is a kind of privacy-preserving authentication protocol, in which the participants can share a common session key if and only if they come from the same group, without the leakage of the group information. Most of the current secret handshakes are realized by means of bilinear maps, whose computational cost is a lot. A new multi-party secret handshake scheme is proposed in this paper using the chaotic map, with the computational cost reducing significantly. The new protocol also supports user revocation, and has the ability of tracing users, meanwhile proved to achieve the basic security properties of secret handshakes. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.5755/j01.itc.46.1.13845 | INFORMATION TECHNOLOGY AND CONTROL |
Keywords | Field | DocType |
secret handshakes, multi-party, chaotic maps, computational cost | Secret sharing,Handshake,Computer security,Computer science,Revocation,Verifiable secret sharing,Authentication protocol,Homomorphic secret sharing,Chaotic,Session key | Journal |
Volume | Issue | ISSN |
46 | 1 | 1392-124X |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wenbo Wang | 1 | 3 | 5.48 |
| Qingfeng Cheng | 2 | 0 | 0.34 |
| Siqi Lu | 3 | 0 | 0.34 |
| Jianfeng Ma | 4 | 1207 | 89.64 |