Abstract
Key tree is a popular model to maintain the security of group information sharing by using a tree structure to maintain the keys held by different users. Previously, researchers proved that to minimize the worst case updating cost in case of single user deletion, one needs to use a special 2-3 tree. In this paper, we study the average case for user update. We prove that in the optimal tree, the branching degree of every node can be bounded by 3 and furthermore the structure of the optimal tree can be pretty balanced. We also show the way to construct the optimal tree when there are loyal users in the group.
This work was fully supported by a grant from the Research Grants Council of the Hong Kong Special Administrative Region, China [Project No. CityU 122512].
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
Similar content being viewed by others
References
Chan, Y.K., Li, M., Wu, W.: Optimal tree structure with loyal users and batch updates. J. Comb. Optim. 22, 630–639 (2011)
Graham, R.L., Li, M., Yao, F.F.: Optimal tree structures for group key management with batch updates. SIAM J. Disc. Math. 21(2), 532–547 (2007)
Li, X.Z., Yang, Y.R., Gouda, M.G., Lam, S.S.: Batch rekeying for secure group communications. In: WWW 2001 Proceedings of the 10th International Conference on World Wide Web, pp. 525–534. ACM, New York (2001)
Chen, Z.-Z., Feng, Z., Li, M., Yao, F.F.: Optimizing deletion cost for secure multicast key management. Theor. Comput. Sci. 401(1–3), 52–61 (2008)
Li, M., Feng, Z., Zang, N., Graham, R.L., Yao, F.F.: Approximately optimal trees for group key management with batch updates. Theor. Comput. Sci. 410, 1013–1021 (2009)
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)
Wong, C.K., Gouda, M.G., Lam, S.S.: Secure group communications using key graphs. ACM SIGCOMM Comput. Commun. Rev. 28(4), 68–79 (2000)
Wu, W., Li, M., Chen, E.: Optimal tree structures for group key tree management considering insertion and deletion cost. Theor. Comput. Sci. 410, 2619–2631 (2009)
Wu, W., Li, M., Chen, E.: Optimal key tree structure for two-user replacement and deletion problems. J. Comb. Optim. 26(1), 44–70 (2013)
Yang, R.Y., Li, X.S., Zhang, X.B., Lam, S.S.: Reliable group rekeying: a performance analysis. In: ACM SIGCOMM Computer Communication Review - Proceedings of the 2001 SIGCOMM Conferrence, vol. 31, no. 4, pp. 27–38 (2001)
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. IEEE Computer Society, Washington, DC (2003)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Guo, S., Li, M., Zhao, Y. (2014). Optimal Trees for Minimizing Average Individual Updating Cost. In: Zhang, Z., Wu, L., Xu, W., Du, DZ. (eds) Combinatorial Optimization and Applications. COCOA 2014. Lecture Notes in Computer Science(), vol 8881. Springer, Cham. https://doi.org/10.1007/978-3-319-12691-3_28
Download citation
DOI: https://doi.org/10.1007/978-3-319-12691-3_28
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-12690-6
Online ISBN: 978-3-319-12691-3
eBook Packages: Computer ScienceComputer Science (R0)