Title :
Efficient Short Signatures from Pairing
Author :
Tso, Raylin ; Okamoto, Takeshi ; Okamoto, Eiji
Author_Institution :
Dept. of Comput. Sci., Nat. Chengchi Univ., Taipei
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.
Keywords :
cryptography; digital signatures; BLS scheme; PDA; cell phones; k-CAA problem; low-bandwidth channels; low-computation power; random oracle model; short signature schemes; Batteries; Cellular phones; Computer science; Cryptography; Humans; Information technology; Personal digital assistants; Power generation; Power system modeling; Security; Applied cryptography; bilinear-pairings; information security; random oracle model; short signature;
Conference_Titel :
Information Technology: New Generations, 2009. ITNG '09. Sixth International Conference on
Conference_Location :
Las Vegas, NV
Print_ISBN :
978-1-4244-3770-2
Electronic_ISBN :
978-0-7695-3596-8
DOI :
10.1109/ITNG.2009.176
