Efficient Short Signatures from Pairing
Raylin Tso, Takeshi Okamoto, Eiji Okamoto · 2009
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.