Sciweavers

Share
SIGCOMM
1998
ACM

Secure Group Communications Using Key Graphs

9 years 8 months ago
Secure Group Communications Using Key Graphs
Many emerging applications (e.g., teleconference, real-time information services, pay per view, distributed interactive simulation, and collaborative work) are based upon a group communications model, i.e., they require packet delivery from one or more authorized senders to a very large number of authorized receivers. As a result, securing group communications (i.e., providing con dentiality, integrity, and authenticity of messages delivered between group members) will become a critical networking issue. In this paper, we present a novel solution to the scalability problem of group/multicast key management. We formalize the notion of a secure group as a triple (U K R) where U denotes a set of users, K a set of keys held by the users, and R a user-key relation. We then introduce key graphs to specify secure groups. For a special class of key graphs, we present three strategies for securely distributing rekey messages after a join/leave, and specify protocols for joining and leaving a s...
Chung Kei Wong, Mohamed G. Gouda, Simon S. Lam
Added 05 Aug 2010
Updated 05 Aug 2010
Type Conference
Year 1998
Where SIGCOMM
Authors Chung Kei Wong, Mohamed G. Gouda, Simon S. Lam
Comments (0)
books