University of Surrey

Test tubes in the lab Research in the ATI Dance Research

Short Dynamic Group Signature Scheme Supporting Controllable Linkability

Hwang, JY, Chen, L and Cho, HS (2015) Short Dynamic Group Signature Scheme Supporting Controllable Linkability IEEE Transactions on Information Forensics and Security, 10 (6).

Full text not available from this repository.


The controllable linkability of group signatures introduced by Hwang et al. enables an entity who has a linking key to find whether or not two group signatures were generated by the same signer, while preserving the anonymity. This functionality is very useful in many applications that require the linkability but still need the anonymity, such as sybil attack detection in a vehicular ad hoc network and privacypreserving data mining. In this paper, we present a new group signature scheme supporting the controllable linkability. The major advantage of this scheme is that the signature length is very short, even shorter than this in the best-known group signature scheme without supporting the linkability. We have implemented our scheme in both a Linux machine with an Intel Core2 Quad and an iPhone4. We compare the results with a number of existing group signature schemes. We also prove security features of our scheme, such as anonymity, traceability, nonframeability, and linkability, under a random oracle model.

Item Type: Article
Subjects : Computing
Divisions : Surrey research (other units)
Authors :
Hwang, JY
Cho, HS
Date : June 2015
DOI : 10.1109/TIFS.2015.2390497
Copyright Disclaimer : © 2015 IEEE
Uncontrolled Keywords : Anonymity, Privacy, Group signature, Linkability
Depositing User : Symplectic Elements
Date Deposited : 16 May 2017 15:38
Last Modified : 24 Jan 2020 15:10

Actions (login required)

View Item View Item


Downloads per month over past year

Information about this web site

© The University of Surrey, Guildford, Surrey, GU2 7XH, United Kingdom.
+44 (0)1483 300800