Efficient Short Signatures from Pairing

  • Authors:
  • Raylin Tso;Takeshi Okamoto;Eiji Okamoto

  • Affiliations:
  • -;-;-

  • Venue:
  • ITNG '09 Proceedings of the 2009 Sixth International Conference on Information Technology: New Generations
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Short signature schemes are useful for systems where signatures are typed in by a human or for systems with low-bandwidth channels and/or low-computation power such as PDAs or cell phones. In this paper, a new short signature scheme is proposed. Our scheme is more efficient than Zhang et al.'s scheme and BLS scheme. Based on the hardness of k-CAA Problem, we provide a rigorous proof for our scheme in the random oracle model.