A Further Improved Online/Offline Signature Scheme

被引：2

作者：

Gao, Chong-zhi ^{[1
]}

Yao, Zheng-an ^{[2
]}

机构：

[1] Guangzhou Univ, Sch Comp Sci, Guangzhou 510006, Guangdong, Peoples R China

[2] Sun Yat Sen Univ, Sch Math & Computat Sci, Guangzhou 510275, Guangdong, Peoples R China

来源：

FUNDAMENTA INFORMATICAE | 2009年 / 91卷 / 3-4期

关键词：

Cryptography; Signature Schemes; Online/Offline; Trapdoor Hash Family; IDENTIFICATION; SECURITY; ATTACKS; PROOFS;

D O I：

10.3233/FI-2009-0055

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

Online/offline signatures are used in a particular scenario where the signer must respond quickly once the message to be signed is presented. In this paper, we present a general method to efficiently convert a trapdoor hash family into an online/offline signature scheme without resorting to any additional signature scheme. We prove that the new scheme is secure in the random oracle model if the underlying trapdoor hash family is collision resistant. Compared to Shamir and Tauman's paradigm, there is an almost 50% reduction in overall computational cost by using the new scheme.

引用

页码：523 / 532

页数：10

共 13 条

[1]

Abdalla M, 2002, LECT NOTES COMPUT SC, V2332, P418

[2]

[Anonymous], 22 ANN ACM S THEOR C

[3]

[Anonymous], 2001, LNCS

[4]

Bellare M, 2002, LECT NOTES COMPUT SC, V2442, P162

[5]

Bellare M., 1993, C COMPUTER COMMUNICA, P62

[6] MINIMUM DISCLOSURE PROOFS OF KNOWLEDGE [J].

BRASSARD, G ;

CHAUM, D ;

CREPEAU, C .

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1988, 37 (02) :156-189

[7] The random oracle methodology, revisited [J].

Canetti, R ;

Goldreich, O ;

Halevi, S .

JOURNAL OF THE ACM, 2004, 51 (04) :557-594

[8]

Chor B., 1985, 26th Annual Symposium on Foundations of Computer Science (Cat. No.85CH2224-4), P429, DOI 10.1109/SFCS.1985.62

[9]

EVEN S, 1991, LNCS, V435, P263

[10] HOW TO PROVE YOURSELF - PRACTICAL SOLUTIONS TO IDENTIFICATION AND SIGNATURE PROBLEMS [J].

FIAT, A ;

SHAMIR, A .

LECTURE NOTES IN COMPUTER SCIENCE, 1987, 263 :186-194

← 1 2 →