Wuhan University Journal of Natural Sciences

, Volume 14, Issue 2, pp 137–142 | Cite as

Minimum exact cover problem of group key distribution

Article
First Online:
Received:
  • 72 Downloads

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.

Key words

minimum exact cover problem group key distribution secure multicast group key management 

CLC number

TP 309.2 
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [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.CrossRefGoogle Scholar
  2. [2]
    Selcuk A A, Sidhu D. Probabilistic Optimization Techniques for Multicast Key Management[J]. Computer Networks, 2002, 40(2): 219–234.CrossRefGoogle Scholar
  3. [3]
    Rafaeli S, Hutchison D. A Survey of Key Management for Secure Group Communication[J]. ACM Computing Surveys, 2003, 35(3): 309–329.CrossRefGoogle Scholar
  4. [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.CrossRefGoogle Scholar
  5. [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.CrossRefGoogle Scholar
  6. [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.MATHCrossRefGoogle Scholar
  7. [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.CrossRefGoogle Scholar
  8. [8]
    Zhu Wentao. Optimizing the Tree Structure in Secure Multicast Key Management[J]. Communications Letters, IEEE, 2005, 9(5): 477–479.CrossRefGoogle Scholar
  9. [9]
    Gandhi R, Khuller S, Srinivasan A. Approximation Algorithms for Partial Covering Problems[J]. Journal of Algorithms, 2004, 53(1): 55–84MATHCrossRefMathSciNetGoogle Scholar
  10. [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.CrossRefGoogle Scholar
  11. [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. [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.CrossRefGoogle Scholar
  13. [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.MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Wuhan University and Springer-Verlag GmbH 2009

Authors and Affiliations

  1. 1.School of LawWuhan UniversityWuhanChina
  2. 2.Department of TechnologyGuangzhou Luogang District People’s CourtGuangzhouChina
  3. 3.College of Electronic Engineering and Information TechnologyChina Three Gorges UniversityYichangChina

Personalised recommendations