A forward-secure blind signature scheme based on the strong RSA assumption

被引:0
作者
Duc, DN
Cheon, JH
Kim, K
机构
[1] ICU, Int Res Ctr Informat Secur, IRIS, Taejon 305732, South Korea
[2] Seoul Natl Univ, Sch Math Sci, Seoul 151747, South Korea
来源
INFORMATION AND COMMUNICATIONS SECURITY, PROCEEDINGS | 2003年 / 2836卷
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Key exposures bring out very serious problems in security services. Especially, it is more severe in the applications such as electronic cash or electronic payment where money is directly involved. Forward secrecy is one of the security notions addressing the key exposure issues. Roughly speaking, forward secrecy is aimed to protect the validity of all actions using the secret key before the key exposure. In this paper, we investigate the key exposure problem in blind signature (with an application to the electronic cash in mind) and propose a blind signature scheme which guarantees, forward secrecy. Our scheme is constructed from the provably secure Okamoto-Guillou-Quisquater (OGQ for short) blind signature scheme. Using the forking lemma by Pointcheval and Stern [4], we can show the equivalence between the existence of a forger with the solvability of the strong RSA problem. Further we show that our scheme introduces no significant communication overhead comparing with the original OGQ scheme.
引用
收藏
页码:11 / 21
页数:11
相关论文
共 14 条
[1]  
ANDERSON R, 1997, 4 ANN C COMP COMM SE
[2]  
[Anonymous], 1999, LNCS
[3]  
[Anonymous], 2001, LECT NOTES COMPUTER
[4]  
Boneh D, 1998, LECT NOTES COMPUT SC, V1403, P59, DOI 10.1007/BFb0054117
[5]  
CHAUM D, 1982, ADV CRYPTOLOGY CRYPT, P199
[6]  
Cramer R., 2000, ACM Transactions on Information and Systems Security, V3, P161, DOI 10.1145/357830.357847
[7]  
GUILLOU LC, 1988, LECT NOTES COMPUT SC, V330, P123
[8]  
Hamdy S, 2000, LECT NOTES COMPUT SC, V1976, P234
[9]  
Juels A, 1997, LECT NOTES COMPUT SC, V1294, P150
[10]  
Okamoto T., 1993, Advances Cryptology-CRYPTO, P31