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
来源：
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING | 2004年 / 20卷 / 02期
关键词：
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 条
  • [1] Abdalla M, 2000, LECT NOTES COMPUT SC, V1976, P546
  • [2] Abdalla M, 2000, LECT NOTES COMPUT SC, V1976, P116
  • [3] Bellare M., 1999, Advances in Cryptology - CRYPTO'99. 19th Annual International Cryptology Conference. Proceedings, P431
  • [4] TIMESTAMPS IN KEY DISTRIBUTION PROTOCOLS
    DENNING, DE
    SACCO, GM
    [J]. COMMUNICATIONS OF THE ACM, 1981, 24 (08) : 533 - 536
  • [5] Dodis Y, 2002, LECT NOTES COMPUT SC, V2332, P65
  • [6] FELDMAN M, 1987, 28 S FDN COMP SCI FO, P427
  • [7] GUENTHER CG, 1989, P ADV CRYPT EUROCRYP, V434, P29
  • [8] ITKIS G, 2001, P ADV CRYPT CRYPTO 0, V2139, P332
  • [9] ITKIS G, 2002, CRYPTO
  • [10] KRAWCZYK H, 2000, P 7 ACM C COMP COMM, P108, DOI DOI 10.1145/352600.352617
12