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.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Taek-Young YOUN, Young-Ho PARK, Jongin LIM, "An Efficient Signature Scheme with Fast Online Signing" in IEICE TRANSACTIONS on Fundamentals,
vol. E92-A, no. 10, pp. 2431-2437, October 2009, doi: 10.1587/transfun.E92.A.2431.
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/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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E92.A.2431/_p
Copy
@ARTICLE{e92-a_10_2431,
author={Taek-Young YOUN, Young-Ho PARK, Jongin LIM, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={An Efficient Signature Scheme with Fast Online Signing},
year={2009},
volume={E92-A},
number={10},
pages={2431-2437},
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/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.},
keywords={},
doi={10.1587/transfun.E92.A.2431},
ISSN={1745-1337},
month={October},}
Copy
TY - JOUR
TI - An Efficient Signature Scheme with Fast Online Signing
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2431
EP - 2437
AU - Taek-Young YOUN
AU - Young-Ho PARK
AU - Jongin LIM
PY - 2009
DO - 10.1587/transfun.E92.A.2431
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E92-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 2009
AB - 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.
ER -