@inproceedings{134e6d6640b1496fb7a968990fe98d7c, title = "Optimal key tree structure for deleting two or more leaves", abstract = "We study the optimal tree structure for the key management problem. In the key tree, when two or more leaves are deleted or replaced, the updating cost is defined to be the number of encryptions needed to securely update the remaining keys. Our objective is to find the optimal tree structure where the worst case updating cost is minimum. We first prove the degree upper bound (k∈+∈1)2∈-∈1 when k leaves are deleted from the tree. Then we focus on the 2-deletion problem and prove that the optimal tree is a balanced tree with certain root degree 5∈ ∈d∈ ∈7 where the number of leaves in the subtrees differs by at most one and each subtree is a 2-3 tree. {\textcopyright} 2008 Springer Berlin Heidelberg.", author = "Weiwei Wu and Minming Li and Enhong Chen", year = "2008", doi = "10.1007/978-3-540-92182-0_10", language = "English", isbn = "3540921818", volume = "5369 LNCS", series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)", publisher = "Springer Verlag", pages = "77--88", booktitle = "Algorithms and Computation", address = "Germany", note = "19th International Symposium on Algorithms and Computation, ISAAC 2008 ; Conference date: 15-12-2008 Through 17-12-2008", }