Detailed Information
Cited 0 time in 
Cited 0 time in 
Cited 0 time in
Metadata Downloads
An Efficient Signature Scheme with Fast Online Signing
- Authors
- Youn, Taek-Young; Park, Young-Ho; Lim, Jongin
- Issue Date
- Oct-2009
- Publisher
- IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
- Keywords
- online/offline signature; trapdoor hash function; strong RSA assumption; division intractability; discrete logarithm with short exponent problem
- Citation
- IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, v.E92A, no.10, pp.2431 - 2437
- Indexed
- SCIE
SCOPUS
- Volume
- E92A
- Number
- 10
- Start Page
- 2431
- End Page
- 2437
- ISSN
- 0916-8508
- Abstract
- 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/online 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.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - School of Cyber Security > Department of Information Security > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.