Secure group communications using key graphs
IEEE/ACM Transactions on Networking (TON)
Key Establishment in Large Dynamic Groups Using One-Way Function Trees
IEEE Transactions on Software Engineering
A Hybrid Key Tree Scheme for Multicast to Balance Security and Efficiency Requirements
WETICE '03 Proceedings of the Twelfth International Workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises
Efficient communication-storage tradeoffs for multicast encryption
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Key distribution protocol for secure multicast with reduced communication delay
AMT'11 Proceedings of the 7th international conference on Active media technology
Key distribution for Pay-TV system with reduced computation cost using XOR operation
ADCONS'11 Proceedings of the 2011 international conference on Advanced Computing, Networking and Security
| Hi-index | 0.89 |
We study the problem of designing a storage efficient secure multicast key management scheme based on one-way function trees (OFT) for a prespecified key update communication overhead. Canetti, Malkin and Nissim presented a hybrid model that divides a group of N members into clusters of M members and assigns each cluster to one leaf node of a key tree. Using the model, we formulate a constrained optimization problem to minimize the center storage in terms of the cluster size M. Due to the monotonicity of the center storage with respect to M, we convert the constrained optimization into a fixed point equation and derive the optimal M^* explicitly. We show that the asymptotic value of the optimal M^*, given as @m+a-1log"ealog"e@m with @m=O(logN) and a being the degree of a key tree, leads to the minimal storage as O(NlogN), when the update communication constraint is given as O(logN). We present an explicit design algorithm that achieves minimal center storage for a given update communication constraint.