The full text of this article


A new signature scheme without random oracles
by Chik How Tan
International Journal of Security and Networks (IJSN), Vol. 1, No. 3/4, 2006


Abstract: Digital signature is commonly used for authentication of a user or data. In order to ensure the security of a signature scheme, it is important to design a signature scheme with a security proof. In 1999, Gennaro et al. and Cramer et al. respectively proposed practical and provably secure signature schemes under the standard assumption without the random oracle model. Since then, some provably secure signature schemes in the standard model were constructed, for example, Camenisch–Lysyanskaya scheme in 2002; Fischlin scheme and Tan-Yi-Siew scheme in 2003. In this paper, we construct a new provably secure signature scheme based on the strong RSA assumption against existential forgery under adaptive chosen message attack in the standard model. The proposed scheme is also more efficient than other provable secure schemes in the standard model.

Online publication date: Thu, 21-Dec-2006


is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Security and Networks (IJSN):
Login with your Inderscience username and password:


    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email