An efficient LKH tree balancing algorithm for group key management
- Abstract
- The efficiency and security of secure group communication are dependent on the group key manager (GKM), which manages the group keys and membership. Although a GKM can employ any kind of group key management algorithm, we adopt the logical key hierarchy (LKH) for its efficiency and scalability. LKH is a tree-based group key management algorithm, which is more efficient when the key tree is balanced. However, only a few papers or documents have dealt with practical tree balancing techniques so far. In this letter, we propose LKHTreeManager, an LKH key tree balancing algorithm that is efficient for a large and highly dynamic secure group. © 2006 IEEE.
- Author(s)
- Kwak, D.-W.; Lee, S.J.; KIM, JONG WON; Jung, E.
- Issued Date
- 2006
- Type
- Article
- DOI
- 10.1109/LCOMM.2006.1603391
- URI
- https://scholar.gist.ac.kr/handle/local/17984
- 공개 및 라이선스
-
- 파일 목록
-
Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.