Dynamic Elgamal Public Key Generation with Tight Binding

Loading...
Thumbnail Image

Files

TR_99-79.pdf (424.17 KB)
No. of downloads: 336

Publication or External Link

Date

1999

Citation

DRUM DOI

Abstract

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 mechanism for controlling key generation privilege.

Our scheme can be viewed as an alternative to polynomial schemes where, at the time of the secret construction step, there has to be a third party or a 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 to 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 recently proposed distributed key management schemes need such group keys for certification and signing purposes.

3rd Annual Conference on Advanced Telecommunications and Information Distribution Research Program (ATIRP)

Notes

Rights