Infinite resilient key-evolving scheme

  • Authors:

  • Biao Li;Zhen-fu Cao;Shen-sheng Zhang

  • Affiliations:

  • Department of computer science and engineering, University of Shanghai Jiaotong, Shanghai, P.R.China;Department of computer science and engineering, University of Shanghai Jiaotong, Shanghai, P.R.China;Department of computer science and engineering, University of Shanghai Jiaotong, Shanghai, P.R.China

  • Venue:
  • ICCC '02 Proceedings of the 15th international conference on Computer communication
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

Literature [1] has proposed a robust key-evolving scheme, in which each private key is a point of a Z-degree polynomial and the public key is the commitment to the coefficients of such polynomial. However, the exposure of any Z+1 point will reveal the polynomial and an adversary can calculate any private key he wants. In this paper an infinite resilient robust key-evolving scheme is proposed to provide capability to resist infinite exposure of private keys by using any finite-degree polynomial