Secure Group Communications Using Key Graphs

DMCA

Secure Group Communications Using Key Graphs (1998)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Chung Kei Wong , Mohamed Gouda , Simon S. Lam

Citations:

550 - 17 self

BibTeX

@TECHREPORT{Wong98securegroup,
    author = {Chung Kei Wong and Mohamed Gouda and Simon S. Lam},
    title = {Secure Group Communications Using Key Graphs},
    institution = {},
    year = {1998}
}

OpenURL

Abstract

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 confidentiality, 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...

Keyphrases

key graph secure group group communication interactive simulation user-key relation authorized receiver packet delivery rekey message group member join leave special class large number scalability problem collaborative work key management critical networking issue real-time information service novel solution authorized sender

DMCA