Efficiency Comparison of Various Important Established Digital Short Signature Schemes Based on Bilinear Pairings

ABSTARCT Short signature is a variant of digital signature. Short digital signatures are needed in environments where a human is asked to manually key in the signature. The short signature provides shorter signature length compare to the other simple digital signature. Several short signature schemes using bilinear pairings have been proposed but they are different in terms of involved operations cost. In this paper, we compare the efficiency of important established short signatures schemes based on the involved operation cost and generated signature length. The security of all the short signature schemes is based on the intractability of some Diffie-Hellman problem. We also implement all the undertaken short signature scheme and compare the schemes according to their consumed running time. Keywords: Digital Signature, Short signature, bilinear pairings, Diffie-Hellman Problem.