Two improved partially blind signature schemes from bilinear pairings

  • Authors:
  • Sherman S. M. Chow;Lucas C. K. Hui;S. M. Yiu;K. P. Chow

  • Affiliations:
  • Department of Computer Science, The University of Hong Kong, Hong Kong;Department of Computer Science, The University of Hong Kong, Hong Kong;Department of Computer Science, The University of Hong Kong, Hong Kong;Department of Computer Science, The University of Hong Kong, Hong Kong

  • Venue:
  • ACISP'05 Proceedings of the 10th Australasian conference on Information Security and Privacy
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

A blind signature scheme is a protocol for obtaining a digital signature from a signer, but the signer can neither learn the messages he/she sign nor the signatures the recipients obtain afterwards. Partially blind signature is a variant such that part of the message contains pre-agreed information (agreed by the signer and the signature requester) in unblinded form, while threshold blind signature distributes the signing power to a group of signers such that a signature can only be produced by interacting with a predetermined numbers of signers. In this paper, we propose a threshold partially blind signature scheme from bilinear pairings and an ID-based partially blind signature scheme, which are provably secure in the random oracle model. To the best of authors’ knowledge, we give the first discussion on these two notions.