JISE


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


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


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

  Retrieve PDF document (JISE_200402_10.pdf)