Paper 2012/204
Unique Group Signatures
Matthew Franklin and Haibin Zhang
Abstract
We initiate the study of unique group signature such that signatures of the same message by the same user will always have a large common component (i.e., unique identifier). It enables an efficient detection algorithm, revealing the identities of illegal users, which is fundamentally different from previous primitives. We present a number of unique group signature schemes (without random oracles) under a variety of security models that extend the standard security models of ordinary group signatures. Our work is a beneficial step towards mitigating the well-known group signature paradox, and it also has many other interesting applications and efficiency implications.
Metadata
- Available format(s)
-
PDF
- Publication info
- Published elsewhere. The proceedings version appears in ESORICS 2012. This is the full version.
- Keywords
- anonymityanonymous authenticationdetection algorithmgroup signatureunique signatureverifiable random function.
- Contact author(s)
- hbzhang @ cs ucdavis edu
- History
- 2012-07-13: last of 2 revisions
- 2012-04-13: received
- See all versions
- Short URL
- https://ia.cr/2012/204
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2012/204,
author = {Matthew Franklin and Haibin Zhang},
title = {Unique Group Signatures},
howpublished = {Cryptology {ePrint} Archive, Paper 2012/204},
year = {2012},
url = {https://eprint.iacr.org/2012/204}
}
