Exponent Group Signature Schemes and Efficient Identity Based Signature Schemes Based on Pairings

F.  Hess

Paper 2002/012

Exponent Group Signature Schemes and Efficient Identity Based Signature Schemes Based on Pairings

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.

Metadata

Available format(s): PDF PS
Category: Public-key cryptography
Publication info: Published elsewhere. Unknown where it was published
Keywords: Exponent group signatures identity based signatures Weil
Contact author(s): florian @ cs bris ac uk
History: 2002-01-30: revised; 2002-01-28: received; See all versions
Short URL: https://ia.cr/2002/012
License: CC BY

BibTeX

@misc{cryptoeprint:2002/012,
      author = {F.  Hess},
      title = {Exponent Group Signature Schemes and Efficient Identity Based Signature Schemes Based on Pairings},
      howpublished = {Cryptology {ePrint} Archive, Paper 2002/012},
      year = {2002},
      url = {https://eprint.iacr.org/2002/012}
}