Welcome to the resource topic for 2002/012
Title:
Exponent Group Signature Schemes and Efficient Identity Based Signature Schemes Based on Pairings
Authors: F. Hess
Abstract:We describe general exponent group signature schemes and show how
these naturally give rise to identity based signature schemes if
pairings are used. We prove these schemes to be secure in the random
oracle model. Furthermore we describe a particular identity based
signature scheme which is quite efficient in terms of bandwidth and
computing time, and we develop a further scheme which is not derived
from a general exponent group signature scheme. The realization of
these schemes uses supersingular elliptic curves and the Tate pairing,
which is more efficient than the Weil pairing. Finally we show that
these schemes have a more natural solution, than Shamir’s original
scheme, to the ``escrow’’ property that all identity based signature
schemes suffer from.
ePrint: https://eprint.iacr.org/2002/012
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .