Skip to main content
Log in

Optimal key tree structure for two-user replacement and deletion problems

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

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. The objective is to find the optimal tree structure where the worst case updating cost is minimum. We extend the result of 1-replacement problem in Snoeyink et al. (Proceedings of the twentieth annual IEEE conference on computer communications, pp. 422–431, 2001) to the k-user case. We first show that the k-deletion problem can be solved by handling k-replacement problem. Focusing on the k-replacement problem, we show that the optimal tree can be computed in \(O(n^{(k+1)^{2}})\) time given a constant k. Then we derive a tight degree bound for optimal tree when replacing two users. By investigating the maximum number of leaves that can be placed on the tree given a fixed worst case replacement cost, we prove that 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 can always achieve the minimum worst case 2-replacement cost. Thus the optimal tree for two-user replacement problem can be efficiently constructed in O(n) time.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Chan A, Rajaraman R, Sun Z, Zhu F (2009) Approximation algorithms for key management in secure multicast. In: Proceedings of the 15th annual international conference on computing and combinatorics (COCOON), pp 148–157

    Chapter  Google Scholar 

  • Chan Y-K, Li M, Wu W (2010) Optimal tree structure with loyal users and batch updates. J Combin Optim 1–10

  • Chen ZZ, Feng Z, Li M, Yao FF (2008) Optimizing deletion cost for secure multicast key management. Theor Comput Sci 401:52–61

    Article  MathSciNet  MATH  Google Scholar 

  • Goodrich MT, Sun JZ, Tamassia R (2004) Efficient tree-based revocation in groups of low-state devices. In: Proceedings of the twenty-fourth annual international cryptology conference (CRYPTO), pp 511–527

    Google Scholar 

  • Graham RL, Li M, Yao FF (2007) Optimal tree structures for group key management with batch updates. SIAM J Discrete Math 21(2):532–547

    Article  MathSciNet  MATH  Google Scholar 

  • Li XS, Yang YR, Gouda MG, Lam SS (2001) Batch re-keying for secure group communications. In: Proceedings of the tenth international conference on world wide web, pp 525–534

    Chapter  Google Scholar 

  • Snoeyink J, Suri S, Varghese G (2001) A lower bound for multicast key distribution. In: Proceedings of the twentieth annual ieee conference on computer communications, pp 422–431

    Google Scholar 

  • Wallner D, Harder E, Agee RC (1999) Key management for multicast: issues and architectures, RFC 2627, June

  • Wong CK, Gouda MG, Lam SS (2000) Secure group communications using key graphs. IEEE/ACM Trans Netw 8(1):16–30

    Article  Google Scholar 

  • Wu W, Li M, Chen E (2008a) Optimal tree structures for group key tree management considering insertion and deletion cost. In: 14th annual international computing and combinatorics conference

    Google Scholar 

  • Wu W, Li M, Chen E (2008b) Optimal key tree structure for deleting two or more leaves. In: ISAAC08

    Google Scholar 

  • Zhu F, Chan A, Noubir G (2003) Optimal tree structure for key management of simultaneous join/leave in secure multicast. In: Proceedings of military communications conference, pp 773–778

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Weiwei Wu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wu, W., Li, M. & Chen, E. Optimal key tree structure for two-user replacement and deletion problems. J Comb Optim 26, 44–70 (2013). https://doi.org/10.1007/s10878-011-9431-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-011-9431-1

Keywords

Navigation