An Efficient and Secure Protocol for Multi-party Key Establishment

In this paper, a multi-party key establishment protocol based on the difficulty of calculating discrete logarithms in a finite field is proposed with the following features. It requires a constant number (independent of the number of participants) of rounds. All messages have the same constant size....

Full description

Saved in:
Bibliographic Details
Published in:Computer journal 2001-01, Vol.44 (5), p.463-470
Main Author: Horng, Gwoboa
Format: Article
Language:English
Subjects:
Agreements
Algorithms
Communication channels
Protocol
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, a multi-party key establishment protocol based on the difficulty of calculating discrete logarithms in a finite field is proposed with the following features. It requires a constant number (independent of the number of participants) of rounds. All messages have the same constant size. All participants perform a constant number of exponential operations. All participants agree on a key together with two random integers simultaneously. Furthermore, to establish a new key when the set of participants is changed is easy. We also show that this new scheme is secure against passive attacks provided that the Diffie-Hellman key agreement protocol is secure in the sense that the established key is computationally indistinguishable from a random value.
ISSN:0010-4620
1460-2067
DOI:10.1093/comjnl/44.5.463