Name
Abstract | ||
|---|---|---|
One approach to multicast group security is to have a group key shared by every group member. In this paper, we are interested in group key distribution and management. A new simple technique is introduced for key distribution to a large group based on the hierarchical key tree. The new technique uses bit XOR operation between keys to reduce the computation effort, and uses random byte patterns (BPs) to distribute the key material in the multicast message. The new technique has symmetric procedures for message construction by a key distribution center (KDC) when a member joins or leaves the group, which allows the generation of one re-key message that incorporates multiple delays of both joins and leaves. In addition to the substantial decrease in the computation effort, our technique reduces the required group member storage. Finally, a novel model for the key tree in a distributed KDC is introduced. The new model allows sending the re-key message by one KDC to the whole group and other peer KDCs without any increase in the delay or the number of sent messages. Building and replicating an additional KDC key tree achieve this. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1109/ISCC.2000.860634 | ISCC |
Keywords | DocType | ISSN |
group security,additional kdc key tree,re-key message,group key distribution,hierarchical key tree,secure multicasting,key distribution,group member,group key,computation effort,new technique,computer science,cryptography,authentication,computer security,distributed computing,management,key distribution center,access control,data security,distance learning,distributed databases,teleconferencing | Conference | 1530-1346 |
ISBN | Citations | PageRank |
0-7695-0722-0 | 4 | 1.14 |
References | Authors | |
9 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sahar M. Ghanem | 1 | 15 | 4.25 |
| Hussein Abdel-Wahab | 2 | 200 | 24.32 |