Paper Info
Title
A Light-Weight Group Signature Scheme with Time-Token Dependent Linking.
Abstract
Group signature is a central topic of cryptography with anonymity, and its several applications have been considered so far, e.g., privacy-preserving vehicle communications. Since anonymity a.k.a. unlinkability is quite strong in certain situations and it requires heavy cryptographic costs, group signatures with relaxed anonymity also have been proposed. For example, group signatures with controllable linkability was proposed by Hwang et al., LightSec 2011 where an authority called Linker can anonymously check whether two group signatures are made by the same signer or not by using a linking key. However, the linking algorithm requires a heavy computation, i.e., bilinear pairings. In this paper, we propose the notion group signatures with time-token dependent Linking GS-TDL, where a signer is unlinkable unless it generates multiple signatures at the same time period. It is particularly worth noting that our linking algorithm does not require cryptographic computations i.e., comparisons to determine two elements are the same. Moreover, the signature size is 25﾿% shorter than that of the Hwang et al. scheme, and is 34﾿% shorter than that of the Boneh-Boeyn-Shacham short group signature scheme. Our GS-TDL scheme supports verifier-local revocation VLR, which maintains constant signing and verification costs by using the linkable part of signatures. These appear to be related to independent interests. Finally, we provide our experimental results using the TEPLA library on a cheap and constrained computational power device, Raspberry Pi.
Year
DOI
Venue
2015
10.1007/978-3-319-29078-2_3
LightSec
DocType
Volume
ISSN
Conference
9542
0302-9743
Citations 
PageRank 
References 
3
0.40
39
Authors
2
Name
Order
Citations
PageRank
Keita Emura131636.97
Takuya Hayashi215315.93