Authenticated group key agreement and friends

Giuseppe Ateniese, Michael Steiner, Gene Tsudik

Research output: Contribution to conferencePaperpeer-review

127 Scopus 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.

Original languageEnglish
Pages17-26
Number of pages10
DOIs
StatePublished - 1998
EventProceedings of the 1998 5th ACM Conference on Computer and Communications Security, CCS-5 - San Francisco, CA, USA
Duration: 3 Nov 19985 Nov 1998

Conference

ConferenceProceedings of the 1998 5th ACM Conference on Computer and Communications Security, CCS-5
CitySan Francisco, CA, USA
Period3/11/985/11/98

Fingerprint

Dive into the research topics of 'Authenticated group key agreement and friends'. Together they form a unique fingerprint.

Cite this