Skip to main content
placeholder image

A New Construction for Linkable Secret Handshake

Journal Article


Abstract


  • In this paper, we introduce a new construction for linkable secret handshake that allows authenticated users to perform handshake anonymously within allowable times. We define formal security models for the new construction, and prove that it can achieve session key security, anonymity, untraceability and linkable affiliation-hiding. In particular, the proposed construction ensures that (i) anyone can trace the real identities of dishonest users who perform handshakes for more than k times; and (ii) an optimal communication cost between authorized users is achieved by exploiting the proof of knowledges.

Publication Date


  • 2020

Citation


  • Tian, Y., Li, Y., Deng, R. H., Li, N., Yang, G., & Yang, Z. (2020). A New Construction for Linkable Secret Handshake. Computer Journal, 63(4), 536-548. doi:10.1093/comjnl/bxz095

Scopus Eid


  • 2-s2.0-85086986996

Start Page


  • 536

End Page


  • 548

Volume


  • 63

Issue


  • 4

Abstract


  • In this paper, we introduce a new construction for linkable secret handshake that allows authenticated users to perform handshake anonymously within allowable times. We define formal security models for the new construction, and prove that it can achieve session key security, anonymity, untraceability and linkable affiliation-hiding. In particular, the proposed construction ensures that (i) anyone can trace the real identities of dishonest users who perform handshakes for more than k times; and (ii) an optimal communication cost between authorized users is achieved by exploiting the proof of knowledges.

Publication Date


  • 2020

Citation


  • Tian, Y., Li, Y., Deng, R. H., Li, N., Yang, G., & Yang, Z. (2020). A New Construction for Linkable Secret Handshake. Computer Journal, 63(4), 536-548. doi:10.1093/comjnl/bxz095

Scopus Eid


  • 2-s2.0-85086986996

Start Page


  • 536

End Page


  • 548

Volume


  • 63

Issue


  • 4