Publication Type
Journal Article
Version
submittedVersion
Publication Date
4-2020
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.
Keywords
linkable secret handshake, anonymity, public tracing, communication cost
Discipline
Information Security
Research Areas
Cybersecurity
Publication
Computer Journal
Volume
63
Issue
4
First Page
536
Last Page
548
ISSN
0010-4620
Identifier
10.1093/comjnl/bxz095
Publisher
Oxford University Press (OUP): Policy B - Oxford Open Option B
Citation
TIAN, Yangguang; LI, Yingjiu; DENG, Robert H.; LI, Nan; YANG, Guomin; and YANG, Zheng.
A new construction for linkable secret handshake. (2020). Computer Journal. 63, (4), 536-548.
Available at: https://ink.library.smu.edu.sg/sis_research/5304
Copyright Owner and License
Authors
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Additional URL
https://doi.org/10.1093/comjnl/bxz095