Paper 2004/311 Original: eprint.iacr.org/2004/311 ↗
Hierarchical Group Signatures
Abstract
We introduce the notion of \emph{hierarchical group signatures}. This is a proper generalization of group signatures, which allows multiple group managers organized in a tree with the signers as leaves. For a signer that is a leaf of the subtree of a group manager, the group manager learns which of its children that (perhaps indirectly) manages the signer. We provide definitions for the new notion and construct a scheme that is provably secure given the existence of a family of trapdoor permutations. We also present a construction which is relatively practical, and prove its security in the random oracle model under the strong RSA assumption and the DDH assumption.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2005-04-08: last updated
- 2004-11-16: published
- Short URL
- https://ia.cr/2004/311
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2004/311,
author = {Marten Trolin and Douglas Wikstrom},
title = {Hierarchical Group Signatures},
howpublished = {Cryptology {ePrint} Archive, Paper 2004/311},
year = {2004},
url = {https://eprint.iacr.org/2004/311}
}