| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10331990 | Information Processing Letters | 2005 | 7 Pages |
Abstract
We present a Group Key Exchange protocol which extends in a natural way the Diffie-Hellman protocol. Our protocol is scalable: it has two rounds (for n>2 parties) and the number of modular exponentiations per user is constant. It is secure against a passive adversary if the Diffie-Hellman problem is intractable.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Mike Burmester, Yvo Desmedt,