Dynamic Elgamal Public Key Generation with Tight Binding
Date: February 02 - February 04, 1999
We present a new distributed ,group ElGamal public key generation algorithm which also permits maintenance of a group specific, dynamic,individual ElGamal public key infrastructure. We parameterize the group with a time varying quantity that serves as a distributed mechansim for controlling key generation privilege. Our scheme can be viewed as an alternative to polynomial schemes where, at the time of secret construction step,there has to be a thrid party or black box to combine the shares. Also, in polynomial schemes, at the time of combining, the individual shares of the secret have to be revealed the third party. In our scheme, the common secret can be generated without ever exposing the individual shares constructing it. We note that many of the proposed distributed key management [2-4] schemes need such group keys for certification and signing process.