Skip Navigation


The Computer Journal Advance Access first published online on May 11, 2009
This version published online on July 11, 2009
The Computer Journal, doi:10.1093/comjnl/bxp044
This Article
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
bxp044v2    most recent
bxp044v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Harn, L.
Right arrow Articles by Lin, C.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2009. Published by Oxford University Press on behalf of The British Computer Society. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Efficient On-line/Off-line Signature Schemes Based on Multiple-Collision Trapdoor Hash Families

Lein Harn1, Wen-Jung Hsin2 and Changlu Lin3,4,*

1 Department of Computer Science and Electrical Engineering, University of Missouri-Kansas City, Kansas City MO 64110, USA
2 Department of Information and Computer Science, Park University, Parkville, MO 64152, USA
3 State Key Laboratory of Information Security, Graduate University of Chinese Academy of Sciences, Beijing 10049, P.R. China
4 Key Laboratory of Network Security and Cryptology, Fujian Normal University, Fujian, 35007, P.R. China

* Corresponding author: lincl{at}is.ac.cn

Received 21 November 2008; revised 8 April 2009

The first on-line/off-line signature scheme introduced by Even et al. in 1990 has two problems: (a) impractical signature length and (b) a one-time use of signature generated during the off-line phase. In 2001, Shamir and Tauman significantly shortened the length of the signature by using trapdoor hash families introduced by Krawczyk and Rabin in 2000. However, each trapdoor hash value and its signature in the off-line phase of Shamir and Tauman's signature scheme can be used for signing only one message in the on-line phase. In this paper, we propose multiple-collision trapdoor hash families based on discrete logarithm and factoring assumptions, and provide formal proofs of their security. We also introduce an efficient on-line/off-line signature scheme based on our proposed trapdoor hash families. Our on-line/off-line signature scheme can re-use a trapdoor hash value for signing multiple messages. If a signer includes this trapdoor hash value in the public-key digital certificate, there is no need to have any regular digital signature scheme to sign the trapdoor hash value in the off-line phase.

Key Words: public-key digital certificate • on-line/off-line signature • discrete logarithm • integer factoring trapdoor hash family

Handling editor: Yannis Manolopoulos


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.