Skip to main content
Article
A new signature scheme without random oracles from bilinear pairings
Faculty of Informatics - Papers (Archive)
  • Fangguo Zhang, Sun Yat-Sen University
  • Xiaofeng Chen, Sun Yat-Sen University
  • Willy Susilo, University of Wollongong
  • Yi Mu, University of Wollongong
RIS ID
15714
Publication Date
1-1-2006
Publication Details

Zhang, F., Chen, X., Susilo, W. & Mu, Y. (2006). A new signature scheme without random oracles from bilinear pairings. In P. Nguyen (Eds.), International Conference on Cryptology in Vietnam 2006 (Vietcrypt 2006) (pp. 67-80). Berlin, Germany: Springer-Verlag.

Abstract

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.

Grant Number
ARC/DP0557493
Citation Information
Fangguo 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/