## Diffie-Hellman Key Distribution Extended to Group Communication (1996)

### Cached

### Download Links

- [www.isi.edu]
- [www.ics.uci.edu]
- [www.semper.org]
- DBLP

### Other Repositories/Bibliography

Citations: | 204 - 10 self |

### BibTeX

@INPROCEEDINGS{Steiner96diffie-hellmankey,

author = {Michael Steiner and Gene Tsudik and Michael Waidner},

title = {Diffie-Hellman Key Distribution Extended to Group Communication},

booktitle = {},

year = {1996},

pages = {31--37},

publisher = {ACM Press}

}

### Years of Citing Articles

### OpenURL

### Abstract

Ever since 2-party Diffie-Hellman key exchange was first proposed in 1976, there have been efforts to extend its simplicity and elegance to a group setting. Notable solutions have been proposed by Ingemarsson et al. (in 1982) and Burmester/Desmedt (in 1994). In this paper, we consider a class of protocols that we call natural extensions of DiffieHellman to the n-party case. After demonstrating the security of the entire class based on the intractability of the Diffie-Hellman problem we introduce two novel and practical protocols and compare them to the previous results. We argue that our protocols are optimal with respect to certain aspects of protocol complexity. 1 Introduction It has been almost twenty years since Diffie-Hellman (DH) 2-party key exchange was first proposed in [1]. In the meantime, there have been many attempts to extend its elegance and simplicity to the group setting. The main motivating factor is the increasing popularity of various types of groupware application...

### Citations

2750 | New Directions in Cryptography
- DiÆe, Hellman
- 1976
(Show Context)
Citation Context ...t our protocols are optimal with respect to certain aspects of protocol complexity. 1 Introduction It has been almost twenty years since Diffie-Hellman (DH) 2-party key exchange was first proposed in =-=[1]-=-. In the meantime, there have been many attempts to extend its elegance and simplicity to the group setting. The main motivating factor is the increasing popularity of various types of groupware appli... |

587 |
Efficient signature generation by smart cards
- Schnorr
- 1991
(Show Context)
Citation Context ...gen choses randomly a pair (q; ff) such that q has length k bit, q and q 0 = 2q + 1 are both prime, and ff generates the unique subgroup G of ZZ q 0 of order q. Groups of this type are used, e.g., in =-=[10]-=- and [11]. The indistinguishability of the 2-party key is considered, e.g., in [12]. For (q; ff) / gen(k), n 2 N, and X = (N1 ; : : : ; Nn) for N i 2 ZZq , let ffl view(q; ff; n; X) := the ordered set... |

137 | An efficient off-line electronic cash system based on the representation problem, CWI
- Brands
- 1993
(Show Context)
Citation Context ... are both prime, and ff generates the unique subgroup G of ZZ q 0 of order q. Groups of this type are used, e.g., in [10] and [11]. The indistinguishability of the 2-party key is considered, e.g., in =-=[12]-=-. For (q; ff) / gen(k), n 2 N, and X = (N1 ; : : : ; Nn) for N i 2 ZZq , let ffl view(q; ff; n; X) := the ordered set of all ff N i 1 \Delta\Delta\Delta N i m for all proper subsets fi1 ; : : : ; i mg... |

119 |
A conference key distribution system
- Ingemarsson, Tang, et al.
- 1982
(Show Context)
Citation Context ...roupware applications and the need of doing it securely. Since key distribution is the cornerstone of secure group communication, it has naturally received a lot of attention. (See, for example: [2], =-=[3]-=-, [4], [5], [6], [7], [8], [9].) Unfortunately some of the results are of only theoretical interest, while the security of some others remains unproven. In this paper we consider a class of protocols ... |

95 |
A secure audio teleconference system
- Steer, Strawczynski, et al.
- 1988
(Show Context)
Citation Context ... of groupware applications and the need of doing it securely. Since key distribution is the cornerstone of secure group communication, it has naturally received a lot of attention. (See, for example: =-=[2]-=-, [3], [4], [5], [6], [7], [8], [9].) Unfortunately some of the results are of only theoretical interest, while the security of some others remains unproven. In this paper we consider a class of proto... |

74 |
A Secure Group Membership Protocol
- Reiter
- 1996
(Show Context)
Citation Context ...ition and member deletion protocols for GDH.2 and GDH.3. (GDH.1 does not lend itself to efficient construction of such protocols.) For a more general solution to the secure group membership see, e.g. =-=[13]-=-. 3.5.1 Member Addition The main security requirement of member addition is the secrecy of the previous group keys with respect to both outsiders and new group members. In GDH.2 this can be achieved a... |

42 |
Group key management protocol (GKMP) architecture’, RFC
- Harney, Muckenhirn
- 1997
(Show Context)
Citation Context ...are applications and the need of doing it securely. Since key distribution is the cornerstone of secure group communication, it has naturally received a lot of attention. (See, for example: [2], [3], =-=[4]-=-, [5], [6], [7], [8], [9].) Unfortunately some of the results are of only theoretical interest, while the security of some others remains unproven. In this paper we consider a class of protocols that ... |

20 |
Cryptosystem for group oriented cryptography
- Hwang
- 1991
(Show Context)
Citation Context ... the need of doing it securely. Since key distribution is the cornerstone of secure group communication, it has naturally received a lot of attention. (See, for example: [2], [3], [4], [5], [6], [7], =-=[8], [9].) Un-=-fortunately some of the results are of only theoretical interest, while the security of some others remains unproven. In this paper we consider a class of protocols that we call "natural" ex... |

6 |
The Design Of A Conference Key Distribution System
- Chang, Wu, et al.
- 1992
(Show Context)
Citation Context ...ations and the need of doing it securely. Since key distribution is the cornerstone of secure group communication, it has naturally received a lot of attention. (See, for example: [2], [3], [4], [5], =-=[6], [7]-=-, [8], [9].) Unfortunately some of the results are of only theoretical interest, while the security of some others remains unproven. In this paper we consider a class of protocols that we call "n... |

6 |
Methods of multi-party cryptographic key establishment
- Just
- 1994
(Show Context)
Citation Context ...s and the need of doing it securely. Since key distribution is the cornerstone of secure group communication, it has naturally received a lot of attention. (See, for example: [2], [3], [4], [5], [6], =-=[7], [8]-=-, [9].) Unfortunately some of the results are of only theoretical interest, while the security of some others remains unproven. In this paper we consider a class of protocols that we call "natura... |

3 |
Quantum Conference Key Distribution Systems
- Mu, Zheng, et al.
- 1994
(Show Context)
Citation Context ...pplications and the need of doing it securely. Since key distribution is the cornerstone of secure group communication, it has naturally received a lot of attention. (See, for example: [2], [3], [4], =-=[5]-=-, [6], [7], [8], [9].) Unfortunately some of the results are of only theoretical interest, while the security of some others remains unproven. In this paper we consider a class of protocols that we ca... |