Physical Sciences and Mathematics Commons^™

A New Signature Scheme Without Random Oracles From Bilinear Pairings, Fangguo Zhang, Xiaofeng Chen, Willy Susilo, Yi Mu

Faculty of Informatics - Papers (Archive)

In this paper, we propose a new signature scheme that is existentially unforgeable under a chosen message attack without random oracle. The security of the proposed scheme depends on a new complexity assumption called the k+1 square roots assumption. Moreover, the k+1 square roots assumption can be used to construct shorter signatures under the random oracle model.