Secure key-evolving protocols for discrete logarithm schemes

Cheng Fen Lu, Shiuhpyng Shieh

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

8 Scopus citations

Abstract

This paper addresses the security and efficiency of key-evolving protocols. We identify forward-secrecy and backward-secrecy as the security goals for key-evolving and present two protocols to achieve these goals. The first protocol is operated in Z(formula presented) and is efficient for the secretkey holder; the second one is operated in Z(formula presented), and is efficient for the public-key holder. For both protocols, we provide proofs and analysis for correctness, security and efficiency.

Original languageEnglish
Title of host publicationTopics in Cryptology - CT-RSA 2002 - the Cryptographers Track at the RSA Conference 2002, Proceedings
EditorsBart Preneel
PublisherSpringer Verlag
Pages300-309
Number of pages10
ISBN (Print)3540432248
DOIs
StatePublished - 1 Jan 2002
EventCryptographers’ Track at the RSA Security Conference, CT-RSA 2002 - San Jose, United States
Duration: 18 Feb 200222 Feb 2002

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2271
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceCryptographers’ Track at the RSA Security Conference, CT-RSA 2002
CountryUnited States
CitySan Jose
Period18/02/0222/02/02

Keywords

  • Backward-secrecy
  • Forward-secrecy
  • Key management
  • Key-evolving

Fingerprint Dive into the research topics of 'Secure key-evolving protocols for discrete logarithm schemes'. Together they form a unique fingerprint.

Cite this