Volume 3, Issue 1, January 2015, Pages 21 - 30
An Efficient Structure for LKH Key Tree on Secure Multicast Communications
Available Online 1 January 2015.
- https://doi.org/10.2991/ijndc.2015.3.1.3How to use a DOI?
- IP Multicast, IPsec, GSAKMP, LKH, Pareto Principal
- In order to communicate in cipher over IP multicast, each of joining and leaving participants causes renewing keys. Moreover, the number of renewed keys depends on the key management system. LKH, one of the key management systems, uses a tree structure to manage keys to share with participants. Every node of the tree is given a key, and each leaf of the tree is corresponding to a participant. If all members are handled equally, by using a balanced binary tree, the average number of renewed keys per join and leave is estimated at dlog2 ne , where n denotes the number of participants. In this study, we introduce a scenario that the key management system can distinguish between inconstant members and stable members, instead of handling members equally. Under this scenario, our system improves the number of renewing keys efficiently by considering another tree structure against the balanced binary tree structure.
- Open Access
- This is an open access article distributed under the CC BY-NC license.
Cite this article
TY - JOUR AU - Naoshi Sakamoto PY - 2015 DA - 2015/01/01 TI - An Efficient Structure for LKH Key Tree on Secure Multicast Communications JO - International Journal of Networked and Distributed Computing SP - 21 EP - 30 VL - 3 IS - 1 SN - 2211-7946 UR - https://doi.org/10.2991/ijndc.2015.3.1.3 DO - https://doi.org/10.2991/ijndc.2015.3.1.3 ID - Sakamoto2015 ER -