Dynamic ElGamal Public Key Generation with Tight Binding

dc.contributor.authorPoovendran, R.en_US
dc.contributor.authorCorson, M. Scotten_US
dc.contributor.authorBaras, John S.en_US
dc.contributor.departmentISRen_US
dc.contributor.departmentCSHCNen_US
dc.date.accessioned2007-05-23T10:08:41Z
dc.date.available2007-05-23T10:08:41Z
dc.date.issued1999en_US
dc.description.abstractWe present a new distributed, group ElGamal public key generation algorithm which also permits maintenance of a group-specific, dynamic,individual ElGamal public key infrastructure.<p> We parameterize the group with a time-varying quantity that servesas a distributed mechanism for controlling key generation privilege.<P>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. <p>We note that many of the recently proposed distributed key management~[2-4] schemes need such group keys for certification and signing purposes.en_US
dc.format.extent218562 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/1903/6100
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 1999-85en_US
dc.relation.ispartofseriesCSHCN; TR 1999-43en_US
dc.subjectASIC supporting multiple modulationen_US
dc.subjectdata-aided (DA) estimatorsen_US
dc.subjectQPSK/OQPSK burst modemsen_US
dc.subjectCramer-Rao lower bound (CRLB)en_US
dc.subjectGlobal Communication Systemsen_US
dc.titleDynamic ElGamal Public Key Generation with Tight Bindingen_US
dc.typeTechnical Reporten_US

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
TR_99-85.pdf
Size:
213.44 KB
Format:
Adobe Portable Document Format