Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Exploring Robustness in Group Key Agreement Yair Amir y Yongdae Kim z Cristina NitaRotaru y John Schultz y Jonathan Stanton y
 

Summary: Exploring Robustness in Group Key Agreement 
Yair Amir y Yongdae Kim z Cristina Nita­Rotaru y John Schultz y Jonathan Stanton y
Gene Tsudik x
Abstract
Secure group communication is crucial for building dis­
tributed applications that work in dynamic environments
and communicate over unsecured networks (e.g. the Inter­
net). Key agreement is a critical part of providing security
services for group communication systems. Most of the cur­
rent contributory key agreement protocols are not designed
to tolerate failures and membership changes during execu­
tion. 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.
1 Introduction
The explosive growth of the Internet has increased both
the number and the popularity of applications that require a

  

Source: Amir, Yair - Department of Computer Science, Johns Hopkins University

 

Collections: Computer Technologies and Information Sciences