Name
Abstract | ||
|---|---|---|
Recently, an unlinkable secret handshakes scheme was proposed by Huang and Cao who claimed their scheme achieved affiliation-hiding, unlinkability and meanwhile was more efficient than the previous ones. However, Su, Youn and Park pointed out that the scheme is insecure due to some design flaw, respectively. In this paper, inspired by the security review of their work, we modify Huang-Cao scheme and propose an improved secret handshakes scheme with unlinkability. Our proposal not only conquers the security flaw in Huang-Cao scheme but also is more efficient than the previous schemes. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/LCOMM.2011.122810.102229 | IEEE Communications Letters |
Keywords | Field | DocType |
Security,Resistance,Games,Polynomials,Proposals,Probabilistic logic | Polynomial,Cryptographic protocol,Computer science,Computer security,Telecommunication security,Computer network,Probabilistic logic,Public-key cryptography | Journal |
Volume | Issue | ISSN |
15 | 2 | 1089-7798 |
Citations | PageRank | References |
3 | 0.38 | 8 |
Authors | ||
2 | ||