A-ary tree-based minimum exact cover of leaf set for secure group communication in grids

Proceedings of the 6th International Conference on Grid and Cooperative Computing, GCC 2007

Volumn , Issue , 2007, Pages 11-18

  Xu, Shouzhi ^a   Jiang, Tingyao ^a   Zhong, Alin ^a   Yang, Wangmin ^a   Zhang, Lili ^a   Liu, Qiaoli ^a  

^a CHINA THREE GORGES UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION; DISTRIBUTED COMPUTER SYSTEMS; GRID COMPUTING; SENSOR NETWORKS; SIZE DISTRIBUTION; TECHNOLOGY TRANSFER;

(ALGORITHMIC) COMPLEXITY; COMPLEXITY ANALYSIS; COOPERATIVE COMPUTING; COVER PROBLEMS; GROUP COMMUNICATION (GC); GROUP KEY DISTRIBUTION; GROUP KEY MANAGEMENT; GROUP MEMBERS; GROUP SIZES; INFORMATION SHARING; INTERNATIONAL CONFERENCES; MESSAGE EXCHANGING; SECURE GROUP COMMUNICATIONS; SECURE MULTICAST; SIMULATION DEMONSTRATE;

PUBLIC KEY CRYPTOGRAPHY;

EID: 46449120319     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GCC.2007.35     Document Type: Conference Paper

References (13)

1. Zou Xukai, Dai Yuan-Shun, Xiang Ran. Dual-Level Key Management for secure grid communication in dynamic and hierarchical groups. Future Generation Computer Systems, In Press, Corrected Proof, Available online 22 December 2006.
2. Foster I , Kesselman C , Tsudik G, et al . A security architecture for computational grids. In : Reiter M, ed. Proceedings of the 5th ACM conference on computer and communications security . New York : ACM Press ,1998. 83 - 91.
3. Xie Bing, Gui Xiaolin , Li Yinanet et al. A New Grid Security Framework with Dynamic Access Control. Series Lecture Notes in Computer Science, 2003, vol. 2836: 214 - 225
4. Zhi-Dong Shen, Xiao-Ping Wu, Yu-Hua Wang et al. "Group Key Management in Grid Environment", First International Multi-Symposiums on Computer and Computational Sciences, 2006.:626 - 631
5. Deuk-Whee Kwak; Seung Joo Lee; Jong Won Kim; Jung, E.;An efficient LKH tree balancing algorithm for group key management, IEEE Communications Letters, Vol.10, Issue 3(2006):222 - 224
6. Kin-Ching Chan; Chan, S.-H.G.; "Distributed servers approach for large-scale secure multicast", IEEE Journal on Selected Areas in Communications, Vol.20, Issue 8(2002):1500 - 1510
7. Wen Tao Zhu; "Optimizing the tree structure in secure multicast key management", IEEE Communications Letters, Vol.9, Issue 5(2005):477-479
8. J. Pegueroles, F. Rico-Novella, J. Hernandez-Serrano, et al. Improved LKH for batch rekeying in multicast groups. International Conference on Information Technology. New York (USA): IEEE , 2003. 269 - 273.
9. A.T. Sherman, D.A. McGrew. Key establishment in large dynamic groups using one-way function trees. IEEE Trans. on Software Engineering, 2003, vol. 29(5):444 - 458.
10. W C Huang, C Y Kao, J T Horng. A genetic algorithm approach for set covering problems. Proceedings of the First IEEE Conference on Evolutionary Computation, Los Alamitos (USA), CA: IEEE Computer Society Press, 1994, vol.2:569 - 574
11. Gandhi, Rajiv; Khuller, Samir; Srinivasan, Aravind. Approximation algorithms for partial covering problems. Journal of Algorithms, 2004, vol.53(1): 55-84
12. Yang Zongkai, Xu Shouzhi, Tan Yunmeng. An efficient key updating scheme for multicast key management. in: Asia-Pacific Optical Communications Conference Bellingham(USA): SPIE-Int Society Optical Engineering, 2004: 1096 - 1104
13. Xu Shouzhi, Yang Zongkai, Tan Yunmeng, et al. An efficient batch rekeying scheme based on one-way function tree. IEEE International Symposium on Communications and Information Technologies. New York(USA): IEEE, 2005: 474 - 477