Skip to main content
SpringerLink
Log in

Minimum exact cover problem of group key distribution

  • Published:
Wuhan University Journal of Natural Sciences

Abstract

Secure group communications are restrained by the number of the group size, number of changes and their distribution, all existing works do not meet the commands of applications with large group size and high dynamic members. In this paper, minimum exact cover problem for group key distribution (GMECP) is presented, and a heuristic solution is testified. Then an algorithm of batch rekeying with renewing cost tending to zero is illustrated, which can process any large number of change requests with best security guaranteed. Efficiency analysis and simulation test show that the achievement can improve the efficiency of any tree-based group key management.

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

Access this article

Log in via an institution

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

  1. Wong C K, Gouda M, Lam S S. Secure Group Communications Using Key Graphs[J]. IEEE/ACM Transactions on Networking, 2000, 8(1): 16–30.

    Article  Google Scholar 

  2. Selcuk A A, Sidhu D. Probabilistic Optimization Techniques for Multicast Key Management[J]. Computer Networks, 2002, 40(2): 219–234.

    Article  Google Scholar 

  3. Rafaeli S, Hutchison D. A Survey of Key Management for Secure Group Communication[J]. ACM Computing Surveys, 2003, 35(3): 309–329.

    Article  Google Scholar 

  4. Cho J H, Chen I R, Wang D C. Performance Optimization Of Region-Based Group Key Management in Mobile Ad Hoc Networks[J]. Performance Evaluation, 2008, 65(5): 319–344.

    Article  Google Scholar 

  5. Mao Yinian, Sun Yan, Wu Min, et al. Dynamic Join-Exit-Tree Amortization and Scheduling for Contributory Key Management[J]. IEEE/ACM Transactions on Networking, 2006, 14(5): 1128–1140.

    Article  Google Scholar 

  6. Hassen H R, Bouabdallah A, Bettahar H, et al. Key Management for Content Access Control in a Hierarchy[J]. Computer Networks, 2007, 51(11): 3197–3219.

    Article  MATH  Google Scholar 

  7. Sherman A T, McGrew D A. Key Establishment in Large Dynamic Groups Using One-Way Function Trees[J]. IEEE Transactions on Software Engineering, 2003, 29(5): 444–458.

    Article  Google Scholar 

  8. Zhu Wentao. Optimizing the Tree Structure in Secure Multicast Key Management[J]. Communications Letters, IEEE, 2005, 9(5): 477–479.

    Article  Google Scholar 

  9. Gandhi R, Khuller S, Srinivasan A. Approximation Algorithms for Partial Covering Problems[J]. Journal of Algorithms, 2004, 53(1): 55–84

    Article  MATH  MathSciNet  Google Scholar 

  10. Pegueroles J, Rico-Novella F, Hernandez-Serrano J, et al. Improved LKH for Batch Rekeying in Multicast Groups[C] // Proc IEEE Int Conf on Information Technology Research and Education. Newark: IEEE Press, 2003: 269–273.

    Chapter  Google Scholar 

  11. Onen M, Molva R. Reliable Group Rekeying with a Customer Perspective[C]// Proceedings of the GLOBECOM’ 04. Dallas: IEEE Press, 2004: 2072–2076.

    Google Scholar 

  12. Sherman A T, McGrew D A. Key Establishment in Large Dynamic Groups Using One-Way Function Trees[J]. IEEE Trans. on Software Engineering, 2003, 29(5):444–458.

    Article  Google Scholar 

  13. Chen Jianer, Kanj I A, Xia Ge. Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems[J]. Algorithmica, 2005, 43(4): 245–273.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Law, Wuhan University, Wuhan, 430072, Hubei, China

    Xiong Fu

  2. Department of Technology, Guangzhou Luogang District People’s Court, Guangzhou, 510730, Guangdong, China

    Xiong Fu

  3. College of Electronic Engineering and Information Technology, China Three Gorges University, Yichang, 443002, Hubei, China

    Shouzhi Xu

Authors
  1. Xiong Fu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shouzhi Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xiong Fu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fu, X., Xu, S. Minimum exact cover problem of group key distribution. Wuhan Univ. J. Nat. Sci. 14, 137–142 (2009). https://doi.org/10.1007/s11859-009-0209-6

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11859-009-0209-6

Key words

CLC number

Search

Navigation