A new signature scheme without random oracles from bilinear pairingsFaculty of Informatics - Papers (Archive)
AbstractIn 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.
Additional Grant Numberhttp://purl.org/au-research/grants/ARC/DP0557493
Citation InformationFangguo Zhang, Xiaofeng Chen, Willy Susilo and Yi Mu. "A new signature scheme without random oracles from bilinear pairings" (2006) p. 67 - 80
Available at: http://works.bepress.com/ymu/64/