DocumentCode
2394503
Title
Dynamic contributory key management based on Weighted-Join-Exit-Tree
Author
Gu, Xiaozhuo ; Cao, Zhenhuan ; Yang, Jianzu ; Lan, Julong
Author_Institution
NDSC, Zhengzhou
fYear
2008
fDate
16-19 Nov. 2008
Firstpage
1
Lastpage
7
Abstract
Time efficiency in key establishment and update is one of the major problems contributory key managements strive to improve. In this paper, we present a contributory group key management based on weighted-join-exit-tree and named as WJT to get better time efficiency in key update. Built upon tree-based group key management, WJT has three improvements, the first is the join algorithm to inserting the new user at the root of the join tree, the second is the exit tree structure organized as a weighted tree according to userspsila leaving time, and the last is the tree balancing algorithm to minimize the main tree height. Theoretical analysis shows that the asymptotic average join time and leave time of WJT are reduced to O(1) from previous O(log(log n)), where n is the group size. Simulations and comparisons with existing key managements demonstrate that WJT is efficient in group key establishment and update.
Keywords
computational complexity; cryptography; trees (mathematics); asymptotic average join time; dynamic contributory group key management; tree balancing algorithm; tree-based group key management; weighted-join-exit-tree; Cost function; DH-HEMTs; Optimization methods; Protocols; Time measurement; Tree data structures;
fLanguage
English
Publisher
ieee
Conference_Titel
Military Communications Conference, 2008. MILCOM 2008. IEEE
Conference_Location
San Diego, CA
Print_ISBN
978-1-4244-2676-8
Electronic_ISBN
978-1-4244-2677-5
Type
conf
DOI
10.1109/MILCOM.2008.4753171
Filename
4753171
Link To Document