Efficient ID-based Threshold Signature Schemes without Pairings

Jun Shao; Zhenfu Cao; Licheng Wang

Paper 2006/308

Efficient ID-based Threshold Signature Schemes without Pairings

Jun Shao, Zhenfu Cao, and Licheng Wang

Abstract

The focus of this paper is to design an efficient and secure solution addressing the key escrow problem in ID-based signature schemes, i.e., the Private Key Generator (PKG) knows the user's private key, which damages the essential requirement--``non-repudiation" property of signature schemes. In this paper, we proposed two ID-based threshold signature schemes, which both reach Girault's trusted level 3, and in which there exists only one PKG in our ID-based threshold signature schemes. In particular, the second scheme has another good property: it does not require trusting any particular party at any time. Compared with the previous schemes, our schemes do not need to compute pairings, which make them be more efficient than those schemes. Furthermore, our ID-based signature schemes increase the availability of the signing agency and the difficulty for the adversary to learn the private key.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Published elsewhere. Unknown where it was published
Keywords: ID-based signature threshold signature the Schnorr's signature
Contact author(s): chn junshao @ gmail com
History: 2006-09-06: received
Short URL: https://ia.cr/2006/308
License: CC BY

BibTeX

@misc{cryptoeprint:2006/308,
      author = {Jun Shao and Zhenfu Cao and Licheng Wang},
      title = {Efficient {ID}-based Threshold Signature Schemes without Pairings},
      howpublished = {Cryptology {ePrint} Archive, Paper 2006/308},
      year = {2006},
      url = {https://eprint.iacr.org/2006/308}
}