A new provably secure signature scheme

被引：0

作者：

Tan, CH ^{[1
]}

Yi, X ^{[1
]}

Siew, CK ^{[1
]}

机构：

[1] Nanyang Technol Univ, Sch Elect & Elect Engn, Singapore 639798, Singapore

来源：

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES | 2003年 / E86A卷 / 10期

关键词：

cryptography; digital signature; strong RSA assumption;

D O I：

暂无

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

In this paper, we construct a new signature scheme which is provably secure against adaptive chosen message attack in the standard model under the strong RSA assumption. The proposed scheme is different from Cramer-Shoup scheme and Camenisch-Lysyanskaya scheme and is more efficient than them. The tradeoff of the proposed scheme is a slight increase of the secret key.

引用

页码：2633 / 2635

页数：3

共 7 条

[1]

[Anonymous], 1995, INTRO ANAL PROBABILI

[2]

Bellare M., 1995, P 1 ACM C COMPUTER C, P62

[3]

Camenisch J, 2003, LECT NOTES COMPUT SC, V2576, P268

[4]

Cramer R, 1999, 6TH ACM CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, P46, DOI 10.1145/319709.319716

[5]

Gennaro R, 1999, LECT NOTES COMPUT SC, V1592, P123

[6] A DIGITAL SIGNATURE SCHEME SECURE AGAINST ADAPTIVE CHOSEN-MESSAGE ATTACKS [J].

GOLDWASSER, S ;

MICALI, S ;

RIVEST, RL .

SIAM JOURNAL ON COMPUTING, 1988, 17 (02) :281-308

[7]

RIVEST RL, 1978, COMMUN ACM, V21, P120, DOI 10.1145/357980.358017

← 1 →