The search functionality is under construction.
The search functionality is under construction.

An Efficient Signature Scheme with Fast Online Signing

Taek-Young YOUN, Young-Ho PARK, Jongin LIM

  • Full Text Views

    0

  • Cite this

Summary :

In 1999, Gennaro, Halevi and Rabin proposed a signature which achieves provable security without assuming the random oracles, and it is the first RSA-type signature whose security is proved in the standard model. Since that time, several signatures have been proposed to achieve better efficiency or useful property along with the provable security in the standard model. In this paper, we construct a trapdoor hash function, and design an efficient online/offline signature by using the trapdoor hash function. Our signature scheme requires only one non-modular multiplication of two small integers for online signing, and it provides the fastest online signing among all online/offline signatures that achieve provable security in the standard model.

Publication
IEICE TRANSACTIONS on Fundamentals Vol.E92-A No.10 pp.2431-2437
Publication Date
2009/10/01
Publicized
Online ISSN
1745-1337
DOI
10.1587/transfun.E92.A.2431
Type of Manuscript
Special Section PAPER (Special Section on Information Theory and Its Applications)
Category
Cryptography and Information Security

Authors

Keyword