Exploring Robustness in Group Key Agreement

Abstract

Secure group communication is crucial for building distributed applications that work in dynamic environments and communicate over unsecured networks (e.g. the Internet). Key agreement is a critical part of providing security services for group communication systems. Most of the current contributory key agreement protocols are not designed to tolerate failures and membership changes during execution. In particular, nested or cascaded group membership events (such as partitions) are not accommodated. In this paper we present the first robust contributory key agreement protocols resilient to any sequence of events while preserving the group communication membership and ordering guarantees.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 2000
Accession Number
ADA484060

Entities

People

  • Cristina Nita-Rotaru
  • Gene Tsudik
  • John Schultz
  • Jonathan Stanton
  • Yair Amir
  • Yongdae Kim

Organizations

  • Johns Hopkins University

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Agreements
  • Algorithms
  • Communication Systems
  • Computations
  • Computer Communications
  • Computer Networks
  • Computer Science
  • Digital Communications
  • Electronic Mail
  • Electronic Messaging
  • Environment
  • Guarantees
  • Motivation
  • Network Protocols
  • Networks
  • Security
  • Voice Communications

Fields of Study

  • Computer science

Readers

  • Distributed Systems and Data Platform Development
  • Parallel and Distributed Computing.
  • Strategic Security Studies