Previous [ 1] [ 2] [ 3] [ 4] [ 5] [ 6] [ 7] [ 8] [ 9] [ 10]

@

Journal of Information Science and Engineering, Vol. 20 No. 2, pp. 391-400 (March 2004)

Secure Key-Evolving for Public Key Cryptosystems Based
on the Discrete Logarithm Problem
*

Cheng-Fen Lu+ and Shiuhpyng Shieh
Department of Computer Science and Information Engineering
Ta Hwa Institute of Technolgy
Hsinchu, 307 Taiwan
Computer Science and Information Engineering Department
National Chiao Tung Unviersity
Hsinchu, 300 Taiwan

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 Zp* and is efficient for the secret-key holder; the second operates in Zn* , and is efficient for the public-key holder. For both protocols, we provide proofs and analysis for correctness, security and efficiency.

Keywords: provable security, discrete logarithm, key management, key evolving, key independence

Full Text () Retrieve PDF document (200403_10.pdf)

Received June 24, 2002; revised November 15, 2002; accepted April 21, 2003.
Communicated by Chi Sung Laih.
* An earlier version of this paper has been published in the RSA Conference 2002, USA. This work is supported in part by Ministry of Education, National Science of Taiwan, and Lee & MTI Center, National Chiao Tung University.
+ This work was done while the first author was with National Chiao Tung University.