loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Sixth International Conference on Grid and Cooperative Computing (GCC 2007)
A-ary Tree-based Minimum Exact Cover of Leaf Set for Secure Group Communication in Grids
Urumchi, Xinjiang, China
August 16-August 18
ISBN: 0-7695-2871-6
ASCII Text
x 
 
Shouzhi XU, Tingyao Jiang, Alin Zhong, Wangmin Yang, Lili Zhang, Qiaoli Liu, "A-ary Tree-based Minimum Exact Cover of Leaf Set for Secure Group Communication in Grids," Grid and Cloud Computing, International Conference on, pp. 11-18, Sixth International Conference on Grid and Cooperative Computing (GCC 2007), 2007.
 
 
BibTex
x
 
@article{ 10.1109/GCC.2007.35,
author = {Shouzhi XU and Tingyao Jiang and Alin Zhong and Wangmin Yang and Lili Zhang and Qiaoli Liu},
title = {A-ary Tree-based Minimum Exact Cover of Leaf Set for Secure Group Communication in Grids},
journal ={Grid and Cloud Computing, International Conference on},
volume = {0},
year = {2007},
isbn = {0-7695-2871-6},
pages = {11-18},
doi = {http://doi.ieeecomputersociety.org/10.1109/GCC.2007.35},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Grid and Cloud Computing, International Conference on
TI - A-ary Tree-based Minimum Exact Cover of Leaf Set for Secure Group Communication in Grids
SN - 0-7695-2871-6
SP11
EP18
A1 - Shouzhi XU,
A1 - Tingyao Jiang,
A1 - Alin Zhong,
A1 - Wangmin Yang,
A1 - Lili Zhang,
A1 - Qiaoli Liu,
PY - 2007
KW - null
VL - 0
JA - Grid and Cloud Computing, International Conference on
ER -
 
Shouzhi XU, China Three Gorges University
Tingyao Jiang, China Three Gorges University
Alin Zhong, China Three Gorges University
Wangmin Yang, China Three Gorges University
Lili Zhang, China Three Gorges University
Qiaoli Liu, China Three Gorges University
Secure multicast is an effective group communication technology for information sharing and message exchange in emerging grids. As the group scale in grids may be very large and group members can be very unstable (a member can join or quit the group dynamically), it is hard for conventional group key management schemes to satisfy the efficiency of group key distribution very well because of the complexity of O(c.logn)( n is the group size, and c is the total additions/evictions). This paper gives a minimum exact cover problem of leaf set and discusses its solution based on an a-ary tree model. The correctness of the solution is proven theoretically. Furthermore, the implementation and application of it is illustrated. Both complexity analysis and simulation demonstrate the efficiency and effectiveness of the achievement of group key distribution based on minimum exact cover.
Citation:
Shouzhi XU, Tingyao Jiang, Alin Zhong, Wangmin Yang, Lili Zhang, Qiaoli Liu, "A-ary Tree-based Minimum Exact Cover of Leaf Set for Secure Group Communication in Grids," gcc, pp.11-18, Sixth International Conference on Grid and Cooperative Computing (GCC 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.