Secure key-evolving for public key cryptosystems based on the discrete logarithm problem

被引:1
作者
Lu, CF [1 ]
Shieh, SP
机构
[1] Ta Hwa Inst Technol, Dept Comp Sci & Informat Engn, Hsinchu 307, Taiwan
[2] Natl Chiao Tung Univ, Comp Sci & Informat Engn Dept, Hsinchu 300, Taiwan
关键词
provable security; discrete logarithm; key management; key evolving; key independence;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper addresses the security and efficiency of key-evolving protocols in public key encryption and signature schemes, where the security assumption is the intractability of the discrete logarithm problem. We identify the key-independence property as the security goal of key-evolving, so that each periodic secret key is independent of each other. The first protocol operates in Z(p)* and is efficient for the secret-key holders the second operates in Z(n)*, and is efficient for the public-key holder. For both protocols, we provide proofs and analysis for correctness, security and efficiency.
引用
收藏
页码:391 / 400
页数:10
相关论文
共 19 条
[11]  
Lu C. F., 2002, LNCS, V2271, P300
[12]  
Maurer U. M., 1996, Designs, Codes and Cryptography, V9, P305, DOI 10.1007/BF00129771
[13]  
Menezes A. J, 1997, HDB APPL CRYPTOGRAPH
[14]  
PERRIG A, 2000, P 7 ACM C COMP COMM, P235
[15]   HOW TO SHARE A SECRET [J].
SHAMIR, A .
COMMUNICATIONS OF THE ACM, 1979, 22 (11) :612-613
[16]  
TZENG W, ROBUST KEY EVOLVING
[17]  
YACOBI Y, 1990, ADV CRYPTOLOGY, P268
[18]  
YACOBI Y, 1989, ADV CRYPTOLOGY, P268
[19]  
[No title captured]