Chameleon hashes without key exposure based on factoring

被引:13
作者
Gao, Wei [1 ]
Wang, Xue-Li
Xie, Dong-Qing
机构
[1] Hunan Univ, Sch Math & Econometr, Changsha 410082, Peoples R China
[2] S China Normal Univ, Sch Math Sci, Guangzhou 510631, Peoples R China
[3] Hunan Univ, Sch Comp & Commun, Changsha 410082, Peoples R China
关键词
chameleon signature; chameleon hash; key-exposure;
D O I
10.1007/s11390-007-9015-9
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Chameleon hash is the main primitive to construct a chameleon signature scheme which provides nonrepudiation and non-transferability simultaneously. However, the initial chameleon hash schemes suffer from the key exposure problem: non-transferability is based on an unsound assumption that the designated receiver is willing to abuse his private key regardless of its exposure. Recently, several key-exposure- free chameleon hashes have been constructed based on RSA assumption and SDH (strong Diffie-Hellman) assumption. In this paper, we propose a factoring-based chameleon hash scheme which is proven to enjoy all advantages of the previous schemes. In order to support it, we propose a variant Rabin signature scheme which is proven secure against a new type of attack in the random oracle model.
引用
收藏
页码:109 / 113
页数:5
相关论文
共 13 条
  • [1] Ateniese G, 2004, LECT NOTES COMPUT SC, V3110, P164
  • [2] ATENIESE G, 2004, LNCS, V3352, P165
  • [3] Bellare M, 2004, LECT NOTES COMPUT SC, V3027, P268
  • [4] Bellare M, 1996, LECT NOTES COMPUT SC, V1070, P399
  • [5] Bellare M., 1995, P 1 ACM C COMPUTER C, P62
  • [6] Chen XF, 2004, LECT NOTES COMPUT SC, V3225, P87
  • [7] FISCHLIN M, 2002, LNCS, V2271, P96
  • [8] Gennaro R, 2004, LECT NOTES COMPUT SC, V3152, P220
  • [9] A DIGITAL SIGNATURE SCHEME SECURE AGAINST ADAPTIVE CHOSEN-MESSAGE ATTACKS
    GOLDWASSER, S
    MICALI, S
    RIVEST, RL
    [J]. SIAM JOURNAL ON COMPUTING, 1988, 17 (02) : 281 - 308
  • [10] Implementation of cryptosystems based on tate pairing
    Hu, L
    Dong, JW
    Pei, DY
    [J]. JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2005, 20 (02) : 264 - 269