Short Signature Scheme From Bilinear Pairings?

Abstract. The first short signature scheme is proposed by Boneh, Lynn, and Shacham (BLS) in [8]. This scheme uses the properties of bilinear pairings on certain elliptic curves. The main problem in BLS scheme is the use of special hash function [3, 5, 8]. To deal with this problem, many cryptographic schemes were proposed with cryptographic hash functions such as MD5, SHA-1 [14]. In this paper, we propose a new and efficient short signature scheme from the bilinear pairings. Our scheme is con-structed by Bilinear Inverse-Square Diffie-Hellman Problem (BISDHP) and does not require any special hash function. The exact security proofs are also explained in the random oracle model. We give the implemen-tation and comparison results of the BLS and ZSS (Zhang, Safavi, and Susilo)[14] schemes. Furthermore, We use this signature scheme to con-struct a ring signature scheme. Key words: short signature, bilinear pairings, ring signature