Efficient generic on-line/off-line (threshold) signatures without key exposure |
| |
Authors: | Xiaofeng Chen Fangguo Zhang Haibo Tian Baodian Wei Willy Susilo Yi Mu Hyunrok Lee Kwangjo Kim |
| |
Affiliation: | aSchool of Information Science and Technology, Sun Yat-Sen University, Guangzhou 510275, PR China;bCentre for Computer and Information Security Research, School of Computer Science and Software Engineering, University of Wollongong, Australia;cInternational Research Center for Information Security (IRIS), Information and Communications University, Taejon 305-714, Republic of Korea |
| |
Abstract: | The “hash–sign–switch” paradigm was firstly proposed by Shamir and Tauman with the aim to design an efficient on-line/off-line signature scheme. Nonetheless, all existing on-line/off-line signature schemes based on this paradigm suffer from the key exposure problem of chameleon hashing. To avoid this problem, the signer should pre-compute and store a plenty of different chameleon hash values and the corresponding signatures on the hash values in the off-line phase, and send the collision and the signature for a certain hash value in the on-line phase. Hence, the computation and storage cost for the off-line phase and the communication cost for the on-line phase in Shamir–Tauman’s signature scheme are still a little more overload. In this paper, we first introduce a special double-trapdoor hash family based on the discrete logarithm assumption and then incorporate it to construct a more efficient generic on-line/off-line signature scheme without key exposure. Furthermore, we also present the first key-exposure-free generic on-line/off-line threshold signature scheme without a trusted dealer. Additionally, we prove that the proposed schemes have achieved the desired security requirements. |
| |
Keywords: | On-line/off-line Threshold signatures Double-trapdoor Chameleon hashing Key exposure problem |
本文献已被 ScienceDirect 等数据库收录! |
|