Authenticated group key agreement and friends

Giuseppe Ateniese, Michael Steiner, Gene Tsudik

Research output: Contribution to conferencePaper

  • 116 Citations

Abstract

Many modern computing environments involve dynamic peer groups. Distributed simulation, multi-user games, conferencing and replicated servers are just a few examples. Given the openness of today's networks, communication among group members must be secure and, at the same time, efficient. This paper studies the problem of authenticated key agreement in dynamic peer groups with the emphasis on efficient and provably secure key authentication, key confirmation and integrity. It begins by considering 2-party authenticated key agreement and extends the results to Group Diffie-Hellmam key agreement. In the process, some new security properties (unique to groups) are discussed.

LanguageEnglish (US)
Pages17-26
Number of pages10
StatePublished - Dec 1 1998
Externally publishedYes
EventProceedings of the 1998 5th ACM Conference on Computer and Communications Security, CCS-5 - San Francisco, CA, USA
Duration: Nov 3 1998Nov 5 1998

Other

OtherProceedings of the 1998 5th ACM Conference on Computer and Communications Security, CCS-5
CitySan Francisco, CA, USA
Period11/3/9811/5/98

Fingerprint

Authentication
Telecommunication networks
Servers

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Networks and Communications

Cite this

Ateniese, G., Steiner, M., & Tsudik, G. (1998). Authenticated group key agreement and friends. 17-26. Paper presented at Proceedings of the 1998 5th ACM Conference on Computer and Communications Security, CCS-5, San Francisco, CA, USA, .
Ateniese, Giuseppe ; Steiner, Michael ; Tsudik, Gene. / Authenticated group key agreement and friends. Paper presented at Proceedings of the 1998 5th ACM Conference on Computer and Communications Security, CCS-5, San Francisco, CA, USA, .10 p.
@conference{6eadb98bcd024db5a80e61ddbd9cb6a9,
title = "Authenticated group key agreement and friends",
abstract = "Many modern computing environments involve dynamic peer groups. Distributed simulation, multi-user games, conferencing and replicated servers are just a few examples. Given the openness of today's networks, communication among group members must be secure and, at the same time, efficient. This paper studies the problem of authenticated key agreement in dynamic peer groups with the emphasis on efficient and provably secure key authentication, key confirmation and integrity. It begins by considering 2-party authenticated key agreement and extends the results to Group Diffie-Hellmam key agreement. In the process, some new security properties (unique to groups) are discussed.",
author = "Giuseppe Ateniese and Michael Steiner and Gene Tsudik",
year = "1998",
month = "12",
day = "1",
language = "English (US)",
pages = "17--26",
note = "Proceedings of the 1998 5th ACM Conference on Computer and Communications Security, CCS-5 ; Conference date: 03-11-1998 Through 05-11-1998",

}

Ateniese, G, Steiner, M & Tsudik, G 1998, 'Authenticated group key agreement and friends' Paper presented at Proceedings of the 1998 5th ACM Conference on Computer and Communications Security, CCS-5, San Francisco, CA, USA, 11/3/98 - 11/5/98, pp. 17-26.

Authenticated group key agreement and friends. / Ateniese, Giuseppe; Steiner, Michael; Tsudik, Gene.

1998. 17-26 Paper presented at Proceedings of the 1998 5th ACM Conference on Computer and Communications Security, CCS-5, San Francisco, CA, USA, .

Research output: Contribution to conferencePaper

TY - CONF

T1 - Authenticated group key agreement and friends

AU - Ateniese, Giuseppe

AU - Steiner, Michael

AU - Tsudik, Gene

PY - 1998/12/1

Y1 - 1998/12/1

N2 - Many modern computing environments involve dynamic peer groups. Distributed simulation, multi-user games, conferencing and replicated servers are just a few examples. Given the openness of today's networks, communication among group members must be secure and, at the same time, efficient. This paper studies the problem of authenticated key agreement in dynamic peer groups with the emphasis on efficient and provably secure key authentication, key confirmation and integrity. It begins by considering 2-party authenticated key agreement and extends the results to Group Diffie-Hellmam key agreement. In the process, some new security properties (unique to groups) are discussed.

AB - Many modern computing environments involve dynamic peer groups. Distributed simulation, multi-user games, conferencing and replicated servers are just a few examples. Given the openness of today's networks, communication among group members must be secure and, at the same time, efficient. This paper studies the problem of authenticated key agreement in dynamic peer groups with the emphasis on efficient and provably secure key authentication, key confirmation and integrity. It begins by considering 2-party authenticated key agreement and extends the results to Group Diffie-Hellmam key agreement. In the process, some new security properties (unique to groups) are discussed.

UR - http://www.scopus.com/inward/record.url?scp=0032218234&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0032218234&partnerID=8YFLogxK

M3 - Paper

SP - 17

EP - 26

ER -

Ateniese G, Steiner M, Tsudik G. Authenticated group key agreement and friends. 1998. Paper presented at Proceedings of the 1998 5th ACM Conference on Computer and Communications Security, CCS-5, San Francisco, CA, USA, .