A threshold proxy signature scheme from bilinear pairings

  • Authors:
  • Dianjun Lu;Bingru Zhang;Haixing Zhao;Xinyan Li

  • Affiliations:
  • Department of Mathematics and Information Science, Qinghai Normal University, Xining, China;Department of Mathematics and Information Science, Qinghai Normal University, Xining, China;Department of Mathematics and Information Science, Qinghai Normal University, Xining, China;Department of Mathematics, Changjiang Normal College, ChongQing, China

  • Venue:
  • WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
  • Year:
  • 2009

Quantified Score

Hi-index 0.01

Visualization

Abstract

Threshold proxy signature is a variant of the proxy signature scheme in which only some subgroup of proxy signers can sign messages on behalf of the original signer. Many existing threshold proxy signature schemes reveal that the receiver cannot find out who signed the proxy signatures. In this article, we provided a novel (t, n) threshold proxy signature scheme from bilinear pairings without a trusted dealer. In our scheme, the original signer can know who generated the proxy signature, and the receiver can certify the actuality of the group signers who made the proxy signature. Most of our constructions would be simpler but still with high security due to the properties of bilinear map built from Weil pairing or Tate pairing.