An Efficient and Secure Protocol for Multi-party Key Establishment

Author: Horng G.

Source: Computer Journal, Volume 44, Number 5, 2001 , pp. 463-470(8)

Buy & download fulltext article:

Price: $42.29 plus tax (Refund Policy)

Abstract:

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.

Language: English

Document Type: Original article

Affiliations: 1: Institute of Computer Science, National Chung-Hsing University, Taiwan, R.O.C. Email: gbhorng@cs.nchu.edu.tw

Publication date: 2001-01-01

More about this publication?

The Computer Journal publishes research papers in a full range of subject areas, as well as regular feature articles and occasional themed issues to enable readers to easily access information outside their direct area of research. The journal provides a complete overview of developments in the field of Computer Science.