A New Short Signature Scheme Without Random Oracles from Bilinear Pairings.
Fangguo Zhang, Xiaofeng Chen, Willy Susilo, Yi Mu · 2005
To date, there exist three short signature schemes from bilinear pairings. In this paper, we propose a new signature scheme that is existentially unforgeable under a chosen message attack without random oracle. The security of our scheme depends on a new complexity assumption called the k+1 square roots assumption. We also discuss the relationship between the k+1 square roots assumption and some related problems and provide some conjectures. Moreover, the k+1 square roots assumption can be used to construct shorter signatures under the random oracle model.