1 / 14

Recommendations in Using Group Key Management Algorithms

Recommendations in Using Group Key Management Algorithms. Weifeng Chen Lakshminath R. Dondeti DARPA Information Survivability Conference and Exposition, 2003. Proceedings , Volume: 2 , 22-24 April 2003 Pages:222 - 227 vol.2. OUTLINE. Illustration of LKH-based rekeying

kyrene
Download Presentation

Recommendations in Using Group Key Management Algorithms

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Recommendations in Using Group Key Management Algorithms Weifeng Chen Lakshminath R. Dondeti DARPA Information Survivability Conference and Exposition, 2003. Proceedings ,Volume: 2 ,22-24 April 2003 Pages:222 - 227 vol.2

  2. OUTLINE • Illustration of LKH-based rekeying • Illustration of rekeying using SDR • Analytical comparison • Member and GCKS storage • Rekeying cost • Comparison using simulation • Application scenarios • Conclusion

  3. Illustration of LKH-based rekeying

  4. Illustration of rekeying using SDR

  5. Analytical comparison • member key storage • GCKS key storage • communication overhead

  6. Rekeying type • Immediate rekeying: The GCKS processes member-ship changes immediately; this may result in excessive computation and may not be appropriate for all appli­cations. • periodic batch rekeying: The GCKS rekeys after a fixed period of time [12]. • membership batch rekeying: The GCKS rekeys after a fixed number of members have left the group.

  7. Member and GCKS storage

  8. Rekeying cost

  9. Table 2 shows the rekeying cost. Note that the rekeying cost of LKH is dependant on the height of the tree. Hence keeping the key tree balanced and just large enough to hold the current membership will reduce the rekeying cost.

  10. A rejoining member can be assigned its old position in the tree, and since subset keys do not change during the life of the group, the GCKS does not need to send any keys to the member.

  11. DaSSF simulation result

  12. Conclusion • Our simulation shows that LKH outperforms SDR in immediate rekeying and small batch rekeying. We also observed that LKH is preferred in the scenarios where the number of current members n <<N, and membership variance is low. • In groups where n≒N, SDR performs better for batch rekeying.

  13. If n<<R, subset rekeying cost coincides with n, i.e., each of the remaining members belongs to a different subset. Although the average SDR rekeying cost is 1.3R in [10], it may be much less than R in most cases, because of the member adjacency factor. • Our next course of work is to consider the packet loss,which is not covered in this paper.

More Related