Abstract
We study the optimal structure for group broadcast problem where the key tree model is extensively used. The objective is usually to find an optimal key tree to minimize the cost based on certain assumptions. Under the assumption that n members arrive in the initial setup period and only member deletions are allowed after that period, previous works show that when only considering the deletion cost, the optimal tree can be computed in O(n 2) time. In this paper, we first prove a semi-balance property for the optimal tree and use it to improve the running time from O(n 2) to O(loglogn). Then we study the optimal tree structure when insertion cost is also considered. We show that the optimal tree is such a tree where any internal node has at most degree 7 and children of nodes with degree not equal to 2 or 3 are all leaves. Based on this result we give a dynamic programming algorithm with O(n 2) time to compute the optimal tree.
This work was supported in part by the National Basic Research Program of China Grant 2007CB807900, 2007CB807901, a grant from the Research Grants Council of the Hong Kong Special Administrative Region, China [Project No. CityU 116907], Program for New Century Excellent Talents in University (No.NCET-05-0549) and National Natural Science Foundation of China (No.60775037).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Graham, R.L., Li, M., Yao, F.F.: Optimal Tree Structures for Group Key Management with Batch Updates. SIAM Journal on Discrete Mathematics 21(2), 532–547 (2007)
Goodrich, M.T., Sun, J.Z., Tamassia, R.: Efficient Tree-Based Revocation in Groups of Low-State Devices. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 511–527. Springer, Heidelberg (2004)
Li, M., Feng, Z., Graham, R.L., Yao, F.F.: Approximately Optimal Trees for Group Key Management with Batch Updates. In: Proceedings of the Fourth Annual Conference on Theory and Applications of Models of Computation, pp. 284–295 (2007)
Li, X.S., Yang, Y.R., Gouda, M.G., Lam, S.S.: Batch Re-keying for Secure Group Communications. In: Proceedings of the Tenth International Conference on World Wide Web, pp. 525–534 (2001)
Snoeyink, J., Suri, S., Varghese, G.: A Lower Bound for Multicast Key Distribution. In: Proceedings of the Twentieth Annual IEEE Conference on Computer Communications, pp. 422–431 (2001)
Wallner, D., Harder, E., Agee, R.C.: Key Management for Multicast: Issues and Architectures. RFC 2627 (1999)
Wong, C.K., Gouda, M.G., Lam, S.S.: Secure Group Communications Using Key Graphs. IEEE/ACM Transactions on Networking (8)(1), 16–30 (2000)
Zhu, F., Chan, A., Noubir, G.: Optimal Tree Structure for Key Management of Simultaneous Join/Leave in Secure Multicast. In: Proceedings of Military Communications Conference, pp. 773–778 (2003)
Chen, Z.-Z., Feng, Z., Li, M., Yao, F.F.: Optimizing Deletion Cost for Secure Multicast Key Management. Theoretical Computer Science (2008), doi:10.1016/j.tcs.2008.03.016
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wu, W., Li, M., Chen, E. (2008). Optimal Tree Structures for Group Key Tree Management Considering Insertion and Deletion Cost. In: Hu, X., Wang, J. (eds) Computing and Combinatorics. COCOON 2008. Lecture Notes in Computer Science, vol 5092. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69733-6_51
Download citation
DOI: https://doi.org/10.1007/978-3-540-69733-6_51
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69732-9
Online ISBN: 978-3-540-69733-6
eBook Packages: Computer ScienceComputer Science (R0)