Secure group communications using key graphs
IEEE/ACM Transactions on Networking (TON)
Batch rekeying for secure group communications
Proceedings of the 10th international conference on World Wide Web
Optimal Tree Structures for Group Key Management with Batch Updates
SIAM Journal on Discrete Mathematics
Optimizing deletion cost for secure multicast key management
Theoretical Computer Science
Optimal Key Tree Structure for Deleting Two or More Leaves
ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
Optimal tree structures for group key tree management considering insertion and deletion cost
Theoretical Computer Science
A lower bound for multicast key distribution
Computer Networks: The International Journal of Computer and Telecommunications Networking
Optimal tree structure for key management of simultaneous join/leave in secure multicast
MILCOM'03 Proceedings of the 2003 IEEE conference on Military communications - Volume II
Optimal key tree structure for two-user replacement and deletion problems
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
We study the probabilistic model in the key tree management problem. Users have different behaviors. Normal users have probability p to issue join/leave request while the loyal users have probability zero. Given the numbers of such users, our objective is to construct a key tree with minimum expected updating cost. We observe that a single LUN (Loyal User Node) is enough to represent all loyal users. When 1驴p驴0.57 we prove that the optimal tree that minimizes the cost is a star. When 1驴p0.57, we try to bound the size of the subtree rooted at every non-root node. Based on the size bound, we construct the optimal tree using dynamic programming algorithm in O(n驴K+K 4) time where K=min驴{4(log驴(1驴p)驴1)驴1,n} and n is the number of normal users.