Title: A new signature scheme without random oracles

Authors: Chik How Tan

Addresses: Department of Computer Science and Media Technology, Gjovik University College, Norway

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.

Keywords: cryptography; signature schemes; strong RSA; networks; factorisation; security; authentication.

DOI: 10.1504/IJSN.2006.011783

International Journal of Security and Networks, 2006 Vol.1 No.3/4, pp.237 - 242

Published online: 21 Dec 2006 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article