A New Type of Group Blind Signature Scheme Based on Bilinear Pairings

Jun Zhong  Dake He

Paper 2006/439

A New Type of Group Blind Signature Scheme Based on Bilinear Pairings

Jun Zhong Dake He

Abstract

This paper constructs a new group blind signature scheme on the basis of CZK group signature scheme. The security of the new scheme is under the computational Diffie-Hellman problem in the random oracle model. In our scheme, to blind the group signature of CZK only adds the computation of modular addition; while the scheme in LR98 adds the computation of double discreet logarithm, root of the discreet logarithm and random permutation in order to blind the group signature of CS97. As far as the computation complexity is concerned, our scheme is more efficient than LR98.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Published elsewhere. Unknown where it was published
Contact author(s): zjxyz123 @ vip sina com
History: 2006-12-04: received
Short URL: https://ia.cr/2006/439
License: CC BY

BibTeX

@misc{cryptoeprint:2006/439,
      author = {Jun Zhong  Dake He},
      title = {A New Type of Group Blind Signature Scheme Based on Bilinear Pairings},
      howpublished = {Cryptology {ePrint} Archive, Paper 2006/439},
      year = {2006},
      url = {https://eprint.iacr.org/2006/439}
}